Abstract
AbstractMany studies in data mining have proposed a new classification approach called associative classification. According to several reports associative classification achieves higher classification accuracy than do traditional classification approaches. However, the associative classification suffers from a major drawback: it is based on the use of a very large number of classification rules; and consequently takes efforts to select the best ones in order to construct the classifier. To overcome such drawback, we propose a new associative classification method called Garc that exploits a generic basis of association rules in order to reduce the number of association rules without jeopardizing the classification accuracy. Moreover, Garc proposes a new selection criterion called score, allowing to ameliorate the selection of the best rules during classification. Carried out experiments on 12 benchmark data sets indicate that Garc is highly competitive in terms of accuracy in comparison with popular associative classification methods.KeywordsAssociative ClassificationGeneric BasisClassification RulesGeneric association rulesClassifier
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.