An Adaptive Framework for Confidence-constraint Rule Set Learning Algorithm in Large Dataset

8Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Decision rules have been successfully used in various classification applications because of their interpretability and efficiency. In many real-world scenarios, especially in industrial applications, it is necessary to generate rule sets under certain constraints, such as confidence constraints. However, most previous rule mining methods only emphasize the accuracy of the rule set but take no consideration of these constraints. In this paper, we propose a Confidence-constraint Rule Set Learning (CRSL) framework consisting of three main components, i.e. rule miner, rule ranker, and rule subset selector. Our method not only considers the trade-off between confidence and coverage of the rule set but also considers the trade-off between interpretability and performance. Experiments on benchmark data and large-scale industrial data demonstrate that the proposed method is able to achieve better performance (6.7% and 8.8% improvements) and competitive interpretability when compared with other rule set learning methods.

Cite

CITATION STYLE

APA

Li, M., Yu, L., Zhang, Y. L., Huang, X., Shi, Q., Cui, Q., … Zhou, J. (2022). An Adaptive Framework for Confidence-constraint Rule Set Learning Algorithm in Large Dataset. In International Conference on Information and Knowledge Management, Proceedings (pp. 3252–3261). Association for Computing Machinery. https://doi.org/10.1145/3511808.3557088

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free