The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Efficient mining of emerging patterns: discovering trends and differences
Abstract
We introduce a new kind of patterns, called emerging patterns (EPs), for knowledge discovery from databases. EPs are defined as itemsets whose supports increase significantly from one dataset to another. EPs can capture emerging trends in timestamped databases, or useful contrasts between data classes. EPs have been proven useful: we have used them to build very powerful classifiers, which are more accurate than C4.5 and CBA, for many datasets. We believe that EPs with low to medium support, such as 1%-20%, can give useful new insights and guidance to experts, in even “well understood” applications. The efficient mining of EPs is a challenging problem, since (i) the Apriori property no longer holds for EPs, and (ii) there are usually too many candidates for high dimensional databases or for small support thresholds such as 0.5%. Naive algorithms are too costly. To solve this problem, (a) we promote the description of large collections of itemsets using their concise borders (the pair of sets of the minimal and of the maximal itemsets in the collections). (b) We design EP mining algorithms which manipulate only borders of collections (especially using our multiborder- differential algorithm), and which represent discovered EPs using borders. All EPs satisfying a constraint can be efficiently discovered by our border-based algorithms, which take the borders, derived by Max-Miner, of large itemsets as inputs. In our experiments on large and high dimensional datasets including the US census and Mushroom datasets, many EPs, including some with large cardinality, are found quickly. We also give other algorithms for discovering general or special types of EPs.
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
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
Agrawal, R., & Srikant, R. (2002) · Proceedings of the Eleventh International Conference on Data Engineering · doi:10.1109/icde.1995.380415 · Cited by 5,155
Advances in knowledge discovery and data mining
(1996) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(96)90007-3 · Cited by 2,971
Integrating classification and association rule mining
Liu, B., Hsu, W., & Ma, Y. (1998) · Cited by 2,247
Discovery 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
Levelwise Search and Borders of Theories in Knowledge Discovery
Mannila, H., & Toivonen, H. T. T. (1997) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009796218281 · Cited by 889
Discovering Frequent Episodes in Sequences.
Mannila, H., Toivonen, H. T. T., & Verkamo, A. I. (1995) · Knowledge Discovery and Data Mining · Cited by 689
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-citation
Cited by
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
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
Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach
Han, J., Pei, J., Yin, Y., & Mao, R. (2004) · Data Mining and Knowledge Discovery · doi:10.1023/b:dami.0000005258.31418.83 · Cited by 2,629
Yeoh, E.-J., Ross, M. E., Shurtleff, S. A., Williams, W. K., Patel, D., Mahfouz, R., Behm, F. G., Raimondi, S. C., Relling, M. V., Patel, A., et al. (2002) · Cancer Cell · doi:10.1016/s1535-6108(02)00032-6 · Cited by 1,917
Self-citationCost-sensitive boosting for classification of imbalanced data
Sun, Y., Kamel, M. S., Wong, A. K. C., & Wang, Y. (2007) · Pattern Recognition · doi:10.1016/j.patcog.2007.04.009 · Cited by 1,423
Frequent pattern mining: current status and future directions
Han, J., Cheng, H., Xin, D., & Yan, X. (2007) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-006-0059-1 · Cited by 1,380
A survey on addressing high-class imbalance in big data
Leevy, J. L., Khoshgoftaar, T. M., Bauder, R. A., & Seliya, N. (2018) · Journal of Big Data · doi:10.1186/s40537-018-0151-6 · Cited by 759
Interpretable Decision Sets: A Joint Framework for Description and Prediction
Lakkaraju, H., Bach, S. H., & Leskovec, J. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939874 · Cited by 687
Loyola-Gonzalez, O. (2019) · IEEE Access · doi:10.1109/access.2019.2949286 · Cited by 559
3D skeleton-based human action classification: A survey
Lo Presti, L., & La Cascia, M. (2016) · Pattern Recognition · doi:10.1016/j.patcog.2015.11.019 · Cited by 397
An Approach to Pose-Based Action Recognition
Wang, C., Wang, Y., & Yuille, A. L. (2013) · 2013 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2013.123 · Cited by 373
Detecting Group Differences: Mining Contrast Sets
Bay, S. D., & Pazzani, M. J. (2001) · Data Mining and Knowledge Discovery · doi:10.1023/a:1011429418057 · Cited by 370
Novak, P. K., Nada Lavrač, A., & Webb, G. I. (2009) · doi:10.5555/1577069.1577083 · Cited by 327
Effective detection of sophisticated online banking fraud on extremely imbalanced data
Wei, W., Li, J., Cao, L., Ou, Y., & Chen, J. (2013) · World Wide Web · doi:10.1007/s11280-012-0178-0 · Cited by 325
Self-citationUnbiased split selection for classification trees based on the Gini Index
Strobl, C., Boulesteix, A.-L., & Augustin, T. (2007) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2006.12.030 · Cited by 308
Clustering and Sequential Pattern Mining of Online Collaborative Learning Data
Perera, D., Kay, J., Koprinska, I., Yacef, K., & Zaiane, O. R. (2009) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2008.138 · Cited by 295
Mining significant graph patterns by leap search
Yan, X., Cheng, H., Han, J., & Yu, P. S. (2008) · Proceedings of the 2008 ACM SIGMOD international conference on Management of data · doi:10.1145/1376616.1376662 · Cited by 291
An overview on subgroup discovery: foundations and applications
Herrera, F., Carmona, C. J., González, P., & del Jesus, M. J. (2011) · Knowledge and Information Systems · doi:10.1007/s10115-010-0356-2 · Cited by 290
Mining frequent patterns by pattern-growth: methodology and implications
Han, J., & Pei, J. (2000) · ACM SIGKDD Explorations Newsletter · doi:10.1145/380995.381002 · Cited by 280
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
An unsupervised approach to activity recognition and segmentation based on object-use fingerprints
Gu, T., Chen, S., Tao, X., & Lu, J. (2010) · Data & Knowledge Engineering · doi:10.1016/j.datak.2010.01.004 · Cited by 107
Intent classification of short-text on social media,
Purohit, H., Dong, G., Shalin, V., Thirunarayan, K., & Sheth, A. (2015) · 2015 IEEE International Conference on Smart City/SocialCom/SustainCom (SmartCity) · doi:10.1109/smartcity.2015.75 · Cited by 66
“learning predictor-class relationships [25].”
BackgroundSelf-citation
Metadata
- Authors
- Dong, G., & Li, J.
- Venue
- Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 1999-08
- Pages
- 43-52
- OpenAlex
- W2038812321
- Cited by
- 1,018
- References
- 14
- FWCI
- 19.12
- 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.