Title :
Boolean Factor Analysis for Data Preprocessing in Machine Learning
Author_Institution :
Dept. of Comput. Sci., Palacky Univ., Olomouc, Czech Republic
Abstract :
We present two input data preprocessing methods for machine learning (ML). The first one consists in extending the set of attributes describing objects in input data table by new attributes and the second one consists in replacing the attributes by new attributes. The methods utilize formal concept analysis (FCA) and boolean factor analysis, recently described by FCA, in that the new attributes are defined by so-called factor concepts computed from input data table. The methods are demonstrated on decision tree induction. The experimental evaluation and comparison of performance of decision trees induced from original and preprocessed input data is performed with standard decision tree induction algorithms ID3 and C4.5 on several benchmark datasets.
Keywords :
Boolean functions; data handling; decision trees; formal concept analysis; learning (artificial intelligence); Boolean factor analysis; decision tree induction algorithms C4.5; decision tree induction algorithms ID3; factor concepts; formal concept analysis; input data preprocessing methods; input data table; machine learning; Bismuth; Data mining; Data preprocessing; Decision trees; Learning systems; Machine learning; Matrix decomposition; data preprocessing; decision trees; formal concept; machine learning; matrix decomposition;
Conference_Titel :
Machine Learning and Applications (ICMLA), 2010 Ninth International Conference on
Conference_Location :
Washington, DC
Print_ISBN :
978-1-4244-9211-4
DOI :
10.1109/ICMLA.2010.141