The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Mining the most interesting rules
Abstract
Several algorithms have been proposed for finding the “best, ” “optimal,” or “most interesting ” rule(s) in a database according to a variety of metrics including confidence, support, gain, chi-squared value, gini, entropy gain, laplace, lift, and conviction. In this paper, we show that the best rule according to any of these metrics must reside along a support/confidence border. Further, in the case of conjunctive rule mining within categorical data, the number of rules along this border is conveniently small, and can be mined efficiently from a variety of real-world data-sets. We also show how this concept can be generalized to mine all rules that are best according to any of these criteria with respect to an arbitrary subset of the population of interest. We argue that by returning a broader set of rules than previous algorithms, our techniques allow for improved insight into the data and support more user-interaction in the optimized rule-mining process. 1.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Mining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · Proceedings of the 1993 ACM SIGMOD international conference on Management of data · doi:10.1145/170035.170072 · Cited by 14,907
Self-citationFast discovery of association rules
Agrawal, R., Mannila, H., Srikant, R., Toivonen, H. T. T., & Verkamo, A. I. (1996) · Knowledge Discovery and Data Mining · Cited by 2,376
Self-citationDynamic itemset counting and implication rules for market basket data
Brin, S., Motwani, R., Ullman, J. D., & Tsur, S. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253325 · Cited by 1,951
Efficiently mining long patterns from databases
Bayardo, R. J. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276313 · Cited by 1,302
Self-citationDiscovery, Analysis, and Presentation of Strong Rules
Piatetsky-Shapiro, G. (1991) · Medical Entomology and Zoology · Cited by 993
Rule induction with CN2: Some recent improvements
Clark, P., & Boswell, R. (1991) · Lecture Notes in Computer Science · doi:10.1007/bfb0017011 · Cited by 859
Mining association rules with item constraints
Srikant, R., Vu, Q., & Agrawal, R. (1997) · Cited by 766
Self-citationSearch through systematic set enumeration
Rymon, R. (1992) · ScholarlyCommons (University of Pennsylvania) · Cited by 388
Constraint-based rule mining in large, dense databases
Bayardo, R. J., Agrawal, R., & Gunopulos, D. (1999) · Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337) · doi:10.1109/icde.1999.754924 · Cited by 362
Self-citationData mining using two-dimensional optimized association rules: scheme, algorithms, and visualization
Fukuda, T., Morimoto, Y., Morishita, S., & Tokuyama, T. (1996) · Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96 · doi:10.1145/233269.233313 · Cited by 265
Partial classification using association rules
Ali, K., Manganaris, S., & Srikant, R. (1997) · Cited by 221
OPUS: An Efficient Admissible Algorithm for Unordered Search
Webb, G. I. (1995) · Journal of Artificial Intelligence Research · doi:10.1613/jair.227 · Cited by 207
Abstract-driven pattern discovery in databases
Dhar, V., & Tuzhulin, A. (1993) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.250075 · Cited by 105
Cited by
Interestingness measures for data mining: A survey
Geng, L., & Hamilton, H. J. (2006) · ACM Computing Surveys · doi:10.1145/1132960.1132963 · Cited by 1,141
Hand, D. J. (2007) · Drug Safety · doi:10.2165/00002018-200730070-00010 · Cited by 1,044
MAFIA: a maximal frequent itemset algorithm for transactional databases
Burdick, D., Calimlim, M., & Gehrke, J. (2002) · Proceedings 17th International Conference on Data Engineering · doi:10.1109/icde.2001.914857 · Cited by 612
Clustering Rules: A Comparison of Partitioning and Hierarchical Clustering Algorithms
Reynolds, A. P., Richards, G., de la Iglesia, B., & Rayward-Smith, V. J. (2006) · Journal of Mathematical Modelling and Algorithms · doi:10.1007/s10852-005-9022-1 · Cited by 578
Selecting the right objective measure for association analysis
Tan, P.-N., Kumar, V., & Srivastava, J. (2004) · Information Systems · doi:10.1016/s0306-4379(03)00072-3 · Cited by 568
Metadata
- Authors
- Bayardo, R. J., & Agrawal, R.
- Venue
- Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 1999-08
- Pages
- 145-154
- OpenAlex
- W2172186225
- Cited by
- 653
- References
- 13
- FWCI
- 38.65
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.