Integrating Association Rules with Decision Trees in Object-Relational Databases
Maruthi Rohit Ayyagari

TL;DR
This paper enhances associative classification by integrating CBA with Oracle database models, improving accuracy and flexibility in enterprise analytics systems.
Contribution
It implements CBA within Oracle databases using two variants, integrating Apriori and Decision Tree models, which improves performance and flexibility.
Findings
Proposed models outperform original CBA by 1% accuracy.
Models are competitive with Naive Bayes, SVM, and Random Forests.
Integration within Oracle enhances enterprise analytics capabilities.
Abstract
Research has provided evidence that associative classification produces more accurate results compared to other classification models. The Classification Based on Association (CBA) is one of the famous Associative Classification algorithms that generates accurate classifiers. However, current association classification algorithms reside external to databases, which reduces the flexibility of enterprise analytics systems. This paper implements the CBA in Oracle database using two variant models: hardcoding the CBA in Oracle Data Mining (ODM) package and Integrating Oracle Apriori model with the Oracle Decision tree model. We compared the proposed model performance with Naive Bayes, Support Vector Machine, Random Forests, and Decision Tree over 18 datasets from UCI. Results showed that our models outperformed the original CBA model with 1 percent and is competitive to chosen…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
