A Bayes optimal approach for partitioning the values of categorical attributes

Journal of Machine Learning Research

Volumn 6, Issue , 2005, Pages

  Boullé, Marc ^a  

^a ORANGE LABS   (France)

Author keywords

Bayesianism; Classification; Data preparation; Grouping; Model selection; Na ve Bayes

Indexed keywords

CLASSIFICATION (OF INFORMATION); COMPUTATION THEORY; COMPUTATIONAL METHODS; DATA PROCESSING; HEURISTIC METHODS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION;

BAYESIANISM; CLASSIFICATION; DATA PREPARATION; GROUPING; MODEL SELECTION; NAI°VE BAYES;

LEARNING SYSTEMS;

EID: 24944448580     PISSN: 15337928     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (30)

1. M. Asseraf. Metric on decision trees and optimal partition problem. International Conference on Human System Learning, Proceedings of CAPS'3, Paris, 2000.
2. N. C. Berckman. Value grouping for binary decision trees. Technical Report, Computer Science Department - University of Massachusetts, 1995.
3. J. M. Bernardo and A. F. M. Smith. Bayesian Theory. Wiley, New York, 1994.
4. C. L. Blake and C. J. Merz. UCI Repository of machine learning databases Web URL http://www.ics.uci.edu/~mlearn/MLRepositoty.html. Irvine, CA: University of California, Department of Information and Computer Science, 1998.
5. M. Boullé. Khiops: a Statistical Discretization Method of Continuous Attributes. Machine Learning, 55(1):53-69, 2004a.
6. M. Boullé. A robust method for partitioning the values of categorical attributes. Revue des Nouvelles Technologies de l'Information, Extraction et gestion des connaissances (EGC'2004), RNTI-E-2, volume II: 173-182, 2004b.
7. M. Boullé. A Bayesian Approach for Supervised Discretization. Data Mining V, Eds Zanasi, Ebecken, Brebbia, WIT Press, pp 199-208, 2004c.
8. L. Breiman, J. H. Friedman, R. A. Olshen and C. J. Stone. Classification and Regression Trees. California: Wadsworth International, 1984.
9. B. Cestnik, I. Kononenko and I. Bratko. ASSISTANT 86: A knowledge-elicitation tool for sophisticated users. In Bratko and Lavrac (Eds.), Progress in Machine Learning. Wilmslow, UK: Sigma Press, 1987.
10. P. A. Chou. Optimal Partitioning for Classification and Regression Trees. IEEE Transactions on Pattern Analysis and Machine Intelligence, 13(4):340-354, 1991.
11. T. G. Dietterich. Approximate Statistical Tests for Comparing Supervised Classification Methods. Neural Computation, 10(7), 1998.
12. J. Dougherty, R. Kohavi and M. Sahami. Supervised and Unsupervised Discretization of Continuous Features. Proceedings of the Twelf International Conference on Machine Learning. Los Altos, CA: Morgan Kaufmann, pp 194-202, 1995.
13. T. Fulton, S. Kasif and S. Salzberg. Efficient algorithms for finding multi-way splits for decision trees. In Proc. Thirteenth International Joint Conference on Artificial Intelligence, San Francisco, CA: Morgan Kaufmann, pp 244-255, 1995.
14. D. J. Hand and K. Yu. Idiot Bayes? not so stupid after all? International Statistical Review, 69:385-398, 2001.
15. C. N. Hsu, H. J. Huang and T. T Wong. Implications of the Dirichlet Assumption for Discretization of Continuous Variables in Naive Bayesian Classifiers. Machine Learning, 53(3):235-263, 2003.
16. G. V. Kass. An exploratory technique for investigating large quantities of categorical data. Applied Statistics, 29(2):119-127, 1980.
17. R. Kass and A. Raftery. Bayes factors. In Journal of the American Statistical Association, 90: 773-795, 1995.
18. th International Conference on Artificial Intelligence, pp 123-128, 1991.
19. S. Kullback. Information Theory and Statistics. New York: Wiley, (1959); republished by Dover, 1968.
20. P. Langley, W. Iba and K. Thompson. An analysis of Bayesian classifiers. In Proceedings of the 10th national conference on Artificial Intelligence, AAAI Press, pp 223-228, 1992.
21. Y. Lechevallier. Recherche d'une partition optimale sous contrainte d'ordre total. Technical report N°1247. INRIA, 1990.
22. D. Pyle. Data Preparation for Data Mining. Morgan Kaufmann, 1999.
23. J. R. Quinlan. Induction of decision trees. Machine Learning, 1:81-106, 1986.
24. J. R. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann, 1993.
25. G. Ritschard, D. A. Zighed and N. Nicoloyannis. Maximisation de l'association par regroupement de lignes ou de colonnes d'un tableau croisé. Mathématiques et Sciences Humaines, no 154-155:81-98, 2001.
26. G. Ritschard. Partition BIC optimale de l'espace des prédicteurs. Revue des Nouvelles Technologies de l'Information, 1:99-110, 2003.
27. G. Schwarz. Estimating the dimension of a model. The Annals of Statistics, 6:461-464, 1978.
28. SPSS Inc. AnswerTree 3.0 User's Guide. Chicago: SPSS Inc, 2001.
29. Y. Yang and G. Webb. On why discretization works for naïve-Bayes classifiers. Proceedings of the 16th Australian Joint Conference on Artificial Intelligence (AI), 2003.
30. D. A. Zighed and R. Rakotomalala. Graphes d'induction. Hermes Science Publications, pp 327-359, 2000.