Analyzing Discretizations of Continuous Attributes Given a Monotonic Discrimination Function

This article addresses the problem of analyzing existing discretizations of continuous attributes with regard to their redundancy and minimality properties. The research was inspired by the increasing number of heuristic algorithms created for generating the discretizations using various methodologies, and apparent lack of any direct techniques for examining the solutions obtained as far as their basic properties, e.g., the redundancy, are concerned. The proposed method of analysis fills this gap by providing a test for redundancy and enabling for a controlled reduction of the discretization's size within specified limits. Rough set theory techniques are used as the basic tools in this method. Exemplary results of discretization analyses for some known real-life data sets are presented for illustration.

[1]  Michio Sugeno,et al.  A fuzzy-logic-based approach to qualitative modeling , 1993, IEEE Trans. Fuzzy Syst..

[2]  Marzena Kryszkiewicz,et al.  Finding Reducts in Composed Information Systems , 1993, RSKD.

[3]  Thomas G. Dietterich,et al.  Readings in Machine Learning , 1991 .

[4]  Andrew K. C. Wong,et al.  Synthesizing Statistical Knowledge from Incomplete Mixed-Mode Data , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Ankica Babic,et al.  Comparison of the Rough Sets Approach and Probabilistic Data Analysis Techniques on a Common Set of Medical Data , 1992, Intelligent Decision Support.

[6]  Usama M. Fayyad,et al.  Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning , 1993, IJCAI.

[7]  Maciej Modrzejewski,et al.  Feature Selection Using Rough Sets Theory , 1993, ECML.

[8]  Ryszard S. Michalski,et al.  A theory and methodology of inductive learning , 1993 .

[9]  Larry A. Rendell,et al.  A Practical Approach to Feature Selection , 1992, ML.

[10]  Lei Xu,et al.  Best first strategy for feature selection , 1988, [1988 Proceedings] 9th International Conference on Pattern Recognition.

[11]  Janusz Zalewski,et al.  Rough sets: Theoretical aspects of reasoning about data , 1996 .

[12]  Casimir A. Kulikowski,et al.  Computer Systems That Learn: Classification and Prediction Methods from Statistics, Neural Nets, Machine Learning and Expert Systems , 1990 .

[13]  Randy Kerber,et al.  ChiMerge: Discretization of Numeric Attributes , 1992, AAAI.

[14]  Tony R. Martinez,et al.  BRACE: A Paradigm For the Discretization of Continuously Valued Data , 1994 .

[15]  Marzena Kryszkiewicz,et al.  Computation of Reducts of Composed Information Systems , 1996, Fundam. Informaticae.

[16]  R. Słowiński Intelligent Decision Support: Handbook of Applications and Advances of the Rough Sets Theory , 1992 .

[17]  Tony R. Martinez,et al.  An Empirical Comparison of Discretization Methods , 1995 .

[18]  Z. Pawlak Rough Sets: Theoretical Aspects of Reasoning about Data , 1991 .

[19]  J. Ross Quinlan,et al.  Improved Use of Continuous Attributes in C4.5 , 1996, J. Artif. Intell. Res..

[20]  Bernhard Pfahringer,et al.  Compression-Based Discretization of Continuous Attributes , 1995, ICML.

[21]  Ron Kohavi,et al.  Supervised and Unsupervised Discretization of Continuous Features , 1995, ICML.

[22]  David W. Aha,et al.  Feature Selection for Case-Based Classification of Cloud Types: An Empirical Comparison , 1994 .

[23]  William W. Cohen Efficient Pruning Methods for Separate-and-Conquer Rule Learning Systems , 1993, IJCAI.

[24]  Daniel Vanderpooten,et al.  A General Two-Stage Approach to Inducing Rules from Examples , 1993, RSKD.

[25]  J. Ross Quinlan,et al.  C4.5: Programs for Machine Learning , 1992 .

[26]  Ron Kohavi,et al.  Irrelevant Features and the Subset Selection Problem , 1994, ICML.

[27]  Caroline Chan,et al.  Determination of quantization intervals in rule based model for dynamic systems , 1991, Conference Proceedings 1991 IEEE International Conference on Systems, Man, and Cybernetics.

[28]  R. Michalski,et al.  Learning from Observation: Conceptual Clustering , 1983 .

[29]  J. R. Quinlan DECISION TREES AS PROBABILISTIC CLASSIFIERS , 1987 .

[30]  Rich Caruana,et al.  Greedy Attribute Selection , 1994, ICML.

[31]  J. Rissanen A UNIVERSAL PRIOR FOR INTEGERS AND ESTIMATION BY MINIMUM DESCRIPTION LENGTH , 1983 .

[32]  Jerzy W. Grzymala-Busse,et al.  LERS-A System for Learning from Examples Based on Rough Sets , 1992, Intelligent Decision Support.

[33]  R. Słowiński,et al.  Rough sets analysis of diagnostic capacity of vibroacoustic symptoms , 1992 .

[34]  Thomas G. Dietterich,et al.  Learning with Many Irrelevant Features , 1991, AAAI.

[35]  Stanislaw Romanski,et al.  Operations on Families of Sets for Exhaustive Search, Given a Monotonic Function , 1988, JCDKB.

[36]  R. Fisher THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS , 1936 .

[37]  Hideo Tanaka,et al.  Fuzzy Inference System Based on Rough Sets and Its Application to Medical Diagnosis , 1992, Intelligent Decision Support.

[38]  Ron Kohavi,et al.  Useful Feature Subsets and Rough Set Reducts , 1994 .

[39]  Roman Slowinski,et al.  Analysis of Diagnostic Symptoms in Vibroacoustic Diagnostics by Means of the Rough Sets Theory , 1992, Intelligent Decision Support.

[40]  Chris Carter,et al.  Assessing Credit Card Applications Using Machine Learning , 1987, IEEE Expert.

[41]  John R. Anderson,et al.  MACHINE LEARNING An Artificial Intelligence Approach , 2009 .

[42]  Andrzej Skowron,et al.  The Discernibility Matrices and Functions in Information Systems , 1992, Intelligent Decision Support.

[43]  David J. Spiegelhalter,et al.  Machine Learning, Neural and Statistical Classification , 2009 .

[44]  Jerzy W. Grzymala-Busse,et al.  Global discretization of continuous attributes as preprocessing for machine learning , 1996, Int. J. Approx. Reason..

[45]  Anthony N. Mucciardi,et al.  A Comparison of Seven Techniques for Choosing Subsets of Pattern Recognition Properties , 1971, IEEE Transactions on Computers.

[46]  Catherine Blake,et al.  UCI Repository of machine learning databases , 1998 .

[47]  David W. Aha,et al.  Incremental, Instance-Based Learning of Independent and Graded Concept Descriptions , 1989, ML.

[48]  Pavel Brazdil,et al.  Proceedings of the European Conference on Machine Learning , 1993 .

[49]  David B. Skalak,et al.  Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms , 1994, ICML.

[50]  Maria E. Orlowska,et al.  Maintenance of Knowledge in Dynamic Information Systems , 1992, Intelligent Decision Support.

[51]  Thorsten Kuhlmann,et al.  Intelligent decision support , 1998 .

[52]  C. J. V. Rijsbergen,et al.  Rough Sets, Fuzzy Sets and Knowledge Discovery , 1994, Workshops in Computing.