The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
State of the art of graph-based data mining
Abstract
The need for mining structured data has increased in the past few years. One of the best studied data structures in computer science and discrete mathematics are graphs. It can therefore be no surprise that graph based data mining has become quite popular in the last few years.This article introduces the theoretical basis of graph based data mining and surveys the state of the art of graph-based data mining. Brief descriptions of some representative approaches are provided 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
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
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
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
Inductive Logic Programming: Theory and methods
Muggleton, S., & de Raedt, L. (1994) · The Journal of Logic Programming · doi:10.1016/0743-1066(94)90035-3 · Cited by 1,537
Kuramochi, M., & Karypis, G. (2002) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989534 · Cited by 1,068
Debnath, A. K., Lopez de Compadre, R. L., Debnath, G., Shusterman, A. J., & Hansch, C. (1991) · Journal of Medicinal Chemistry · doi:10.1021/jm00106a046 · Cited by 868
Diffusion Kernels on Graphs and Other Discrete Input Spaces
Kondor, R., & Lafferty, J. (2002) · Cited by 725
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
Efficiently mining frequent trees in a forest
Zaki, M. J. (2002) · ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/775047.775058 · Cited by 472
A database perspective on knowledge discovery
Imielinski, T., & Mannila, H. (1996) · Communications of the ACM · doi:10.1145/240455.240472 · Cited by 470
A survey of kernels for structured data
Gärtner, T. (2003) · ACM SIGKDD Explorations Newsletter · doi:10.1145/959242.959248 · Cited by 452
Discovery of frequent DATALOG patterns
Dehaspe, L., & Toivonen, H. (1999) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009863704807 · Cited by 313
Mendelzon, A. O., Mihaila, G. A., & Milo, T. (1997) · International Journal on Digital Libraries · doi:10.1007/s007990050004 · Cited by 312
Discovering generalized episodes using minimal occurrences
Mannila, H., & Toivonen, H. T. T. (1996) · Cited by 306
Complete 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
Self-citationThe levelwise version space algorithm and its application to molecular fragment finding
Raedt, L. D., & Krämer, S. (2001) · Lirias · Cited by 134
Graph-based induction as a unified learning framework
Yoshida, K., Motoda, H., & Indurkhya, N. (1994) · Applied Intelligence · doi:10.1007/bf00872095 · Cited by 85
Self-citationStructural Machine Learning with Galois Lattice and Graphs
Liquiere, M., & Sallantin, J. (1998) · Cited by 79
Learning Relational Concepts with Decision Trees.
Geibel, P., & Wysotzki, F. (1996) · International Conference on Machine Learning · Cited by 33
Cited by
Schaeffer, S. E. (2007) · Computer Science Review · doi:10.1016/j.cosrev.2007.05.001 · Cited by 1,639
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
Graph indexing: a frequent structure-based approach
Yan, X., Yu, P. S., & Han, J. (2004) · Proceedings of the 2004 ACM SIGMOD international conference on Management of data · doi:10.1145/1007568.1007607 · Cited by 637
Identifying the signs of fraudulent accounts using data mining techniques
Li, S.-H., Yen, D. C., Lu, W.-H., & Wang, C. (2012) · Computers in Human Behavior · doi:10.1016/j.chb.2012.01.002 · Cited by 505
Efficient aggregation for graph summarization
Tian, Y., Hankins, R. A., & Patel, J. M. (2008) · Proceedings of the 2008 ACM SIGMOD international conference on Management of data · doi:10.1145/1376616.1376675 · Cited by 442
Metadata
- Authors
- Washio, T., & Motoda, H.
- Venue
- ACM SIGKDD Explorations Newsletter
- Published
- 2003-07
- Volume
- 5
- Issue
- 1
- Pages
- 59-68
- ISSN
- 1931-0145 (ISSN-L)
- 1931-0153
- OpenAlex
- W2130426318
- Cited by
- 448
- References
- 20
- FWCI
- 26.59
- 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.