A Massive Local Rules Search Approach to the Classification Problem
<|reference_start|>A Massive Local Rules Search Approach to the Classification Problem: An approach to the classification problem of machine learning, based on building local classification rules, is developed. The local rules are considered as projections of the global classification rules to the event we want to classify. A massive global optimization algorithm is used for optimization of quality criterion. The algorithm, which has polynomial complexity in typical case, is used to find all high--quality local rules. The other distinctive feature of the algorithm is the integration of attributes levels selection (for ordered attributes) with rules searching and original conflicting rules resolution strategy. The algorithm is practical; it was tested on a number of data sets from UCI repository, and a comparison with the other predicting techniques is presented.<|reference_end|>
@article{malyshkin2006a,
    title={A Massive Local Rules Search Approach to the Classification Problem},
    author={Vladislav Malyshkin, Ray Bakhramov, Andrey Gorodetsky},
    journal={arXiv preprint arXiv:cs/0609007},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0609007},
    primaryClass={cs.LG}
}