Increasing the classification accuracy of simple Bayesian classifier

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3192, Issue , 2004, Pages 198-207

  Kotsiantis, S B ^a   Pintelas, P E ^a  

^a UNIVERSITY OF PATRAS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BENCHMARKING; COMPUTATIONAL METHODS; FEATURE EXTRACTION; LARGE SCALE SYSTEMS; PROBABILITY DISTRIBUTIONS; ADAPTIVE BOOSTING; ARTIFICIAL INTELLIGENCE; BAYESIAN NETWORKS; DISCRETE EVENT SIMULATION;

BAYESIAN CLASSIFIER; CLASSIFICATION ACCURACY; DATASETS; PRODUCT DISTRIBUTION; COMBINING CLASSIFIERS; DISCRETIZATION METHOD; FEATURE SELECTION METHODS; INDIVIDUAL CLASSIFIERS; PREDICTION ACCURACY; STATE-OF-THE-ART ALGORITHMS;

CLASSIFICATION (OF INFORMATION); ITERATIVE METHODS;

EID: 22944455545     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30106-6_20     Document Type: Conference Paper

References (27)

1. D. Aha, Lazy Learning, Dordrecht: Kluwer Academic Publishers, 1997.
2. E. Bauer, and R. Kohavi. An empirical comparison of voting classification algorithms: Bagging, boosting, and variants, Machine Learning, 36 (1999): 105-139.
3. C.L. Blake and C.J. Merz, UCI Repository of machine learning databases [http://www.ics.uci.edu/~mlearn/MLRepository.html]. Irvine, CA: University of California, Department of Information and Computer Science (1998).
4. L. Breiman, Bagging Predictors. Machine Learning, 24 (1996): 123-140.
5. P. Domingos and M. Pazzani, On the optimality of the simple Bayesian classifier under zero-one loss, Machine Learning, 29(1997): 103-130.
6. J. Dougherty, R. Kohavi and M. Shami. Supervised and unsupervised discretization of continuous features. In Proceedings of the twelfth International Conference of Machine Learning. Morgan kaufmann (1995).
7. U. Fayyad and K. Irani, Multi-interval discretization of continuous-valued attributes for classification learning. In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, Morgan Kaufmann (1993): 1022-1027.
8. Y. Freund and R. E. Schapire, Experiments with a New Boosting Algorithm, In Proceedings of ICML'96, 148-156.
9. J. H. Friedman, On bias, variance, 0/1-loss and curse-of-dimensionality. Data Mining and Knowledge Discovery, 1(1997): 55-77.
10. N. Friedman, D. Geiger and M. Goldszmidt, Bayesian network classifiers. Machine Learning, 29(1997): 131-163.
11. J. Gama, Iterative Bayes. Intelligent Data Analysis, 6(2000): 463 - 473.
12. R. Kohavi and G. John, Wrappers for feature subset selection, Artificial Intelligence, 2(1997): 273-324.
13. P. Langley and S. Sage, Induction of selective Bayesian classifiers. In Proc. of the 10th Conference on Uncertainty in Artificial Intelligence, Seattle, (1994): 399-406.
14. D. Michie, D. Spiegelhalter and C. Taylor, Machine Learning, Neural and Statistical Classification, Ellis Horwood, 1994.
15. T. Mitchell, Machine Learning, McGraw Hill, 1997.
16. M. Pazzani, Searching for dependencies in Bayesian classifiers. Artificial Intelligence and Statistics IV, Lecture Notes in Statistics, Springer-Verlag: New York, 1997.
17. J. Platt, Using sparseness and analytic QP to speed training of support vector machines. In M. S. Kearns, S. A. Solla, and D. A. Cohn (Eds.), Advances in neural information processing systems 11, MA: MIT Press, 1999.
18. J.Quinlan, C4.5: Programs for machine learning. Morgan Kaufmann, San Francisco, 1993.
19. J. R. Quinlan, Bagging, boosting, and C4.5. In Proceedings of the Thirteenth National Conference on Artificial Intelligence (1996), 725-730.
20. C. Ratanamahatana and D. Gunopulos, Feature Selection for the Naive Bayesian Classifier using Decision Trees, Applied Artificial Intelligence, 17 (2003): 475-487.
21. G. Ridgeway, D. Madigan and T. Richardson,. Interpretable boosted Naive Bayes classification. In Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining, Menlo Park (1998): 101-104.
22. S. Salzberg, On Comparing Classifiers: Pitfalls to Avoid and a Recommended Approach, Data Mining and Knowledge Discovery, 1(1997): 317-328.
23. M. Singh, and G. Provan, Efficient learning of selective Bayesian network classifiers. In Proc of the 13th International Conference on Machine Learning (1996): 453-461, Bari.
24. K. Ting and Z. Zheng,. Improving the Performance of Boosting for Naive Bayesian Classification, N. Zhong and L. Zhou (Eds.): PAKDD'99, LNAI 1574, pp. 296-305, 1999.
25. Tsymbal, S. Puuronen and D. Patterson, Feature Selection for Ensembles of Simple Bayesian Classifiers, In Proceedings of ISMIS (2002): 592-600, Lyon, June 27-29.
26. Witten and E. Frank, Data Mining: Practical Machine Learning Tools and Techniques with Java Implementations. Morgan Kaufmann, San Mateo, 2000.
27. Z. Zheng, and G.I. Webb, Lazy learning of Bayesian rules. Machine Learning, 41 (2000): 53-84