The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Mining frequent patterns by pattern-growth: methodology and implications
Open accessAbstract
Mining frequent patterns has been a focused topic in data mining research in recent years, with the developmeht of numerous interesting algorithms for mining association, correlation, causality, sequential patterns, partial periodicity, constraint-based frequent pattern mining, associative classification, emerging patterns, etc.Most of the previous studies adopt an Apriori-like, candidate generation-and-test approach.However, based on our analysis, candidate generation and test may still be expensive, especially when encountering long and numerous patterns.A new methodology, called f r e q u e n t p a t t e r n growth, which mines frequent patterns without candidate generation, has been developed.The method adopts a divide-andconquer philosophy to project and partition databases based on the currently discovered frequent patterns and grow such patterns to longer ones in the projected databases.Moreover, efficient data structures have been developed for effective database compression and fast in-memory traversal.Such a methodology may eliminate or substantially reduce the number of candidate sets to be generated and also reduce the size of the database to be iteratively examined, and, therefore, lead to high performance.In this paper, we provide an overview of this approach and examine its methodology and implications for mining several kinds of frequent patterns, including association, frequent closed itemsets, max-patterns, sequential patterns, and constraint-based mining of frequent patterns.We show that frequent pattern growth is efficient at mining large databases and its further development may lead to scalable mining of many other kinds of patterns as well.
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 2×
“Mining Frequent Patterns by Pattern-Growth: Methodology and Implications * Jiawei Han School of Computing Science Simon Fraser University Burnaby, B.C., Canada V5A 1S6 han@cs.sfu.ca ABSTRACT Mining frequent patterns has been a focused topic in data mining research in recent years, with the developmeht of nu- merous in…”
BackgroundFast 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
Self-citationAgrawal, R., & Srikant, R. (2002) · Proceedings of the Eleventh International Conference on Data Engineering · doi:10.1109/icde.1995.380415 · Cited by 5,155
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
Self-citationMining sequential patterns: Generalizations and performance improvements
Srikant, R., & Agrawal, R. (1996) · Lecture Notes in Computer Science · doi:10.1007/bfb0014140 · Cited by 2,711
Integrating classification and association rule mining
Liu, B., Hsu, W., & Ma, Y. (1998) · Cited by 2,247
PrefixSpan,: mining sequential patterns efficiently by prefix-projected pattern growth
Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., & Hsu, M.-C. (2005) · Proceedings 17th International Conference on Data Engineering · doi:10.1109/icde.2001.914830 · Cited by 1,791
Self-citationDiscovery of Frequent Episodes in Event Sequences
Mannila, H., Toivonen, H., & Inkeri Verkamo, A. (1997) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009748302351 · Cited by 1,463
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
Efficient mining of emerging patterns: discovering trends and differences
Dong, G., & Li, J. (1999) · Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/312129.312191 · Cited by 1,018
CLOSET : An Efficient Algorithm for Mining Frequent Closed Itemsets
Pei, J. (2000) · Cited by 828
Self-citationFreeSpan: frequent pattern-projected sequential pattern mining
Han, J., Pei, J., Mortazavi-Asl, B., Chen, Q., Dayal, U., & Hsu, M.-C. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347167 · Cited by 808
Self-citationMining association rules with item constraints
Srikant, R., Vu, Q., & Agrawal, R. (1997) · Cited by 766
Exploratory mining and pruning optimizations of constrained associations rules
Ng, R. T., Lakshmanan, L. V. S., Han, J., & Pang, A. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276307 · Cited by 715
Self-citationEfficient algorithms for discovering association rules
Mannila, H., Toivonen, H. T. T., & Verkamo, A. I. (1994) · Cited by 624
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
Self-citationA Tree Projection Algorithm for Generation of Frequent Item Sets
Agarwal, R. C., Aggarwal, C. C., & Prasad, V. V. V. (2001) · Journal of Parallel and Distributed Computing · doi:10.1006/jpdc.2000.1693 · Cited by 510
Bottom-up computation of sparse and Iceberg CUBE
Beyer, K., & Ramakrishnan, R. (1999) · ACM SIGMOD Record · doi:10.1145/304181.304214 · Cited by 461
SPIRIT: Sequential Pattern Mining with Regular Expression Constraints
Garofalakis, M., Rastogi, R. R., & Shim, K. (1999) · Cited by 445
Özden, B., Ramaswamy, S., & Silberschatz, A. (2002) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.1998.655804 · Cited by 411
Constraint-based rule mining in large, dense databases
Bayardo, R. J., Agrawal, R., & Gunopulos, D. (1999) · Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337) · doi:10.1109/icde.1999.754924 · Cited by 362
Computing Iceberg Queries Efficiently
Fang, M., Shivakumar, N., García-Molina, H., Motwani, R., & Ullman, J. D. (1998) · Cited by 340
Mining frequent itemsets with convertible constraints
Pei, J., Han, J., & Lakshmanan, L. V. S. (2002) · Proceedings 17th International Conference on Data Engineering · doi:10.1109/icde.2001.914856 · Cited by 324
Self-citationScalable Techniques for Mining Causal Structures
Silverstein, C., Brin, S., Motwani, R., & Ullman, J. (2000) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009891813863 · Cited by 319
Bottom-up computation of sparse and Iceberg CUBE
Beyer, K., & Ramakrishnan, R. (1999) · Proceedings of the 1999 ACM SIGMOD international conference on Management of data · doi:10.1145/304182.304214 · Cited by 244
Can we push more constraints into frequent pattern mining?
Pei, J., & Han, J. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347166 · Cited by 191
Self-citationEfficient mining of constrained correlated sets
Grahne, G., Lakshmanan, L. V. S., & Wang, X. (2002) · Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073) · doi:10.1109/icde.2000.839450 · Cited by 162
Optimization of constrained frequent set queries with 2-variable constraints
Lakshmanan, L. V. S., Ng, R. T., Han, J., & Pang, A. (1999) · ACM SIGMOD Record · doi:10.1145/304181.304196 · Cited by 153
Self-citationOptimization of constrained frequent set queries with 2-variable constraints
Lakshmanan, L. V. S., Ng, R. T., Han, J., & Pang, A. (1999) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/304182.304196 · Cited by 83
Self-citationRatio Rules: A New Paradigm for Fast, Quantifiable Data Mining
Korn, F. R., Labrinidis, A., Kotidis, Y., & Faloutsos, C. (2018) · doi:10.1184/r1/6608795 · Cited by 52
Cited by
Data Mining for the Internet of Things: Literature Review and Challenges
Chen, F., Deng, P., Wan, J., Zhang, D., Vasilakos, A. V., & Rong, X. (2015) · International Journal of Distributed Sensor Networks · doi:10.1155/2015/431047 · Cited by 528
Ceglar, A., & Roddick, J. F. (2006) · ACM Computing Surveys · doi:10.1145/1132956.1132958 · Cited by 324
Sequential pattern mining -- approaches and algorithms
Mooney, C. H., & Roddick, J. F. (2013) · ACM Computing Surveys · doi:10.1145/2431211.2431218 · Cited by 310
(2003) · Cited by 165
Constrained frequent pattern mining: a pattern-growth view
Pei, J., & Han, J. (2002) · ACM SIGKDD Explorations Newsletter · doi:10.1145/568574.568580 · Cited by 133
Self-citation
Metadata
- Authors
- Han, J., & Pei, J.
- Venue
- ACM SIGKDD Explorations Newsletter
- Published
- 2000-12
- Volume
- 2
- Issue
- 2
- Pages
- 14-20
- ISSN
- 1931-0145 (ISSN-L)
- 1931-0153
- OpenAlex
- W1984606279
- Cited by
- 280
- References
- 32
- FWCI
- 20.62
- Type
- journal article
- Language
- en
- Open access
- bronze
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.