Dimensionality reduction for machine learning Algorithms
Cairo University, Institute of statistical studies and research, the Egyptian computer journal • 2001
Publication Information
Authors
Raafat A. El-Kammar, Atta E. El-Alfy, Mohamed I. Sharawy, Mohye- E. El-Alame
Keywords
Not Available
Journal
Cairo University, Institute of statistical studies and research, the Egyptian computer journal
Publisher
Not Available
Volume
29
Issue
1
Pages
138-154
publication.type
International
Paper Link
Not Available
Supplementary Materials
Not Available
Abstract
Learning algorithms generally require that database be described in terms of a set of measurable features. Feature extraction is the process of driving new features from the original features in order to reduce the cost of feature measurement, increase classifier efficiency and allow higher classification accuracy. This paper presents a proposed algorithm for feature extraction from real world (medical) database. The algorithm performs two simultaneous stages. The first stage (rough pruning) deals with memo (text) attributes, abstracts it with the help of specific domain dictionary then drops the less information attribute(s) via probability measure of the values inside each attribute. In the second stage (fine pruning) the set of relevant attribute is determined via the calculation of certain evaluation function. This function depends on the calculation of the correlation and conditional probability between attributes-to-attribute and attribute-to-target. The paper also presents a proposed search algorithm that reduces the search space linearly.
Staff Members - Benha University