Optimal bin number for equal frequency discretizations in supervized learning

Intelligent Data Analysis

Volumn 9, Issue 2, 2005, Pages 175-188

  Boulle, Marc ^a  

^a ORANGE LABS   (France)

Author keywords

bayesianism; data analysis; data mining; discretization; machine learning

Indexed keywords

BAYESIAN NETWORKS; DATA REDUCTION; DISCRETE EVENT SIMULATION; LEARNING SYSTEMS; MACHINE LEARNING; VOLUME MEASUREMENT;

BAYESIAN APPROACHES; BAYESIANISM; COMPARATIVE EXPERIMENTS; DISCRETIZATION METHOD; DISCRETIZATIONS; INDUCTION ALGORITHMS; SUPERVISED DISCRETIZATION; SUPERVIZED LEARNING;

DATA MINING;

EID: 41749102443     PISSN: 1088467X     EISSN: 15714128     Source Type: Journal    
DOI: 10.3233/ida-2005-9204     Document Type: Conference Paper

References (21)

1. H. Akaike, A new look at the statistical model identification, IEEE Transactions on Automatic Control 19 (1974), 716-723.
2. L. Birǵe and Y. Rozenholc, How many bins should be put in a regular histogram, Pŕepublication 721, Laboratoire de Probabilit́es et Mod̀eles Aĺeatoires, Universit́e Paris VI et VII, France, 2002.
3. C.L. Blake and C.J. Merz, UCI Repository of machine learning databases (www.ics.uci.edu/?mlearn/MLRepository. html), Irvine, CA: University of California, Department of Information and Computer Science, 1998.
4. M. Boulĺe, Khiops: a Discretization Method of Continuous Attributes with Guaranteed Resistance to Noise, In Proceeding of the Third International Conference on Machine Learning and Data Mining in Pattern Recognition, 2003, pp. 50-64.
5. J. Breiman, J.H. Friedman, R.A. Olshen and C.J. Stone, Classification and Regression Trees, California,: Wadsworth International, 1984.
6. J. Catlett, On Changing Continuous Attributes into ordered discrete Attributes, In Proceedings of the European Working Session on Learning, Springer-Verlag, 1991, pp. 87-102.
7. G. Castellan, Modified Akaike's criterion for histogram density estimation, Technical Report, Universit́e Paris-Sud, Orsay, 1999.
8. J. Dougherty, R. Kohavi and M. Sahami, Supervised and Unsupervised Discretization of Continuous Features, In Proceedings of the 12th International Conference on Machine Learning, San Francisco, CA: Morgan Kaufmann, 1995, pp. 194-202.
9. U. Fayyad and K. Irani, On the handling of continuous-valued attributes in decision tree generation, Machine Learning 8 (1992), 87-102.
10. R.C. Holte, Very simple classification rules perform well on most commonly used datasets, Machine Learning 11 (1993), 63-90.
11. G.V. Kass, An explanatory technique for investigating large quantities of categorical data, Applied statistics 29(2) (1980), 119-127.
12. R.Kerber, Chimerge discretization of numeric attributes, In Proceedings of the 10th International Conference on Artificial Intelligence, 1991, pp. 123-128.
13. P. Langley,W. Iba and K. Thompson, An analysis of bayesian classifiers, in Proceedings of the 10th National Conference on Artificial Intelligence, AAAI Press, 1992, pp. 223-228.
14. H. Liu, F. Hussain, C.L. Tan and M. Dash, Discretization: An Enabling Technique, Data Mining and Knowledge Discovery 6(4) (2002), 393-423.
15. J.R. Quinlan, C4.5: Programs for Machine Learning, Morgan Kaufmann, 1993.
16. J. Rissanen, Modeling by shortest data description, Automatica 14 (1978), 465-471.
17. J. Rissanen, A universal prior for integers and estimation by minimum description length, Ann. Statist. 11 (1983), 416-431.
18. D.W. Scott, Averaged shifted histograms: Effective nonparametric density estimators in several dimensions, Ann. Statist. 13 (1979), 1024-1040.
19. H.A. Sturges, The choice of a class interval, J. Am. Stat. Assoc 21 (1926), 65-66.
20. Y. Yang and G.I. Webb, A Comparative Study of Discretization Methods for Nä?ve-Bayes Classifiers, in Proceedings of PKAW 2002, The 2002 Pacific Rim Knowledge Acquisition Workshop, Tokyo, Japan, 2002, pp. 159-173.
21. D.A. Zighed and R. Rakotomalala, Graphes d'induction, HERMES Science Publications, 2000, pp. 327-359.