The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A General Incremental Technique for Maintaining Discovered Association Rules
Abstract
A more general incremental updating technique is developed for maintaining the association rules discovered in a database in the cases including insertion, deletion, and modification of transactions in the database. A previously proposed algorithm FUP can only handle the maintenance problem in the case of insertion. The proposed algorithm FUP2 makes use of the previous mining result to cut down the cost of finding the new rules in an updated database. In the insertion only case, FUP2 is equivalent to FUP. In the deletion only case, FUP2 is a complementary algorithm of FUP which is very efficient when the deleted transactions is a small part of the database, which is the most applicable case. In the general case, FUP2 can efficiently update the discovered rules when new transactions are added to a transaction database, and obsolete transactions are removed from it. The proposed algorithm has been implemented and its performance is studied and compared with the best algorithms for mining association rules studied so far. The study shows that the new incremental algorithm is significantly faster than the traditional approach of mining the whole updated database.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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 by
A survey of temporal knowledge discovery paradigms and methods
Roddick, J. F., & Spiliopoulou, M. (2002) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2002.1019212 · Cited by 397
Research issues in data stream association rule mining
Jiang, N., & Gruenwald, L. (2006) · ACM SIGMOD Record · doi:10.1145/1121995.1121998 · Cited by 287
A Survey of Utility-Oriented Pattern Mining
Gan, W., Lin, J. C.-W., Fournier-Viger, P., Chao, H.-C., Tseng, V. S., & Yu, P. S. (2021) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2019.2942594 · Cited by 257
(2003) · Cited by 165
Context-aware rule learning from smartphone data: survey, challenges and future directions
Sarker, I. H. (2019) · Journal of Big Data · doi:10.1186/s40537-019-0258-4 · Cited by 105
Metadata
- Authors
- Cheung, D. W., Lee, S. D., & Kao, B.
- Venue
- Database Systems for Advanced Applications '97
- Publisher
- WORLD SCIENTIFIC
- Published
- 1997-03
- Pages
- 185-194
- OpenAlex
- W2052360255
- Cited by
- 371
- References
- 1
- FWCI
- 3.96
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A General Incremental Technique for Maintaining Discovered Association Rules. https://app.cochat.ai/papers/10.1142/9789812819536_0020
- The paper
- Cheung, D. W., Lee, S. D., & Kao, B. (1997). A General Incremental Technique for Maintaining Discovered Association Rules. Database Systems for Advanced Applications '97. https://doi.org/10.1142/9789812819536_0020
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.