pith. sign in

arxiv: cs/0609007 · v1 · submitted 2006-09-03 · 💻 cs.LG

A Massive Local Rules Search Approach to the Classification Problem

classification 💻 cs.LG
keywords rulesalgorithmclassificationlocalapproachattributesglobalmassive
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.