Relationships Between Length and Coverage of Decision Rules

The paper describes a new tool for study relationships between length and coverage of exact decision rules. This tool is based on dynamic programming approach. We also present results of experiments with decision tables from UCI Machine Learning Repository.

[1]  Igor Chikalov,et al.  Relationships Between Length and Coverage of Exact Decision Rules , 2012, CS&P.

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

[3]  Ian H. Witten,et al.  The WEKA data mining software: an update , 2009, SKDD.

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

[5]  Alberto Maria Segre,et al.  Programs for Machine Learning , 1994 .

[6]  Arkadiusz Wojna,et al.  On the Evolution of Rough Set Exploration System , 2004, Rough Sets and Current Trends in Computing.

[7]  Igor Chikalov,et al.  Dynamic programming approach to optimization of approximate decision rules , 2013, Inf. Sci..

[8]  Igor Chikalov,et al.  Dynamic Programming Approach for Exact Decision Rule Optimization , 2013, Rough Sets and Intelligent Systems.

[9]  Nick Cercone,et al.  ELEM2: A Learning System for More Accurate Classifications , 1998, Canadian Conference on AI.

[10]  Beata Zielosko,et al.  Sequential optimization of γ-decision rules , 2012, 2012 Federated Conference on Computer Science and Information Systems (FedCSIS).

[11]  Mikhail Ju. Moshkov,et al.  Partial Covers, Reducts and Decision Rules in Rough Sets - Theory and Applications , 2009, Studies in Computational Intelligence.

[12]  Hussein A. Abbass,et al.  Classification rule discovery with ant colony optimization , 2003, IEEE/WIC International Conference on Intelligent Agent Technology, 2003. IAT 2003..

[13]  Peter Clark,et al.  The CN2 Induction Algorithm , 1989, Machine Learning.

[14]  Mikhail Ju. Moshkov,et al.  Combinatorial Machine Learning - A Rough Set Approach , 2011, Studies in Computational Intelligence.

[15]  Qiang Shen,et al.  Semantics-preserving dimensionality reduction: rough and fuzzy-rough-based approaches , 2004, IEEE Transactions on Knowledge and Data Engineering.

[16]  Marek Sikora,et al.  Decision Rule-Based Data Models Using TRS and NetTRS - Methods and Algorithms , 2010, Trans. Rough Sets.

[17]  J. Rissanen,et al.  Modeling By Shortest Data Description* , 1978, Autom..

[18]  Igor Chikalov,et al.  Dynamic Programming Approach for Partial Decision Rule Optimization , 2012, Fundam. Informaticae.

[19]  Igor Chikalov,et al.  On Algorithm for Constructing of Decision Trees with Minimal Depth , 2000, Fundam. Informaticae.

[20]  Dominik Slezak,et al.  Order Based Genetic Algorithms for the Search of Approximate Entropy Reducts , 2003, RSFDGrC.

[21]  Shahid Hussain,et al.  Dagger: A Tool for Analysis and Optimization of Decision Trees and Rules , 2011 .

[22]  Roman Słowiński,et al.  Sequential covering rule induction algorithm for variable consistency rough set approaches , 2011, Inf. Sci..

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

[24]  Hung Son Nguyen,et al.  Approximate Boolean Reasoning: Foundations and Applications in Data Mining , 2006, Trans. Rough Sets.

[25]  Andrzej Skowron,et al.  Rough sets and Boolean reasoning , 2007, Inf. Sci..