The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data
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
Data mining and knowledge discovery: making sense out of data
Feyyad, U. M. (1996) · IEEE Expert · doi:10.1109/64.539013 · Cited by 4,612
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
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
Klopman, G. (1984) · Journal of the American Chemical Society · doi:10.1021/ja00336a004 · Cited by 427
MULTICASE 1. A Hierarchical Computer Automated Structure Evaluation Program
Klopman, G. (1992) · Quantitative Structure-Activity Relationships · doi:10.1002/qsar.19920110208 · Cited by 313
King, R. D., Muggleton, S. H., Srinivasan, A., & Sternberg, M. J. (1996) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.93.1.438 · Cited by 231
Finding frequent substructures in chemical compounds
Raedt, L. D., Toivonen, H. T. T., & King, R. D. (1998) · Lirias · Cited by 171
Mining for causes of cancer: machine learning experiments at various levels of detail
Krämer, S., Pfahringer, B., & Helma, C. (1997) · Cited by 9
Cited by
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
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
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
Higher-order organization of complex networks
Benson, A. R., Gleich, D. F., & Leskovec, J. (2016) · Science · doi:10.1126/science.aad9029 · Cited by 1,270
Kuramochi, M., & Karypis, G. (2002) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989534 · Cited by 1,068
Metadata
- Authors
- Inokuchi, A., Washio, T., & Motoda, H.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2000
- Pages
- 13-23
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1641749581
- Cited by
- 1,039
- References
- 10
- FWCI
- 18.17
- 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.