The quickhull algorithm for convex hulls
ACM Transactions on Mathematical Software (TOMS)
From data mining to knowledge discovery: an overview
Advances in knowledge discovery and data mining
Separate-and-Conquer Rule Learning
Artificial Intelligence Review
Communications of the ACM
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Machine Learning and Data Mining; Methods and Applications
Machine Learning and Data Mining; Methods and Applications
Data-Driven Constructive Induction
IEEE Intelligent Systems
Machine Learning
Classification Algorithms Based on Linear Combinations of Features
PKDD '99 Proceedings of the Third European Conference on Principles of Data Mining and Knowledge Discovery
Taming Large Rule Models in Rough Set Approaches
PKDD '99 Proceedings of the Third European Conference on Principles of Data Mining and Knowledge Discovery
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Text Classification Using Lattice Machine
ISMIS '99 Proceedings of the 11th International Symposium on Foundations of Intelligent Systems
A New Version of Rough Set Exploration System
TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
Reducing Number of Decision Rules by Joining
TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
Data mining based on rough sets
Data mining
A complete fuzzy decision tree technique
Fuzzy Sets and Systems - Theme: Learning and modeling
Subgroup Discovery with CN2-SD
The Journal of Machine Learning Research
Data Mining: Practical Machine Learning Tools and Techniques, Second Edition (Morgan Kaufmann Series in Data Management Systems)
The lack of a priori distinctions between learning algorithms
Neural Computation
Further experimental evidence against the utility of Occam's razor
Journal of Artificial Intelligence Research
A system for induction of oblique decision trees
Journal of Artificial Intelligence Research
On the quest for optimal rule learning heuristics
Machine Learning
ENDER: a statistical framework for boosting decision rules
Data Mining and Knowledge Discovery
Induction and pruning of classification rules for prediction of microseismic hazards in coal mines
Expert Systems with Applications: An International Journal
Data-driven adaptive selection of rules quality measures for improving the rules induction algorithm
RSFDGrC'11 Proceedings of the 13th international conference on Rough sets, fuzzy sets, data mining and granular computing
Decision rule-based data models using TRS and NetTRS – methods and algorithms
Transactions on Rough Sets XI
Rule quality measures in creation and reduction of data rule models
RSCTC'06 Proceedings of the 5th international conference on Rough Sets and Current Trends in Computing
A hierarchical approach to multimodal classification
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part II
Inducing oblique decision trees with evolutionary algorithms
IEEE Transactions on Evolutionary Computation
Hyperplane Aggregation of Dominance Decision Rules
Fundamenta Informaticae - International Conference on Soft Computing and Distributed Processing (SCDP'2002)
RIONA: A New Classification System Combining Rule Induction and Instance-Based Learning
Fundamenta Informaticae
| Hi-index | 0.00 |
In the paper we present CHIRA, an algorithm performing decision rules aggregation. New elementary conditions, which are linear combinations of attributes may appear in rule premises during the aggregation, leading to so-called oblique rules. The algorithm merges rules iteratively, in pairs, according to a certain order specified in advance. It applies the procedure of determining convex hulls for regions in a feature space which are covered by aggregated rules. CHIRA can be treated as the generalization of rule shortening and joining algorithms which, unlike them, allows a rule representation language to be changed. Application of presented algorithm allows one to decrease a number of rules, especially in the case of data in which decision classes are separated by hyperplanes not perpendicular to the attribute axes. Efficiency of CHIRA has been verified on rules obtained by two known rule induction algorithms, RIPPER and q-ModLEM, run on 18 benchmark data sets. Additionally, the algorithm has been applied on synthetic data as well as on a real-life set concerning classification of natural hazards in hard-coal mines.