The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Research issues in data stream association rule mining
Abstract
There exist emerging applications of data streams that require association rule mining, such as network traffic monitoring and web click streams analysis. Different from data in traditional static databases, data streams typically arrive continuously in high speed with huge amount and changing data distribution. This raises new issues that need to be considered when developing association rule mining techniques for stream data. This paper discusses those issues and how they are addressed in the existing literature.
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
Fast algorithms for mining association rules
Agrawal, R., & Srikant, R. (1998) · Cited by 11,307
Fast Algorithms for Mining Association Rules in Large Databases
Agrawal, R., & Srikant, R. (1994) · Very Large Data Bases · Cited by 9,419
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
Mining frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335372 · Cited by 3,216
Finding frequent items in data streams
Charikar, M., Chen, K., & Farach-Colton, M. (2004) · Theoretical Computer Science · doi:10.1016/s0304-3975(03)00400-6 · Cited by 1,278
Mining concept-drifting data streams using ensemble classifiers
Wang, H., Fan, W., Yu, P. S., & Han, J. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956778 · Cited by 1,256
Approximate frequency counts over data streams
Manku, G. S., & Motwani, R. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2367502.2367508 · Cited by 1,178
Approximate Frequency Counts over Data Streams
Manku, G. S., & Motwani, R. (2002) · VLDB '02: Proceedings of the 28th International Conference on Very Large Databases · doi:10.1016/b978-155860869-6/50038-x · Cited by 941
Gaber, M. M., Zaslavsky, A., & Krishnaswamy, S. (2005) · ACM SIGMOD Record · doi:10.1145/1083784.1083789 · Cited by 886
Maintenance of discovered association rules in large databases: an incremental updating technique
Cheung, D. W., Han, J., Ng, V. T., & Wong, C. Y. (2002) · Proceedings of the Twelfth International Conference on Data Engineering · doi:10.1109/icde.1996.492094 · Cited by 800
Zhu, Y., & Shasha, D. (2002) · VLDB '02: Proceedings of the 28th International Conference on Very Large Databases · doi:10.1016/b978-155860869-6/50039-1 · Cited by 656
Efficient mining of partial periodic patterns in time series database
Han, J., Dong, G., & Yin, Y. (1999) · Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337) · doi:10.1109/icde.1999.754913 · Cited by 587
What's hot and what's not: tracking most frequent items dynamically
Cormode, G., & Muthukrishnan, S. (2005) · ACM Transactions on Database Systems · doi:10.1145/1061318.1061325 · Cited by 533
Mining Frequent Patterns in Data Streams at Multiple Time Granularities
Giannella, C. R., Han, J., Yan, X., & Yu, P. S. (2002) · Cited by 497
A simple algorithm for finding frequent elements in streams and bags
Karp, R. M., Shenker, S., & Papadimitriou, C. H. (2003) · ACM Transactions on Database Systems · doi:10.1145/762471.762473 · Cited by 491
A fast distributed algorithm for mining association rules
Cheung, D. W., Han, J., Ng, V. T., Fu, A. W., & Fu, Y. (2002) · Fourth International Conference on Parallel and Distributed Information Systems · doi:10.1109/pdis.1996.568665 · Cited by 432
A General Incremental Technique for Maintaining Discovered Association Rules
Cheung, D. W., Lee, S. D., & Kao, B. (1997) · Database Systems for Advanced Applications '97 · doi:10.1142/9789812819536_0020 · Cited by 371
Multi-dimensional sequential pattern mining
Pinto, H., Han, J., Pei, J., Wang, K., Chen, Q., & Dayal, U. (2001) · Proceedings of the tenth international conference on Information and knowledge management · doi:10.1145/502585.502600 · Cited by 206
A Sliding Window Method for Finding Recently Frequent Itemsets over Online Data Streams
Chang, J. H., & Lee, W. S. (2004) · Journal of information science and engineering · doi:10.6688/jise.2004.20.4.7 · Cited by 138
Visualizing association rules with interactive mosaic plots
Hofmann, H., Siebes, A. P. J. M., & Wilhelm, A. (2000) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/347090.347133 · Cited by 138
Estimating Missing Values in Related Sensor Data Streams.
Halatchev, M., & Gruenwald, L. (2005) · Conference on Management of Data · Cited by 114
Self-citationAn Efficient Algorithm for Mining Frequent Itemests over the Entire History of Data Streams
Li, H.-F., Lee, S.-Y., & Shan, M.-K. (2004) · Cited by 103
An Efficient Algorithm for Mining Frequent Itemsets over the Entire History of Data Streams
沈錳坤 (2004) · European conference on Machine Learning · Cited by 98
Cai, Y. D., Clutter, D., Pape, G., Han, J., Welge, M. E., & Auvil, L. S. (2004) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/1007568.1007695 · Cited by 96
Association Rule Mining in Peer-to-Peer Systems
Wolff, R., & Schuster, A. (2004) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/tsmcb.2004.836888 · Cited by 90
A high-performance distributed algorithm for mining association rules
Schuster, A., Wolff, R., & Trock, D. (2004) · Knowledge and Information Systems · doi:10.1007/s10115-004-0176-3 · Cited by 69
Association analysis with one scan of databases
Huang, H., Wu, X., & Relue, R. (2003) · Proceedings · doi:10.1109/icdm.2002.1184015 · Cited by 56
Maintenance of Discovered Association Rules: When to update?
Lee, S. D., & Cheung, D. W.-L. (1997) · Cited by 45
Mining frequent itemsets in distributed and dynamic databases
Otey, M. E., Wang, C., Parthasarathy, S., Veloso, A., & Meira, W. (2004) · Proceedings · doi:10.1109/icdm.2003.1250991 · Cited by 37
Cited by
Webb, G. I., Hyde, R., Cao, H., Nguyen, H. L., & Petitjean, F. (2016) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-015-0448-4 · Cited by 536
Data stream clustering: A survey
Silva, J. A., Faria, E. R., Barros, R. C., Hruschka, E. R., Carvalho, A. C. P. L. F. D., & Gama, J. (2013) · ACM Computing Surveys · doi:10.1145/2522968.2522981 · Cited by 508
A comprehensive survey of anomaly detection techniques for high dimensional big data
Thudumu, S., Branch, P., Jin, J., & Singh, J. (2020) · Journal of Big Data · doi:10.1186/s40537-020-00320-x · Cited by 425
Energy Internet: The business perspective
Zhou, K., Yang, S., & Shao, Z. (2016) · Applied Energy · doi:10.1016/j.apenergy.2016.06.052 · Cited by 343
Machine learning for streaming data: state of the art, challenges, and opportunities
Gomes, H. M., Read, J., Bifet, A., Barddal, J. P., & Gama, J. (2019) · ACM SIGKDD Explorations Newsletter · doi:10.1145/3373464.3373470 · Cited by 267
Metadata
- Authors
- Jiang, N., & Gruenwald, L.
- Venue
- ACM SIGMOD Record
- Published
- 2006-03
- Volume
- 35
- Issue
- 1
- Pages
- 14-19
- ISSN
- 0163-5808 (ISSN-L)
- OpenAlex
- W2138101451
- Cited by
- 287
- References
- 30
- FWCI
- 64.82
- 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.