Using rough sets theory and database operations to construct a good ensemble of classifiers for data mining applications

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2001, Pages 233-240

  Hu, Xiaohua ^a  

^a Vigilance Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 4544223395     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. Agrawal R., Imielinski T., Swami A., Mining Associations between Sets of Items in Massive Databases, Proc. of ACM SIGMOD 1993
2. Ali, K.M. and Pazziani, M.J., Error Reduction through Learning Multiple Description Machine Learning, 24(3), 173-202
3. Bauer E., Kohavi R., An Empirical Comparison of Voting Classification Algorithms: Bagging, Boosting, and Variants, Machine Learning, 1998
4. Cestnik B., Estimating probabilities: A Crucial Task in Machine Learning, Europe Conference in Artificial Intelligence, 1990
5. Cherkauer, K.J, Human Expert-Level Performance on a Scientific Image Analysis Task by A System Using Combined Artificial Neural Networks, in Working Notes of the AAAI Workshop on Integrating Multiple Learned Models, 1996
6. Dietterich T.G., Machine Learning Research: Four Current Directions, Artificial Intelligence Magazine, 18:4
7. Dietterich T.G., An Experimental Comparison of Three Methods for Constructing Ensembles of Decision Trees: Bagging, Boosting, and Randomization, Machine Learning, 1998
8. Elkan C., Boosting and Naive Bayesian Learning, Tech. Report CS97-557, Dept. of Computer Science, Univ. of California, San Diego
9. Freund Y., and Schapire, R., Experiments with a New Boosting Algorithms, Proc of the International Conf. on Machine Learning, 1996
10. Hu X., Cercone N., and Ziarko W., Construction of Multiple Knowledge Bases from Data Using Rough Sets Theory, Rough Sets and Data Mining: Analysis of Imprecise Data, Kluwer Academic Publishers, 1997
11. Hu X., and Cercone N., Data Mining via Generalization, Discretization and Rough Set Feature Selection, Knowledge and Information System: An International Journal, Vol. 1 No. 1, 1999
12. Kohavi R., John H., Wrappers for Feature Subset Selection, Artificial Intelligence Review, 2000
13. Koppen M., Engerson, S., Integrating Multiple Classifiers by Finding Their Area of Expertise, in Working Notes of the AAAI Workshop on Integrating Multiple Learned Models, 1999
14. Kohavi R., Sahami M., Error-based and Entropy-based Discretization of Continuous Features, Proc. of the 2nd International Conference on Knowledge Discovery and Data Mining, AAAI, 1996
15. Kumar A., New Techniques for Data Reduction in a Database System for Knowledge Discovery Applications, Journal of Intelligent Information Systems, 10(3)
16. Maclin,R. and Opitz, D, An Empirical Evaluation of Bagging and Boosting, Proc. of the International Conf. On Machine Learning, 1997
17. Murphy P., Aha W., UCI repository of machine learning databases, http://www.ics.uci.edu/mlearn/MLRepository.html, 1996.
18. Quinlan J. R., C4.5: Program for Machine Learning, Morgan Kaufmann, 1993.
19. Quinlan J. R., Bagging, Boosting and C4.5 Proc. of the America Association of Artificial Intelligence, 1996
20. Quinlan J. R., MiniBoosting Decision Tree, Journal of Artificial Intelligence Research, 1998
21. Pawlak Z., Rough Sets, International Journal of Information and Computer Science, Vol. 11(5), pp341-356, 1982
22. Schpire, R.E., Freund, Y., Boosting the Margin: A New Explanation for the Effective of Voting Methods, Proc. of the International Conf. on Machine Learning, 1997
23. Schapire, R.E, Freund y., Bartlett, P., Explanation for the Effectiveness of Voting Methods, Machine Learning, 1998
24. Ziarko, W., Variable Precision Rough Set Model, Journal of Computer and System Science, Vol 46. No. 1, 1993