Abstract

Numerous associative classification algorithms have been proposed but none considers the rule dependence problem, which directly influences the classification accuracy. Since finding the optimal execution order of class association rules (CARs) is a combinatorial problem, this study proposes a polynomial-time algorithm that re-ranks the execution order of CARs by rule priority to reduce the influence of rule dependence. The classification accuracy and recall rate of the associative classification algorithm are thus improved. The experimental results show that the proposed association classifier yields better classification results than those of an association classifier that does not consider rule dependence.

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.