Computer Science – Learning
Scientific paper
2006-09-03
Computer Science
Learning
24 pages
Scientific paper
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.
Bakhramov Ray
Gorodetsky Andrey
Malyshkin Vladislav
No associations
LandOfFree
A Massive Local Rules Search Approach to the Classification Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Massive Local Rules Search Approach to the Classification Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Massive Local Rules Search Approach to the Classification Problem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-727022