Abstract

Associative classification is a promising approach in data mining, which integrates association rule discovery and classification. In this paper, we present a novel associative classification technique called Ranked Multilabel Rule (RMR) that derives rules with multiple class labels. Rules derived by current associative classification algorithms overlap in their training data records, resulting in many redundant and useless rules. However, RMR removes the overlapping between rules using a pruning heuristic and ensures that rules in the final classifier do not share training records, resulting in more accurate classifiers. Experimental results obtained on twenty data sets show that the classifiers produced by RMR are highly competitive if compared with those generated by decision trees and other popular associative techniques such as CBA, with respect to prediction accuracy.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.