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
Cited by
Items 101–111 of 111
An end-to-end system to identify temporal relation in discharge summaries: 2012 i2b2 challenge
Xu, Y., Wang, Y., Liu, T., Tsujii, J., & Chang, E. I.-C. (2013) · Journal of the American Medical Informatics Association · doi:10.1136/amiajnl-2012-001607 · Cited by 71
Identifying cross‐selling opportunities, using lifestyle segmentation and survival analysis
Ansell, J., Harrison, T., & Archibald, T. (2007) · Marketing Intelligence & Planning · doi:10.1108/02634500710754619 · Cited by 60
Multi-Modal Stacked Denoising Autoencoder for Handling Missing Data in Healthcare Big Data
Kim, J.-C., & Chung, K. (2020) · IEEE Access · doi:10.1109/access.2020.2997255 · Cited by 56
SafePath: Differentially-private publishing of passenger trajectories in transportation systems
Al-Hussaeni, K., Fung, B. C. M., Iqbal, F., Dagher, G. G., & Park, E. G. (2018) · Computer Networks · doi:10.1016/j.comnet.2018.07.007 · Cited by 52
Mining multimodal sequential patterns: a case study on affect detection
Martínez, H. P., & Yannakakis, G. N. (2011) · Proceedings of the 13th international conference on multimodal interfaces · doi:10.1145/2070481.2070485 · Cited by 42
Emergent properties, models, and laws of behavioral similarities within groups of twitter users
Cresci, S., Di Pietro, R., Petrocchi, M., Spognardi, A., & Tesconi, M. (2020) · Computer Communications · doi:10.1016/j.comcom.2019.10.019 · Cited by 40
A multiparadigm intelligent tutoring system for robotic arm training
Fournier-Viger, P., Nkambou, R., Nguifo, E. M., Mayers, A., & Faghihi, U. (2013) · IEEE Transactions on Learning Technologies · doi:10.1109/tlt.2013.27 · Cited by 30
High-throughput phenotyping with temporal sequences
Estiri, H., Strasser, Z. H., & Murphy, S. N. (2021) · Journal of the American Medical Informatics Association · doi:10.1093/jamia/ocaa288 · Cited by 26
(2017) · doi:10.1109/dsaa.2017.57 · Cited by 21
“Try, Try, Try Again:” Sequence Analysis of User Interaction Data with a Voice User Interface
Myers, C. M., Laris Pardo, L. F., Acosta-Ruiz, A., Canossa, A., & Zhu, J. (2021) · CUI 2021 - 3rd Conference on Conversational User Interfaces · doi:10.1145/3469595.3469613 · Cited by 10
Tracking and Prediciting Movement Patterns of a Moving Object in Wiresless Sensor Network
Gupta, S. M., & Mujawar, A. (2018) · 2018 2nd International Conference on Trends in Electronics and Informatics (ICOEI) · doi:10.1109/icoei.2018.8553964 · Cited by 2
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.