The DOI matches its Crossref record; 50 of the 50 references it cites were found in a registry or an index.
Detecting Group Differences: Mining Contrast Sets
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
Fast algorithms for mining association rules
Agrawal, R., & Srikant, R. (1998) · Cited by 11,307
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
Fast Algorithms for Mining Association Rules in Large Databases
Agrawal, R., & Srikant, R. (1994) · Very Large Data Bases · Cited by 9,419
Hapeman, D. E. (1991) · Technometrics · doi:10.1080/00401706.1991.10484817 · Cited by 9,373
Nonlinear programming: theory and algorithms
(1993) · Computers & Operations Research · doi:10.1016/0305-0548(93)90042-h · Cited by 5,779
Discrete Multivariate Analysis: Theory and Practice.
Beniger, J. R., Bishop, Y. M. M., Feinberg, S. E., Holland, P. W., Light, R. J., & Mosteller, F. (1975) · Contemporary Sociology · doi:10.2307/2063625 · Cited by 5,108
Multiple Comparison Procedures
Hochberg, Y., & Tamhane, A. C. (1987) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316672 · Cited by 2,389
Multiple Comparison Procedures
(2013) · An Introduction to Statistical Concepts · doi:10.4324/9780203137819-17 · Cited by 2,109
Shaffer, J. P. (1995) · Annual Review of Psychology · doi:10.1146/annurev.ps.46.020195.003021 · Cited by 1,960
Dynamic itemset counting and implication rules for market basket data
Brin, S., Motwani, R., Ullman, J. D., & Tsur, S. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253325 · Cited by 1,951
Things I have learned (so far).
Cohen, J. (1990) · American Psychologist · doi:10.1037/0003-066x.45.12.1304 · Cited by 1,781
The Analysis of Contingency Tables
Odoroff, C. L. (1978) · Technometrics · doi:10.1080/00401706.1978.10489678 · Cited by 1,541
Integrated Public Use Microdata Series
Ruggles, S., Genadek, K., Goeken, R., Grover, J., & Sobek, M. (2015) · Institute for Social Research and Data Innovation · doi:10.18128/d010.v6.0 · Cited by 1,485
Mining quantitative association rules in large relational tables
Srikant, R., & Agrawal, R. (1996) · Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96 · doi:10.1145/233269.233311 · Cited by 1,480
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
New algorithms for fast discovery of association rules
Zaki, M. J., Parthasarathy, S., Ogihara, M., & Wei, L. (1997) · Cited by 1,126
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
Knoke, D., & Burke, P. (1980) · Sage eBooks · doi:10.4135/9781412984843 · Cited by 916
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
Mining 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
Finding interesting rules from large sets of discovered association rules
Klemettinen, M., Mannila, H., Ronkainen, P., Toivonen, H., & Verkamo, A. I. (1994) · Proceedings of the third international conference on Information and knowledge management - CIKM '94 · doi:10.1145/191246.191314 · Cited by 712
What makes patterns interesting in knowledge discovery systems
Silberschatz, A., & Tuzhilin, A. (1996) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.553165 · Cited by 679
Integrated Public Use Microdata Series: Version 7.0
Ruggles, S., Genadek, K. R., Goeken, R., Grover, J., & Sobek, M. (2017) · Institute for Social Research and Data Innovation · doi:10.18128/d010.v7.0 · Cited by 577
Keogh, E., & Pazzani, M. J. (1998) · Cited by 496
Self-citationExplora: a multipattern and multistrategy discovery assistant
Klösgen, W. (1996) · Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft) · Cited by 438
Pruning and summarizing the discovered associations
Liu, B., Hsu, W., & Ma, Y. (1999) · Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/312129.312216 · Cited by 418
The Analysis of Contingency Tables
Everitt, B. S. (1992) · doi:10.1201/b15072 · Cited by 388
Search through systematic set enumeration
Rymon, R. (1992) · ScholarlyCommons (University of Pennsylvania) · Cited by 388
Beyond Market Baskets: Generalizing Association Rules to Dependence Rules
Silverstein, C., Brin, S., & Motwani, R. (1998) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009713703947 · Cited by 368
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
Nonlinear Programming : Theory And Algorithms
Bazaraa, M. S., Sherali, H. D., & Shetty, C. M. (1979) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 356
Version spaces: a candidate elimination approach to rule learning
Mitchell, T. M. (1977) · International Joint Conference on Artificial Intelligence · Cited by 333
Pincer-search: A new algorithm for discovering the maximum frequent set
Lin, D.-I., & Kedem, Z. M. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0100980 · Cited by 277
The Rise of Divorce and Separation in the Unitd States, 1880-1990
Ruggles, S. (1997) · Demography · doi:10.2307/3038300 · Cited by 270
Parallel Algorithms for Discovery of Association Rules
Zaki, M. J., Parthasarathy, S., Ogihara, M., Li, W., Stolorz, P., & Musick, R. (1997) · Scalable High Performance Computing for Knowledge Discovery and Data Mining · doi:10.1007/978-1-4615-5669-5_1 · Cited by 264
Agrawal, R., Psaila, G., Wimmers, E. L., & Zaït, M. (1995) · Cited by 251
A belief-driven method for discovering unexpected patterns
Padmanabhan, B. (1998) · Cited by 239
Using general impressions to analyze discovered classification rules
Liu, B., Hsu, W., & Chen, S. (1997) · Cited by 219
The Robustness of Homogeneity Tests in 2 x N Tables
Lewontin, R. C., & Felsenstein, J. (1965) · Biometrics · doi:10.2307/2528349 · Cited by 194
Detecting change in categorical data: mining contrast sets
Bay, S. D., & Pazzani, M. J. (1999) · Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/312129.312263 · Cited by 193
Self-citationThe Audubon Society Field Guide to North American Mushrooms
Singer, R., & Lincoff, G. H. (1983) · Mycologia · doi:10.2307/3792705 · Cited by 180
Finding interesting patterns using user expectations
Liu, B., Hsu, W., Mun, L.-F., & Lee, H.-Y. (1999) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.824588 · Cited by 156
Mining Surprising Patterns Using Temporal Description Length
Chakrabarti, S., Sarawagi, S., & Dom, B. (1998) · Cited by 130
REPRESENTATION DESIGN AND BRUTE-FORCE INDUCTION IN A BOEING MANUFACTURING DOMAIN
Riddle, P., Segal, R. B., & Etzioni, O. (1994) · Applied Artificial Intelligence · doi:10.1080/08839519408945435 · Cited by 128
A framework for measuring changes in data characteristics
Ganti, V., Gehrke, J. E., & Ramakrishnan, R. (1999) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/303976.303989 · Cited by 126
Discovering predictive association rules
Megiddo, N., & Srikant, R. (1998) · Cited by 105
A Support System for Interpreting Statistical Data.
Hoschka, P., & Klösgen, W. (1991) · Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft) · Cited by 66
Intergroup Disparity: Economic Theory and Social Science Evidence
Darity, W. A. J. (1998) · Southern Economic Journal · doi:10.1002/j.2325-8012.1998.tb00106.x · Cited by 28
Cited by
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
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
Metadata
- Authors
- Bay, S. D., & Pazzani, M. J.
- Venue
- Data Mining and Knowledge Discovery
- Published
- 2001-07
- Volume
- 5
- Issue
- 3
- Pages
- 213-246
- ISSN
- 1384-5810 (ISSN-L)
- 1573-756X
- OpenAlex
- W1549565124
- Cited by
- 370
- References
- 50
- FWCI
- 11.36
- 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.