Entropy and MDL discretization of continuous variables for Bayesian belief networks

International Journal of Intelligent Systems

Volumn 15, Issue 1, 2000, Pages 61-92

  Clarke, Ellis J ^a   Barton, Bruce A ^a  

^a MARYLAND MEDICAL RESEARCH INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; EPIDEMIOLOGY;

BAYESIAN BELIEF NETWORKS (BBN); DISCRETIZATION; MINIMUM DESCRIPTIVE LENGTH (MDL) METRICS; PARTITIONING ALGORITHMS;

DATA REDUCTION;

EID: 0033881469     PISSN: 08848173     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-111X(200001)15:1<61::AID-INT4>3.0.CO;2-O     Document Type: Article

References (23)

1. Pearl J, Verma T. The logic of representing dependencies by directed graphs. Proc American Association for Artificial Intelligence. 1987; p 374-379.
2. Pearl J. Probabilistic reasoning in intelligent systems: Networks of plausible inference, San Mateo, CA: Morgan Kaufmann; 1988.
3. National Heart, Lung, and Blood Institute Growth and Health Study Research Group, Obesity and cardiovascular disease risk factors in black and white girls: The NHLBI growth and health study. Amer J Public Health 1992;82:1613-1620.
4. Cooper G, Herskovits E. A Bayesian method for the induction of probabilistic networks from data. Machine Learning 1992;9:309-347.
5. Dietary Intervention Study in Children Collborative Research Group, Dietary intervention study in children (DISC) with elevated low-density-lipoprotein cholesterol: Design and baseline characteristics. Ann Epidemiology 1993;3(4):393-402.
6. Fayyad U, Irani K. Multi-interval discretization of continuous-valued attributes for classification learning. Proc 13th International Joint Conference on Artificial Intelligence. Vol. 2, San Mateo, CA: Morgan Kaufmann; 1993. p 1022-1027.
7. Pfahringer B. Compression-based discretization of continuous variables. Proc 12th International Conference on Machine Learning. Prieditis A, Russell S, editors. San Francisco, CA: Morgan Kaufmann; 1995. p 456-463.
8. Liu H, Setiono R. Chi2: Feature selection and discretization of numeric attributes. IEEE International Conference on Tools with Artificial Intelligence. (http://www. iscs.nus.sg/~liuh/tai95.ps); 1995.
9. Dougherty J, Kohavi R, Sahami M. Supervised and unsupervised discretization of continuous features. Proc 12th International Conference on Machine Learning. Prieditis A, Russel S, editors. San Francisco, CA: Morgan Kaufmann; 1995. p 194-202.
10. Hong S. Use of contextual information for feature ranking and discretization. IEEE Trans Knowledge Data Eng 1997;9(5):718-730.
11. Pazzani M. An iterative improvement approach for the discretization of numeric attributes in Bayesian classifiers. Proc 1st International Conference on Knowledge Discovery and Data Mining. Fayyad U, Uthurusamy R, editors. Menlo Park, CA: AAAI Press; 1995. p 228-233.
12. Friedman N, Goldszmidt M. Discretizing continuous attributes while learning Bayesian networks. Proc 13th International Conference on Machine Learning. Saitta L, editor. San Francisco, CA: Morgan Kaufmann; 1996. p 157-165.
13. Subramonian R, Venkata R, Chen J. A visual interactive framework for attribute discretization. Proc 3rd International Conference on Knowledge Discovery and Data Mining. Heckerman D, Mannila H, Pregibon D, editors. Menlo Park, CA: AAAI Press; 1997. p 82-88.
14. Heckerman D, Geiger D. Learning Bayesian networks: A unification for discrete and Gaussian domains. Proc 11th Conference in Uncertainty in Artificial Intelligence. Besnard P, Hanks S, editors. San Francisco, CA: Morgan Kaufmann, 1995. p 274-284.
15. Spirtes P, Meek C. Learning Bayesian networks with discrete variables from data. Proc 1st International Conference on Knowledge Discovery and Data Mining. Fayyad U, Uthurusamy R, editors. Menlo Park, CA: AAAI Press; 1995. p 294-299.
16. Lam W, Bacchus F. Learning Bayesian belief networks: An approach based on the MDL principle. Comput Intell 1994;10(3):269-293.
17. Bouckaert R. Properties of Bayesian belief network learning algorithms. Proc 10th Conference in Uncertainty in Artificial Intelligence. deMantaras R, Poole D, editors. San Francisco, CA: Morgan Kaufmann; 1994. p 102-109.
18. Clarke E, Barton B. A SAS macro for exploratory analysis using a Bayesian belief network. Contr Clinical Trials 1996;17:2S, 110S.
19. Rissanen J. Stochastic complexity and modeling. Ann Statist 1986;14(3):1080-1100.
20. Rissanen J. Stochastic complexity. J Roy Statist Soc B 1987;49(3):223-239; 252-265.
21. Cover T, Thomas J. Elements of information theory. New York: John Wiley & Sons; 1991.
22. Chow C, Liu C. Approximating discrete probability distributions with dependence trees. IEEE Trans Inform Theory 1968;14(3):462-467.
23. Bouckaert R. Probabilistic network construction using the minimum description length principle. Proc European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty. Clarke M, Kruse R, Moral S, editors. New York: Springer-Verlag; 1993. p 41-48.