Wrapper discretization by means of estimation of distribution algorithms

Intelligent Data Analysis

Volumn 11, Issue 5, 2007, Pages 525-545

  Flores, J L ^a   Inza, I ^a   Larranaga P ^a  

^a UNIVERSITY OF THE BASQUE COUNTRY UPV EHU   (Spain)

Author keywords

Classification; Discretization; Estimation of distribution algorithms; Evolutionary computation

Indexed keywords

EID: 41749119664     PISSN: 1088467X     EISSN: 15714128     Source Type: Journal    
DOI: 10.3233/ida-2007-11506     Document Type: Article

References (73)

1. J. Bacardit and J.M. Garrell, Evolving Multiple Discretizations with Adaptive Intervals for a Pittsburgh Rule-Based Learning Classifier System, In Proceedings of the Genetic and Evolutionary Computation Conference, volume 2724 of Lecture Notes in Computer Science, pages 1818-1831, Chicago (Illinois,USA), 2003, Springer-Verlag.
2. S.D. Bay, Multivariate Discretization of Continuous Variables for Set Mining, In Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 315-319, Boston (Massachusetts, USA), 2000. ACM Press.
3. R. Blanco, I. Inza and P. Larrañaga, Learning Bayesian networks in the space of structures by estimation of distribution algorithms, International Journal of Intelligent Systems 18(2) (2003), 205-220.
4. J.S. De Bonet, C. Isbell and P. Viola, MIMIC: Finding optima by estimating probability densities, in: Advances in Neural Information Processing, (Vol. 9), M. Mozer M. Jordan and M. Perrone, eds, Denver 1996, MIT Press, Cambridge.
5. M. Boullé, Khiops: A Discretization Method of Continuous Attributes with Guaranteed Resistance to Noise, In Proceedings of the 3rd International Conference on Machine Learning and Data Mining, Volume 2734 of Lecture Notes in Computer Science, Leipzig (Germany), 2003, Springer-Verlag, 50-64.
6. M. Boullé, Khiops: A statistical discretization method of continuous attributes, Machine Learning 55(1) (2004), 53-69.
7. M. Boullé, A Grouping Method for Categorical Attributes having Very Large Number of Values, In Proceedings of the 4th International Conference on Machine Learning and Data Mining in Pattern Recognition, Volume 3587 of Lecture Notes in Computer Science, pages 228-242, Leipzig (Germany), 2005, Springer-Verlag.
8. M. Boullé, Optimal bin number for equal frequency discretizations in supervised learning, Intelligent Data Analysis 9(2) (2005), 175-188.
9. R. Butterworth, D.A. Simovici, G.S. Santos and L. Ohno-Machado, A greedy algorithm for supervised discretization, Journal of Biomedical Informatics 37(4) (2004), 285-292.
10. E. Castillo, J.M. Gutierrez and A.S. Hadi, Expert Systems and Probabilistic Network Models, Springer-Verlag, 1996.
11. J. Catlett, On Changing Continuous Attributes into Ordered Discrete Attributes, In Proceedings of the 5th European Working Session on Learning, Vol. 482 of Lecture Notes in Computer Science, pages 164-178, Porto (Portugal), 1991, Springer-Verlag.
12. J.Y. Ching, A.C. Wong and K.C.C. Chan, Class-dependent discretization for inductive learning from continuous and mixed-mode data, IEEE Transactions on Pattern Analysis and Machine Learning 17(7) (1995), 641-651.
13. B.S. Chlebus and S.H. Nguyen, Discretization Problem for Rough Set Methods, In Proceedings of the 1st International Conference on Rough Sets and Current Trend in Computing, Volume 1424 of Lecture Notes in Computer Science, pages 545-552, Warsaw (Poland), 1998, Springer-Verlag.
14. E. Consortium, Elvira: An Environment for Creating and using Probabilistic Graphical Models, In Proceedings of the 1st European Workshop on Probabilistic Graphical Models, Cuenca (Spain), 2002.
15. J. Demsar, Statistical comparisons of classifiers over multiple data sets, Journal of Machine Learning Research 7 (2006), 1-30.
16. P. Domingos and M. Pazzani, On the optimality of the simple Bayesian classifier under zero-one loss, Machine Learning 29(2-3) (1997), 103-130.
17. J. Dougherty, R. Kohavi and M. Sahami, Supervised and Unsupervised Discretization of Continuous Features, In Proceedings of the 12th International Conference on Machine Learning, Lecture Notes in Artificial Intelligence, pages 194-202, San Francisco (CA, USA), 1995.
18. R.O. Duda and P.E. Hart, Pattern Classification and Scene Analysis, John Wiley and Sons, 1973.
19. R. Etxeberria and P. Larrañaga, Global Optimization using Bayesian Networks, In Proceedings of the 2nd Symposium on Articial Intelligence Adaptive Systems, Volume 9, pages 332-339, La Habana (Cuba), 1999.
20. U.M. Fayyad and K.B. Irani, On the handling of continuous-valued attributes in decision tree generation, Machine Learning 8(1) (1992), 87-102.
21. U.M. Fayyad and K.B. Irani, Multi-Interval Discretization of Continuousvalued Attributes for Classification Learning, In Proceedings of the 13th International Joint Conference on Artificial Intelligence, pages 1022-1027, Chambery (France), 1993. Morgan Kaufmann.
22. S. Ferrandiz and M. Boullé, Multivariate Discretization by Recursive Supervised Bipartition of Graph, In Machine Learning and Data Mining, Volume 3587 of Lecture Notes in Artificial Intelligence, pages 253-264, Leipzig (Germany), 2005, Springer-Verlag.
23. S. Ferrandiz and M. Boullé, Supervised Evaluation of Dataset Partitions: Advantages and Practice, In Machine Learning and Data Mining, Volume 3587 of Lecture Notes in Artificial Intelligence, pages 600-609, Leipzig (Germany), 2005, Springer-Verlag.
24. J. Gama, Dynamic Discretization of Continuous Attributes, In Proceedings of the 6th Iberoamerican Conference on Artificial Intelligence, Lecture Notes in Artificial Intelligence, pages 160-169, Lisbon (Portugal), 1998.
25. P. Geurts and L. Wehenkel, Investigation and Reduction of Discretization Variance in Decision tree Induction, In Proceedings of the 11th European Conference on Machine Learning, Volume 1810 of Lecture Notes in Computer Science, pages 162-170, Cataluña (Spain), 2000, Springer-Verlag.
26. R. Giráldez, J.S. Aguilar-Ruiz and J.C. Riquelme Santos, Natural Coding: A More Efficient Representation for Evolutionary Learning, In Proceedings of the Genetic and Evolutionary Computation Conference, Vol. 2723 of Lecture Notes in Computer Science, pages 979-990, Chicago (Illinois.USA), 2003, Springer-Verlag.
27. C. González, J.A. Lozano and P. Larrañaga. Mathematical modeling of UMDA algorithm with tournament selection, International Journal of Approximate Reasoning (31) (2002), 313-340.
28. K. Grabczewski, SSV Criterion Based Discretization for Naive Bayes Classifiers, In Proceedings of the International Conference on Artificial Intelligence and Soft Computing, Volume 3070 of Lecture Notes in Computer Science, pages 574-579, Zakopane (Poland), 2004, Springer-Verlag.
29. R.C. Holte, Very simple classification rules perform well on most commonly used datasets, Machine Learning 11(1) (1993), 63-91.
30. 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 Journal 53(3) (2002).
31. H. Huang and C. Hsu, Bayesian Classification for Set and Interval Data, In Proceedings 2000 International Computer Symposium, ChiaYi (Taiwan), 2000.
32. I. Inza, M. Merino, P. Larrañaga, J. Quiroga, B. Sierra and M. Girala, Feature subset selection by genetic algorithms and estimation of distribution algorithms. A case study in the survival of cirrhotic patients treated with TIPS, Artificial Intelligence in Medicine 23(2) (2001), 187-205.
33. R. Kerber, Chimerge: Discretization of Numeric Attributes, In Proceedings of the 10th National Conference on Artificial Intelligence, pages 123-128, San Jose (California.USA), 1992.
34. P. Knotkanen, P. Myllymaki and H. Tirri, A Bayesian Approach to Discretization, In Proceedings of the European Symposium on Intelligent Techniques, pages 265-268, Bari (Italy), 1997.
35. R. Kohavi and M. Sahami, Error-Based and Entropy-Based Discretization of Continuous Features, In Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining, pages 114-119, Portland (Oregon,USA), 1996.
36. R. Kohavi and D.H. Wolpert, Bias Plus Variance Decomposition for Zeroone Loss Functions, In Lorenza Saitta, editor, Proceedings of the 13th International Conference on Machine Learning, pages 275-283. Morgan Kaufmann, 1996.
37. A.V. Kozlov and D. Koller, Nonuniform Dynamic Discretization in Hybrid Networks, In Proceedings of the 13th Conference on Uncertainy in Artificial Intelligence, pages 314-325, Providence (Rhode Island, USA), 1997.
38. L. Kurgan, Discretization algorithm that uses class attribute interdependence maximization, IEEE Transactions on Knowledge and Data Engineering 16(2) (February 2004), 145-163.
39. W. Kwedlo and M. Kretowski, An Evolutionary Algorithm using Multivariate Discretization for Decision Rule Induction, In Proceedings of the Third European Conference on Principles of Data Mining and Knowledge Discovery, Volume 1704 of Lecture Notes in Artificial Intelligence, pages 392-397, Prague (Czech Republic), 1999, Springer-Verlag.
40. P. Langley, W. Iba and K. Thompson, An analysis of Bayesian Classifiers, In Proceedings of the 10th International Conference on Artificial Intelligence, pages 223-228, 1992.
41. P. Larrañaga, R. Etxeberria, J.A. Lozano and J.M. Peña, Combinatorial optimization by learning and simulation of Bayesian networks. In Proceedings of the 16th Annual Conference on Uncertainty in Artificial Intelligence (UAI-00), pages 343-352, San Francisco (USA), 2000. Morgan Kaufmann.
42. P. Larrañaga, R. Etxeberria, J.A. Lozano and J.M. Peña, Optimization in Continuous Domains by Learning and Simulation of Gaussian Networks, In Proceedings of the 2000 Genetic and Evolutionary Computation Conference Workshop Program, pages 201-204, 2000.
43. P. Larrañaga and J.A. Lozano, Estimation of Distribution Algorithms, A New Tool for Evolutionary Computation. Kluwer Academic Publisher, 2002.
44. P. Larrañaga, J.A. Lozano and J.M. Peña, Optimization by Learning and Simulation of Bayesian and Gaussian Networks, Technical Report Technical Report KZZA-IK-4-99, Department of Computer Science and Artificial Intelligence, University of the Basque Country, 1999.
45. L. Liu, A.K.C. Wong and Y. Wang, A global optimal algorithm for class-dependent discretization of continuous data, Intelligent Data Analysis 8(2) (2004), 151-170.
46. H. Mühlenbein and T. Mahnig, FDA - a scalable evolutionary algorithm for the optimization of additively decomposed functions, Evolutionary Computation 7(4) (1999), 353-376.
47. H. Mühlenbein, The equation for the response to selection and its use for prediction, Evolutionary Computation 5(3) (1998), 303-346.
48. H. Mühlenbein and G. Paass, From Recombination of Genes to the Estimation of Distributions I. Binary Parameters, In Proceedings of the 4th International Conference on Parallel Problem Solving, Volume 1141 of Nature Lecture Notes in Computer Science, pages 178-187, Berlin (Germany), 1996.
49. M. Minsky, Steps toward artificial intelligence, Transactions on Institute of Radio Engineers 49 (1961), 8-30.
50. M.J. Pazzani, Beyond Independence: Conditions for the Optimality of the Simple Bayesian Classifier, In Proceedings of the 13th International Conference on Machine Learning, Volume 29, pages 105-112, Bari (Italy), 1996.
51. M. Pelikan and D.E. Goldberg, Genetic Algorithms, Clustering, and the Breaking of Symmetry, In Proceedings of the 6th International Conference on Parallel Problem Solving from Nature, Volume 1917 of Lecture Notes In Computer Science, pages 385-394, London (UK), 2000, Springer-Verlag.
52. M. Pelikan and D.E. Goldberg, Hierarchical Problem Solving by the Bayesian Optimization Algorithm, In Proceedings of the Genetic and Evolutionary Computation Conference, Lecture Notes in Computer Science, pages 267-274, Las Vegas, Nevada (USA), 2000. Morgan Kauffman.
53. M. Pelikan and D.E. Goldberg, Research on the Bayesian Optimization Algorithm, In Proceedings of the Genetic and Evolutionary Computation Conference, Volume 1 of Lecture Notes in Computer Science, pages 212-215. Morgan Kauffman, 2000.
54. M. Pelikan, D.E. Goldberg and F.G. Lobo, A survey of optimization by building and using probabilistic models, Computational Optimization and Applications 21(1) (January 2002), 5-20.
55. B. Pfahringer, Compression-Based Discretization of Continuous Attributes, In International Conference on Machine Learning, pages 456C 463, Tahoe City (California, USA), 1995.
56. J.R. Quinlan, Induction of decision trees, Machine Learning 1(1) (1986), 81-106.
57. K. Revoredo and G. Zaverucha, Search-Based Class Discretization for Hidden Markov Model for Regression, In Proceedings of the Brazilian Symposium on Artificial Intelligence, Volume 3171 of Lecture Notes in Computer Science, pages 317-325, São Luis (Maranhão, Brazil), 2004.
58. H. Scheffe, The Analysis of Variance, John Wiley, 1959.
59. M. Sebag and A. Ducoulombier, Extending Population-Based Incremental Learning to Continuous Search Spaces, In Proceedings of the 5th International Conference on Parallel Problem Solving from Nature, Volume 1498 of Lecture Notes in Computer Science, pages 418-427, London (UK), 1998, Springer-Verlag.
60. R. Setiono and H. Liu, Chi2: Feature Selection and Discretization of Numeric Attributes, In Proceedings of the 7th International Conference on Tool with Artificial Intelligence, pages 388C391, Whashington DC (USA), 1995.
61. R. Shachter and C.R. Kenley, Gaussian in uence diagrams, Management Science 5(35) (1989), 527-550.
62. L. Torgo and J. Gama, Search-Based Class Discretization, In European Conference on Machine Learning, Volume 1224 of Lecture Notes in Computer Science, pages 266-273, Prague (Czech Republic), 1997, Springer-Verlag.
63. J.J. Valdes, L.C. Molina and N. Peris, An Evolution Strategies Approach to the Simultaneous Discretization of Numeric Attributes in Data Mining, In Proceedings of the World Congress on Evolutionary Computation, pages 1957-1964, Canberra (Australia), 2003.
64. J.J. Valdes, L.C. Molina and N. Peris, An Evolution Strategies Approach to the Simultaneous Discretization of Numeric Attributes in Data Mining, In Proceedings of the Congress on Evolutionary Computation, 2003.
65. M. Wang and S. Geisser, Optimal dichotomization of screening test variables, Journal of Statistical Planning and Inference 131(1) (2005), 191-206.
66. I.H. Witten and E. Frank, Data Mining: Practical Machine Learning Tools and Techniques, (Second Edition), Morgan Kauffman, 2005.
67. Q. Wu, G. Prasad, T.M. McGinnity, D. Bell, S. Zhong and J. Guan, A Novel Discretizer for Knowledge Discovery Based on Multiknowledge Approaches, In Proceedings of the International Conference on Intelligent Computing, Volume 344 of Lecture Notes in Computer Science, pages 778-783. Morgan Kauffman, August 2006.
68. Y. Yang, Discretization for Naive-Bayes Learning, Master's thesis, Monash University, 2003.
69. Y. Yang and G.I. Webb, Discretization for naive-Bayes learning: managing discretization bias and variance, Technical report, School of Computer Science and Software Engineering Monash University, Melbourne, VIC 3800, Australia, 2003.
70. Y. Yang and G.I. Webb, On Why Discretization Works for Naive-Bayes Classifiers, In Australian Conference on Artificial Intelligence 2003, Volume 2903 of Lecture Notes in Computer Science, pages 440-452, Perth (Australia), 2003, Springer-Verlag.
71. Q. Zhang, On stability of fixed points of limit models of univariate marginal distribution algorithm and factorized distribution algorithm, IEEE Transactions on Evolutionary Computation 8(1) (February 2004), 80-93.
72. Q. Zhang, On the convergence of a class of estimation of distribution algorithms, IEEE Transactions on Evolutionary Computation 8(2) (April 2004), 127-136.
73. A.A. Zhigljavsky, Theory of Global Random Search, Kluwer Academic Publisher, 1991.