An efficient classifier design integrating rough set and set oriented database operations

Applied Soft Computing Journal

Volumn 11, Issue 2, 2011, Pages 2279-2285

  Kumar Das, Asit ^a   Sil, Jaya ^a  

^a INDIAN INSTITUTE OF ENGINEERING SCIENCE AND TECHNOLOGY   (India)

Author keywords

Classification; Data mining; Decision tree; Graph theory; Rough set theory

Indexed keywords

ATTRIBUTE REDUCTION ALGORITHM; CLASSIFICATION; CLASSIFICATION OF DATA; CLASSIFIER DESIGN; DECISION RULES; DECISION-TREE ALGORITHM; DIMENSIONALITY REDUCTION; FEATURE SUBSET SELECTION; KNOWLEDGE DISCOVERY PROCESS; MACHINE-LEARNING; PROBABILITY THEORY; REDUCTS; RELATIONAL ALGEBRA; ROUGH SET;

ALGEBRA; ALGORITHMS; CLASSIFICATION (OF INFORMATION); CLASSIFIERS; DATA MINING; DATA REDUCTION; DECISION TREES; FEATURE EXTRACTION; GRAPH THEORY;

ROUGH SET THEORY;

EID: 78751604427     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2010.08.008     Document Type: Conference Paper

References (44)

