论文信息 - Extracting complete and consistent knowledge patterns from data

Extracting complete and consistent knowledge patterns from data

In this paper, it is shown how extracted patterns from data can be verified using decision tables (DTs). It is demonstrated how a complete and consistent decision table can be automatically modelled even if the extracted patterns contain anomalies. The proposed method is empirically validated on several benchmarking datasets. In addition to modelling a DT that is free of anomalies, it is shown that the DTs are sufficiently small such that the DTs can be consulted easily

[1] Geert Wets,et al. Extending a tabular knowledge-based framework with feature selection , 1997 .

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

[3] Padhraic Smyth,et al. From Data Mining to Knowledge Discovery: An Overview , 1996, Advances in Knowledge Discovery and Data Mining.

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

[5] John H. Holland,et al. Induction: Processes of Inference, Learning, and Discovery , 1987, IEEE Expert.

[6] Geert Wets,et al. From Decision Tables to Expert System Shells , 1994, Data Knowl. Eng..

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

[8] Nada Lavrac,et al. The Multi-Purpose Incremental Learning System AQ15 and Its Testing Application to Three Medical Domains , 1986, AAAI.

[9] Ronald L. Rivest,et al. Learning decision lists , 2004, Machine Learning.

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

[11] Ron Kohavi,et al. The Power of Decision Tables , 1995, ECML.