The DOI matches its Crossref record; 56 of the 56 references it cites were found in a registry or an index.
Finding Frequent Patterns in a Large Sparse Graph*
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
(1979) · Cited by 43,841
Berman, H. M. (2000) · Nucleic Acids Research · doi:10.1093/nar/28.1.235 · Cited by 40,196
Social Network Analysis: Methods and Applications
Wasserman, S. S., & Faust, K. (1994) · Cited by 17,993
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
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
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
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
Agrawal, 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
Automatic subspace clustering of high dimensional data for data mining applications
Agrawal, R., Gehrke, J., Gunopulos, D., & Raghavan, P. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276314 · Cited by 2,412
UCI Repository of Machine Learning Databases
Merz, C. J. (1996) · Medical Entomology and Zoology · Cited by 2,363
Integrating classification and association rule mining
Liu, B., Hsu, W., & Ma, Y. (1998) · Cited by 2,247
gSpan: graph-based substructure pattern mining
Yan, X., & Han, J. (2003) · 2002 IEEE International Conference on Data Mining, 2002. Proceedings. · doi:10.1109/icdm.2002.1184038 · Cited by 2,013
CMAR: accurate and efficient classification based on multiple class-association rules
Li, W., Han, J., & Pei, J. (2002) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989541 · Cited by 1,204
Kuramochi, M., & Karypis, G. (2002) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989534 · Cited by 1,068
Self-citationAn Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data
Inokuchi, A., Washio, T., & Motoda, H. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45372-5_2 · Cited by 1,039
The Web as a Graph: Measurements, Models, and Methods
Kleinberg, J. M., Kumar, R., Raghavan, P., Rajagopalan, S., & Tomkins, A. S. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48686-0_1 · Cited by 1,016
A framework for constructing features and models for intrusion detection systems
Lee, W., & Stolfo, S. J. (2000) · ACM Transactions on Information and System Security · doi:10.1145/382912.382914 · Cited by 974
CloseGraph: mining closed frequent graph patterns
Yan, X., & Han, J. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956784 · Cited by 635
Efficient mining of frequent subgraphs in the presence of isomorphism
Huan, J., Wang, W., & Prins, J. (2004) · Third IEEE International Conference on Data Mining · doi:10.1109/icdm.2003.1250974 · Cited by 614
Fast vertical mining using diffsets
Zaki, M. J., & Gouda, K. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956788 · Cited by 593
A fast algorithm for the maximum clique problem
Östergård, P. R. J. (2002) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(01)00290-6 · Cited by 590
Substructure Discovery Using Minimum Description Length and Background Knowledge
Cook, D. J., & Holder, L. B. (1994) · Journal of Artificial Intelligence Research · doi:10.1613/jair.43 · Cited by 480
Read, R. C., & Corneil, D. G. (1977) · Journal of Graph Theory · doi:10.1002/jgt.3190010410 · Cited by 453
Cook, D. J., & Holder, L. B. (2000) · IEEE Intelligent Systems and their Applications · doi:10.1109/5254.850825 · Cited by 442
Mining molecular fragments: finding relevant substructures of molecules
Borgelt, C., & Berthold, M. R. (2003) · 2002 IEEE International Conference on Data Mining, 2002. Proceedings. · doi:10.1109/icdm.2002.1183885 · Cited by 442
Approximating clique is almost NP-complete
Feige, U., Goldwasser, S., Lovasz, L., Safra, S., & Szegedy, M. (2002) · [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science · doi:10.1109/sfcs.1991.185341 · Cited by 396
An efficient algorithm for discovering frequent subgraphs
Kuramochi, M., & Karypis, G. (2004) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2004.33 · Cited by 352
Self-citationComplete Mining of Frequent Patterns from Graphs: Mining Graph Data
Inokuchi, A., Washio, T., & Motoda, H. (2003) · Machine Learning · doi:10.1023/a:1021726221443 · Cited by 279
Greed is good: Approximating independent sets in sparse and bounded-degree graphs
Halldórsson, M. M., & Radhakrishnan, J. (1997) · Algorithmica · doi:10.1007/bf02523693 · Cited by 274
Efficient bounds for the stable set, vertex cover and set packing problems
Hochbaum, D. S. (1983) · Discrete Applied Mathematics · doi:10.1016/0166-218x(83)90080-x · Cited by 272
Grindley, H. M., Artymiuk, P. J., Rice, D. W., & Willett, P. (1993) · Journal of Molecular Biology · doi:10.1006/jmbi.1993.1074 · Cited by 267
ANF: a fast and scalable tool for data mining in massive graphs
Palmer, C. R., Gibbons, P. B., & Faloutsos, C. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775059 · Cited by 266
Molecular feature mining in HIV data
Kramer, S., De Raedt, L., & Helma, C. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502533 · Cited by 226
Use of techniques derived from graph theory to compare secondary structure motifs in proteins
Mitchell, E. M., Artymiuk, P. J., Rice, D. W., & Willett, P. (1990) · Journal of Molecular Biology · doi:10.1016/0022-2836(90)90312-a · Cited by 219
Data Mining: Next Generation Challenges and Future Directions
Kargupta, H., Joshi, A., Sivakumar, K., et al. (2004) · AAAI Press eBooks · Cited by 203
Finding frequent substructures in chemical compounds
Raedt, L. D., Toivonen, H. T. T., & King, R. D. (1998) · Lirias · Cited by 171
Raymond, J. W., Gardiner, E. J., & Willett, P. (2002) · Journal of Chemical Information and Computer Sciences · doi:10.1021/ci010381f · Cited by 154
Frequent sub-structure-based approaches for classifying chemical compounds
Deshpande, M., Kuramochi, M., & Karypis, G. (2004) · Proceedings · doi:10.1109/icdm.2003.1250900 · Cited by 153
Self-citationOn Approximation Properties of the Independent Set Problem for Low Degree Graphs
Berman, P. (1999) · Theory of Computing Systems · doi:10.1007/s002240000113 · Cited by 137
The levelwise version space algorithm and its application to molecular fragment finding
Raedt, L. D., & Krämer, S. (2001) · Lirias · Cited by 134
Carcinogenesis predictions using ILP
Srinivasan, A., King, R. D., Muggleton, S., & Sternberg, M. J. E. (1997) · Lecture notes in computer science · doi:10.1007/3540635149_56 · Cited by 118
On syntactic versus computational views of approximability
Khanna, S., Motwani, R., Sudan, M., & Vazirani, U. V. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365712 · Cited by 107
Finding Frequent Patterns in a Large Sparse Graph
Kuramochi, M., & Karypis, G. (2004) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972740.32 · Cited by 91
Self-citationCLIP: concept learning from inference patterns
Yoshida, K., & Motoda, H. (1995) · Artificial Intelligence · doi:10.1016/0004-3702(94)00066-a · Cited by 90
On approximation properties of the Independent set problem for degree 3 graphs
Berman, P., & Fujito, T. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60220-8_84 · Cited by 89
Graph-based induction as a unified learning framework
Yoshida, K., Motoda, H., & Indurkhya, N. (1994) · Applied Intelligence · doi:10.1007/bf00872095 · Cited by 85
Scientific knowledge discovery using inductive logic programming
Muggleton, S. (1999) · Communications of the ACM · doi:10.1145/319382.319390 · Cited by 79
Leibowitz, N., Nussinov, R., & Wolfson, H. J. (2001) · Journal of Computational Biology · doi:10.1089/106652701300312896 · Cited by 70
Logic induction of valid behavior specifications for intrusion detection
Ko, C. (2002) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/secpri.2000.848452 · Cited by 66
Fast Detection of Common Geometric Substructure in Proteins
Chew, L. P., Huttenlocher, D. P., Kedem, K., & Kleinberg, J. M. (1999) · Journal of Computational Biology · doi:10.1089/106652799318292 · Cited by 66
Automated Approaches for Classifying Structures
Deshpande, M., Kuramochi, M., & Karypis, G. (2002) · Defense Technical Information Center (DTIC) · doi:10.21236/ada439498 · Cited by 60
Self-citationSEuS: Structure Extraction Using Summaries
Ghazizadeh, S., & Chawathe, S. S. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36182-0_9 · Cited by 58
Relational Data Mining with Inductive Logic Programming for Link Discovery
Mooney, R. J., Melville, P., Tang, L. R., SHAVLIK, J. W., Dutro, I. D. C., Page, D., & Costa, V. S. (2002) · Cited by 49
Cited by
PEGASUS: A Peta-Scale Graph Mining System Implementation and Observations
Kang, U., Tsourakakis, C. E., & Faloutsos, C. (2009) · 2009 Ninth IEEE International Conference on Data Mining · doi:10.1109/icdm.2009.14 · Cited by 628
Managing and Mining Graph Data
(2010) · Advances in Database Systems · doi:10.1007/978-1-4419-6045-0 · Cited by 594
k-automorphism: a general framework for privacy preserving network publication
Zou, L., Chen, L., & Özsu, M. T. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687627.1687734 · Cited by 409
A classification for community discovery methods in complex networks
Coscia, M., Giannotti, F., & Pedreschi, D. (2011) · Statistical Analysis and Data Mining: The ASA Data Science Journal · doi:10.1002/sam.10133 · Cited by 353
A survey of frequent subgraph mining algorithms
Jiang, C., Coenen, F., & Zito, M. (2013) · The Knowledge Engineering Review · doi:10.1017/s0269888912000331 · Cited by 346
Metadata
- Authors
- Kuramochi, M., & Karypis, G.
- Venue
- Data Mining and Knowledge Discovery
- Published
- 2005-09-08
- Volume
- 11
- Issue
- 3
- Pages
- 243-271
- ISSN
- 1384-5810 (ISSN-L)
- 1573-756X
- OpenAlex
- W2019827052
- Cited by
- 371
- References
- 56
- FWCI
- 38.68
- 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.