Bottom-up Pittsburgh Approach for Discovery of Classification Rules

被引:0
作者
Sharma, Priyanka [1 ]
Ratnoo, Saroj [2 ]
机构
[1] GJUS&T, Hisar, Haryana, India
[2] GJUS&T, CSE Dept, Hisar, Haryana, India
来源
2014 INTERNATIONAL CONFERENCE ON CONTEMPORARY COMPUTING AND INFORMATICS (IC3I) | 2014年
关键词
Bottom-up approach; Pittsburgh approach; classification rule;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents bottom-up Pittsburgh approach for discovery of classification rules. Population initialization makes use of entropy as the attribute significance measure and contains variable sized organizations. Each organization contains a set of IF-THEN rules. As bottom-up approach is employed, so traditional operators are not feasible and efficient to use. Therefore, four evolutionary operators are devised for realizing the evolutionary operations performed on organizations. Bottom-up Pittsburgh approach gives best set of rule having good accuracy. In experiments, the effectiveness of the proposed algorithm is evaluated by comparing the results of bottom-up Pittsburgh with and without entropy to the top-down Michigan approach with and without entropy on 10 datasets from the UCI and KEEL repository. All results show that bottom-up Pittsburgh approach achieves a higher predictive accuracy and is more consistent.
引用
收藏
页码:31 / 37
页数:7
相关论文
共 21 条
  • [1] Alcala-Fdez J., 2011, J MULT VALUED LOG SO, V17
  • [2] [Anonymous], 1980, THESIS
  • [3] [Anonymous], GEN ALG THEIR APPL P
  • [4] [Anonymous], 2011, Pei. data mining concepts and techniques
  • [5] [Anonymous], 2003, Advances in evolutionary computing
  • [6] Bacardit J, 2006, GECCO 2006: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOL 1 AND 2, P1441
  • [7] Back T., 1997, IEEE Transactions on Evolutionary Computation, V1, P3, DOI 10.1109/4235.585888
  • [8] Blake C. L., 1998, Uci repository of machine learning databases
  • [9] Freitas A.A., 2008, Soft Computing for Knowledge Discovery and Data Mining, P79, DOI DOI 10.1007/978-0-387-69935-6_4
  • [10] Freitas A.A., 2002, NAT COMP SER