Knowledge discovery by inspection

Abstract Given the enormous size of many business databases, algorithms for knowledge discovery can often be applied to only a sample of the original data. Other methods used to improve efficiency include focusing on a restricted class of rules such as exact rules, or limiting the number of conditions in the discovered rules. It is shown that simple exact rules can often be discovered by visual inspection of frequency tables. An efficient algorithm for rule discovery by inspection is presented. The discovered rules include all exact rules with one or two conditions.

[1]  J. Ross Quinlan,et al.  Simplifying Decision Trees , 1987, Int. J. Man Mach. Stud..

[2]  Padhraic Smyth,et al.  Rule Induction Using Information Theory , 1991, Knowledge Discovery in Databases.

[3]  Gregory Piatetsky-Shapiro,et al.  Knowledge Discovery in Databases: An Overview , 1992, AI Mag..

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

[5]  William Frawley,et al.  Knowledge Discovery in Databases , 1991 .

[6]  Zdzislaw Pawlak,et al.  Rough classification , 1984, Int. J. Hum. Comput. Stud..

[7]  Jadzia Cendrowska,et al.  PRISM: An Algorithm for Inducing Modular Rules , 1987, Int. J. Man Mach. Stud..

[8]  Gregory Piatetsky-Shapiro,et al.  Discovery, Analysis, and Presentation of Strong Rules , 1991, Knowledge Discovery in Databases.

[9]  Wojciech Ziarko,et al.  The Discovery, Analysis, and Representation of Data Dependencies in Databases , 1991, Knowledge Discovery in Databases.