The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Mining sequential patterns
Abstract
We are given a large database of customer transactions, where each transaction consists of customer-id, transaction time, and the items bought in the transaction. We introduce the problem of mining sequential patterns over such databases. We present three algorithms to solve this problem, and empirically evaluate their performance using synthetic data. Two of the proposed algorithms, AprioriSome and AprioriAll, have comparable performance, albeit AprioriSome performs a little better when the minimum number of customers that must support a sequential pattern is low. Scale-up experiments show that both AprioriSome and AprioriAll scale linearly with the number of customer transactions. They also have excellent scale-up properties with respect to the number of transactions per customer and the number of items in a transaction.>
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
Basic local alignment search tool
Altschul, S. F., Gish, W., Miller, W., Myers, E. W., & Lipman, D. J. (1990) · Journal of Molecular Biology · doi:10.1006/jmbi.1990.9999 · Cited by 98,669
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 2×
“Related Work In [1], the problem of discovering \what items are bought together in a transaction" over basket data was introduced.”
BackgroundSelf-citationFast algorithms for mining association rules
Agrawal, R., & Srikant, R. (1998) · Cited by 11,307
Self-citationFast text searching: allowing errors
Wu, S., & Manber, U. (1992) · Communications of the ACM · doi:10.1145/135239.135244 · Cited by 727
Color Set Size problem with applications to string matching
Chi, L., & Hui, K. (1992) · Lecture Notes in Computer Science · doi:10.1007/3-540-56024-6_19 · Cited by 165
Combinatorial pattern discovery for scientific data: some preliminary results
Wang, J. T.-L., Chirn, G., Marr, T. G., Shapiro, B. A., Shasha, D. E., & Zhang, K. (1994) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/191839.191863 · Cited by 149
FLASH: a fast look-up algorithm for string homology
Califano, A., & Rigoutsos, I. (2002) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.1993.341106 · Cited by 109
A fast and sensitive multiple sequence alignment algorithm
Vingron, M., & Argos, P. (1989) · Computer applications in the biosciences · doi:10.1093/bioinformatics/5.2.115 · Cited by 107
FLASH: a fast look-up algorithm for string homology.
Califano, A., & Rigoutsos, I. (1993) · PubMed · Cited by 106
Discovering patterns in sequences of events
Dietterich, T. G., & Michalski, R. S. (1985) · Artificial Intelligence · doi:10.1016/0004-3702(85)90003-7 · Cited by 105
(1993) · Lecture notes in computer science · doi:10.1007/bfb0029791 · Cited by 20
Cited by
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
Chandola, V., Banerjee, A., & Kumar, V. (2009) · ACM Computing Surveys · doi:10.1145/1541880.1541882 · Cited by 11,687
Mining frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335372 · Cited by 6,402
A Survey of Data Mining and Machine Learning Methods for Cyber Security Intrusion Detection
Buczak, A. L., & Guven, E. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2494502 · Cited by 3,332
Mining sequential patterns: Generalizations and performance improvements
Srikant, R., & Agrawal, R. (1996) · Lecture Notes in Computer Science · doi:10.1007/bfb0014140 · Cited by 2,711
Self-citation
Metadata
- Authors
- Agrawal, R., & Srikant, R.
- Venue
- Proceedings of the Eleventh International Conference on Data Engineering
- Publisher
- IEEE Comput. Soc. Press
- Published
- 2002-11-19
- Pages
- 3-14
- ISSN
- 1084-4627 (ISSN-L)
- OpenAlex
- W2158454296
- Cited by
- 5,155
- References
- 11
- FWCI
- 193.92
- 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.