DocumentCode :
2889353
Title :
Mining Main Points of Knowledge in Relational Databases for Classification
Author :
Xiao-Yuan Xu
Author_Institution :
Fac. of Comput., Guangdong Univ. of Technol.
fYear :
2006
fDate :
13-16 Aug. 2006
Firstpage :
1265
Lastpage :
1270
Abstract :
Class association rules can be used not only for concept description but also for classification, so mining class association rules has drawn wide attention in data mining field. Specially, associative classification, which is based on class association rules, has been a hot spot in data mining research and machine learning community. At present, it is widely accepted that in general, associative classification has higher accuracy and better robustness than decision tree classification. However, associative classification has some deflects such as slow performance, huge memory usage and large-size classifying model. In this paper, a new idea is proposed to mine main points of knowledge in relational databases based on class association rules, which can be successfully used for fast, accurate and robust classification
Keywords :
data mining; pattern classification; relational databases; associative classification; class association rules; data mining; knowledge mining; machine learning; relational databases; Association rules; Classification tree analysis; Computer science; Cybernetics; Data engineering; Data mining; Decision trees; Itemsets; Machine learning; Relational databases; Robustness; Data mining; class association rules; classification; knowledge discovery; main points of knowledge;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Machine Learning and Cybernetics, 2006 International Conference on
Conference_Location :
Dalian, China
Print_ISBN :
1-4244-0061-9
Type :
conf
DOI :
10.1109/ICMLC.2006.258650
Filename :
4028258
Link To Document :
بازگشت