Implications of the Dirichlet Assumption for Discretization of Continuous Variables in Naive Bayesian Classifiers

Machine Learning

Volumn 53, Issue 3, 2003, Pages 235-263

  Hsu, Chun Nan ^a   Huang, Hung Ju ^b   Wong, Tzu Tsung ^c  

^a INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

^b NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^c NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

Author keywords

Continuous variables; Dirichlel distributions; Discretization; Interval data; Lazy discretization; Naive Bayesian classifiers; Perfect aggregation

Indexed keywords

ALGORITHMS; DATA REDUCTION; MATHEMATICAL MODELS; PARAMETER ESTIMATION;

BAYESIAN CLASSIFIERS; DIRICHLET DISTRIBUTIONS;

LEARNING SYSTEMS;

EID: 0345306663     PISSN: 08856125     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1026367023636     Document Type: Article

References (19)

1. Almond, R. (1995). Graphical Belief Modelling, New York: Chapman and Hall.
2. Azaiez, M. N. (1993). Perfect aggregation in reliability models with Babyesian updating. Ph.D. thesis. Department of Industrial Engineering, University of Wisconsin-Madison, Madison, Wisconsin.
3. Blake, C., & Merz, C. (1998). UCI repository of machine learning databases.
4. Cestnik, B., & Bratko, 1. (1991). On estimating probabilities in tree pruning. In Machine Learning - EWSL-91, European Working Session on Learning (pp. 138-150). Berlin, Germany: Springer-Verlag.
5. Domingos, P., & Pazzani, M. (1997). On the optimality of the simple Bayesian classifier under zero-one loss. Machine Learning, 29, 103-130.
6. Dougherty, J., Kohavi, R., and Sahami, M. (1995). Supervised and unsupervised discretization of continuous features. In Machine Learning: Proceedings of the 12th International Conference (ML '95). San Francisco, CA: Morgan Kaufmann.
7. Duda, R. O., & Hart, P. E. (1973). Pattern Classification and Scene Analysis. New York: Wiley and Sons.
8. Fayyad, U. M., & Irani, K. B. (1993). Multi-interval discretization of continuous valued attributes for classification learning. In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI '93) (pp. 1022-1027).
9. Heckerman, D. (1998). A tutorial on learning with Bayesian networks. In M. I. Jordan (ed.), Learning in Graphical Models (pp. 301-354). Boston: Kluwer Academic Publishers.
10. Holte, R. C. (1993). Very simple classification rules perform well on most commonly used datasets. Machine Learning, 11, 63-90.
11. Iwasa, Y., Levin, S., & Andreasen, V. (1987). Aggregation in model ecosystem: Perfect aggregation. Ecological Modeling, 37, 287-302.
12. John, G., & Langley, P. (1995). Estimating continuous distributions in Bayesian classifiers. In Proceedings of the Eleventh Annual Conference on Uncertainty in Artificial Intelligence (UAI '95) (pp. 338-345).
13. Kohavi, R., & Sahami, M. (1996). Error-based and entropy-based discretization of continuous features. In Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD '96) (pp. 114-119). Portland. OR.
14. Langley and Thompson. (1992). An analysis of Bayesian classifier. In Proceedings of the 10th National Conference on Artificial Intelligence (pp. 223-228). Portland, OR: AAAI Press.
15. McClave, J. T., & Dietrich, F. H. (1991). Statistics. San Francisco: Dellen Publishing Company.
16. Monti, S., & Cooper, G. F. (1999). A bayesian network classifier that combines a finite mixture model and a naive bayes model. In The fifteenth Conference on Uncertainty in Artificial Intelligence (UAI '99) (pp. 447-456).
17. Spector, P. (1990). An Introduction to S and S-PLUS. Duxbury Press.
18. Wilks, S. S. (1962). Mathematical Statistics. New York: Wiley and Sons.
19. Wong, T.-T. (1998). Perfect aggregation in dependent Bernoulli systems with Bayesian updating. Ph.D. thesis, Department of Industrial Engineering, University of Wisconsin-Madison, Madison, Wisconsin.