The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Efficient mining of both positive and negative association rules
Abstract
This paper presents an efficient method for mining both positive and negative association rules in databases. The method extends traditional associations to include association rules of forms A ⇒ ¬ B , ¬ A ⇒ B , and ¬ A ⇒ ¬ B , which indicate negative associations between itemsets. With a pruning strategy and an interestingness measure, our method scales to large databases. The method has been evaluated using both synthetic and real-world databases, and our experimental results demonstrate its effectiveness and efficiency.
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 · cited 6×
“To evaluate the effectiveness, we compare our proposed approach with the support-con.dence framework proposed in [Agrawal et al. 1993b] on discovering positive association rules.”
BackgroundMethodInfluentialMining frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335372 · Cited by 6,402
Computer-Based Medical Consultations: MYCIN.
(1976) · Annals of Internal Medicine · doi:10.7326/0003-4819-85-6-831_1 · Cited by 2,502
Data mining: an overview from a database perspective
Chen, M.-S., Han, J., & Yu, P. S. (1996) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.553155 · Cited by 2,232
Mining generalized association rules
Srikant, R., & Agrawal, R. (1997) · Future Generation Computer Systems · doi:10.1016/s0167-739x(97)00019-8 · Cited by 1,618
Database mining: a performance perspective
Agrawal, R., Imielinski, T., & Swami, A. (1993) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.250074 · Cited by 1,505
Mining quantitative association rules in large relational tables
Srikant, R., & Agrawal, R. (1996) · Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96 · doi:10.1145/233269.233311 · Cited by 1,480
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
Beyond market baskets: generalizing association rules to correlations
Brin, S., Motwani, R., & Silverstein, C. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253327 · Cited by 1,281
Discovery, Analysis, and Presentation of Strong Rules
Piatetsky-Shapiro, G. (1991) · Medical Entomology and Zoology · Cited by 993
Using a hash-based method with transaction trimming for mining association rules
Park, J. S., Chen, M.-S., & Yu, P. S. (1997) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.634757 · Cited by 440
Mining for strong negative associations in a large database of customer transactions
Savasere, A., Omiecinski, E., & Navathe, S. (2002) · Proceedings 14th International Conference on Data Engineering · doi:10.1109/icde.1998.655812 · Cited by 268
Shortliffe, E. H. (1976) · Computer-Based Medical Consultations: Mycin · doi:10.1016/b978-0-444-00179-5.50009-3 · Cited by 268
A new framework for itemset generation
Aggarwal, C. C., & Yu, P. S. (1998) · Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/275487.275490 · Cited by 239
A belief-driven method for discovering unexpected patterns
Padmanabhan, B. (1998) · Cited by 239
Query flocks: a generalization of association-rule mining
Tsur, D., Ullman, J. D., Abiteboul, S., Clifton, C., Motwani, R., Nestorov, S., & Rosenthal, A. S. (1998) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/276304.276306 · Cited by 159
Small is beautiful: discovering the minimal set of unexpected patterns
Padmanabhan, B., & Tuzhilin, A. (2000) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/347090.347103 · Cited by 154
Exception Rule Mining with a Relative Interestingness Measure
Hussain, F., Liu, H., Suzuki, E., & Lü, H. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45571-x_11 · Cited by 114
Share based measures for itemsets
Carter, C. L., Hamilton, H. J., & Cercone, N. J. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63223-9_102 · Cited by 48
Exceptional knowledge discovery in databases based on information theory
Suzuki, E., & Shimura, M. (1996) · Knowledge Discovery and Data Mining · Cited by 43
Cited by
Letham, B., Rudin, C., McCormick, T. H., & Madigan, D. (2015) · The Annals of Applied Statistics · doi:10.1214/15-aoas848 · Cited by 766
“Other techniques could be used for mining antecedents with negation, such as “not diabetes” [Wu, Zhang and Zhang (2004)].”
MethodEfficient kNN classification algorithm for big data
Deng, Z., Zhu, X., Cheng, D., Zong, M., & Zhang, S. (2016) · Neurocomputing · doi:10.1016/j.neucom.2015.08.112 · Cited by 603
Self-citationProfiling relational data: a survey
Abedjan, Z., Golab, L., & Naumann, F. (2015) · The VLDB Journal · doi:10.1007/s00778-015-0389-y · Cited by 283
Metadata
- Authors
- Wu, X., Zhang, C., & Zhang, S.
- Venue
- ACM Transactions on Information Systems
- Published
- 2004-07
- Volume
- 22
- Issue
- 3
- Pages
- 381-405
- ISSN
- 1046-8188 (ISSN-L)
- 1558-2868
- OpenAlex
- W2026562765
- Cited by
- 466
- References
- 20
- FWCI
- 44.58
- Type
- journal article
- 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.