1. C. Carter, and H. Hamilton Efficient attribute-oriented generalization for knowledge discovery from large databases IEEE Transactions on Knowledge and Data Engineering 10 1998 193 208
2. G. Dong, and J. Li Efficient mining of emerging patterns: discovering trends and differences Proceedings 1999 International Conference on Knowledge Discovery and Data Mining (KDD'99), vol. 43-52 San Diego, CA, August 1999
3. M. Klemettinen, H. Mannila, P. Ronkainen, and H.A.I. Toivonen Finding interesting rules from large sets of discovered association rules Proceedings of the 3rd International Conference on Information and Knowledge Management (CIKM'94) 1994 ACM Press New York 401 407
4. Z. Pawlak Rough sets International Journal of Information and Computer Sciences 11 1982 341 356
5. Z. Pawlak Rough set theory and its applications to data analysis Cybernetics and Systems 29 1998 661 688
6. Z. Pawlak Rough Sets - Theoretical Aspects of Reasoning About Data 1991 Kluwer Academic Publishers Boston, London, Dordrecht p. 229
7. X. Ru-Zhi, N. Pei-yao, L. Pei-guang, and C. Dong-sheng Cloud model based data attributes reduction for clustering Proc. of the 1st International Conference on Forensic Applications and Techniques in Telecommunications, Information and Multimedia and Workshop ICST, January 2008
8. W. Zhu, and Wang Reduction and axiomization of covering generalized rough sets Information Sciences 152 2003 217 230
9. Y. Huang, X. Huang, and N. Cercone Feature Selection with Rough Sets for Web Page Classification Transactions on Rough Sets 2004 SpringerLink Publishers
10. S. Tan, Y. Wang, and X. Cheng An efficient feature ranking for text categorization Proc. of the ACM Symposium on Applied Computing - SAC'08 2008 407 413
11. Y. Li, and N. Zhong Rough association rule mining in text documents for acquiring web user information needs Proceedings of the IEEE/WIC/ACM International Conference on Web Intelligence - WI'06 IEEE Computer Society 2006 226 232
12. T.Y. Lin, N. Carcone, Rough Sets and Data Mining: Analysis of Imprecise Data 1997 Kluwer Academic Publishers
13. A. Skowron, and C. Rauszer The discernibility matrics and functions in information systems R. Slowinski, Intelligent Decision Support 1992 331 362
14. R. Jensen, and Q. Shen Fuzzy-rough attribute reduction with application to web categorization Fuzzy Sets and Systems 141 2004 469 485
15. G.Y. Wang, H. Yu, and D.C. Yang Decision table reduction based on conditional information entropy Chinese Journal of Computers 25 7 2002 1 9
16. J. Bazan A comparison of dynamic and non-dynamic rough set methods for extracting laws from decision system L. Polkowski, A. Skowron, Rough Sets in Knowledge Discovery vol.1 1998 Physica-Verlag 321 365
17. W. Swiniarski, and A. Skowron Rough set methods in feature selection and recognition Pattern Recognition Letters 24 6 2003 833 849
18. J. Quinlan, and R. Rivest Inferring decision trees using the minimum description length principle Information and Computation 80 1989 227 248
19. M. Hansen, and B. Yu Model selection and the principle of minimum description length Journal of the American Statistical Association 96 2001 746 774
20. J.R. Quinlan The minimum description length and categorical theories Proceedings 11th International Conference on Machine Learning, New Brunswick Morgan Kaufmann, San Francisco 1994 233 241
21. Roman, W. Swiniarski, and L. Hargis Rough sets as a frontend as neural-networks texture classifiers Neurocomputing 36 2001 85 102
22. G. Fumera, and F. Roli Analysis of error-reject trade off in linearly combined multiple classifiers Pattern Recognition 37 2004 1245 1265
23. J. Kittler, and M. Hatef On combining classifiers IEEE Transactions on Pattern Analysis and Machine Intelligence 20 3 1998 139 226
24. Y. Daren, H. Qinghua, and B. Wen Combining multiple neural networks for classification based on rough set reduction Proceedings of the IEEE International Conference on Neural Network & Signal Processing Nanjing, China, December 14-17 2003
25. M. Koppen, and S. Engerson Integrating multiple classifiers by finding their Area of expertise Working Notes of the AAAi Workshops on Integrating Multiple Learned Models 1999
26. E. Bauer, and R. Kohavi An empirical comparison of voting classification algorithms: bagging, boosting, and variants Machine Learning 1998
27. Y Freund, and R. Schapire Experiments with new boosting algorithms Proceedings of the International Conference on Machine Learning 1996
28. R.E. Schapire, Y. Freund, and P. Bartlett Explanation for the effectiveness of voting method Machine Learning 1998
29. Quinlan Introduction of decision trees Machine Learning 1 1 1986 81 106
30. J. Wang, and D.Q. Miao Analysis on attribute reduction strategies of rough set Journal of Computer Science & Technology 13 2 1998 189 193
31. X. Hu, and V. Inc Ensemble of Classifier Using Rough Set Theory, 0-7695-1119-8/01 2001 IEEE
32. X. Hu, N. Carcone, and W. Ziarko Construction of Multiple Knowledge Bases for Data Using Rough Set Theory: Analysis of Imprecise Data 1997 Kluwer Academic Publishers
33. T.G. Dietterich An Experimental Comparison of three methods for constructing ensembles of decision trees: bagging, boosting and randomization Machine Learning 1998
34. R. Maclin, and Z. Opitz An empirical evaluation of bagging and boosting Proceedings of the International Conference on Machine Learning 1997
35. P. Murphy, and W. Aha UCI Repository of Machine Learning Databases 1996 http://www.ics.uci.edu/mlearn/MLRepository.html
36. F.M. Brown Boolean Reasoning 1990 Kluwer Dordrecht
37. R.E. Schapire, and Y. Freund Boosting of margin: a new explanation for the effective of voting methods Proceedings of the International Conference on Machine Learning 1997
38. R. Kerber ChiMerge: discretization of numeric attributes Proceedings of AAAI-92, 9th International Conference on Artificial Intelligence AAAI-Press 1992 123 128
39. G.W. Corder, and D.I. Foreman Nonparametric Statistics for Non-Statisticians: A Step-by-Step Approach 2009 Wiley New Jersey
40. F. Wilcoxon Individual comparisons by ranking methods Biometrics 1 1945 80 83 http://sci2s.ugr.es/keel/pdf/algorithm/articulo/wilcoxon1945.pdf
41. M. Hollander, and D.A. Wolfe Nonparametric Statistical Methods 1999 John Wiley & Sons, Inc. Hoboken, NJ
42. P. Clark, and T. Niblett The CN2 induction algorithm Machine Learning 3 1 1989 261 284
43. W. Cohen Fast effective rule induction Proceedings of the 12th International Conference on Machine Learning 1995 115 123
44. J. Fürnkfranz, and G. Widmar Incremental reduced error pruning Proceedings of the 11th International Conference on Machine Learning 1994 70 77