The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Cyclic pattern kernels for predictive graph mining
Abstract
S.158-167
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Robust classification for imprecise environments
Provost, F., & Fawcett, T. (2001) · Machine Learning · doi:10.1023/a:1007601015854 · Cited by 1,250
Cited by
Shortest-Path Kernels on Graphs
Borgwardt, K. M., & Kriegel, H. (2006) · Fifth IEEE International Conference on Data Mining (ICDM'05) · doi:10.1109/icdm.2005.132 · Cited by 837
DGCNN: A convolutional neural network over large-scale labeled graphs
Phan, A. V., Nguyen, M. L., Nguyen, Y. L. H., & Bui, L. T. (2018) · Neural Networks · doi:10.1016/j.neunet.2018.09.001 · Cited by 355
SimGNN: A Neural Network Approach to Fast Graph Similarity Computation
Bai, Y., Ding, H., Bian, S., Chen, T., Sun, Y., & Wang, W. (2019) · Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining · doi:10.1145/3289600.3290967 · Cited by 325
Kang, U., Tong, H., & Sun, J. (2012) · Proceedings of the 2012 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972825.71 · Cited by 127
Entropy Bounds for Hierarchical Molecular Networks
Dehmer, M., Borgert, S., & Emmert-Streib, F. (2008) · PLoS ONE · doi:10.1371/journal.pone.0003079 · Cited by 40
Metadata
- Authors
- Horváth, T., Gärtner, T., & Wrobel, S.
- Venue
- Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2004-08-22
- Pages
- 158-167
- OpenAlex
- W2039444222
- Cited by
- 308
- References
- 2
- FWCI
- 8.76
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Cyclic pattern kernels for predictive graph mining. https://app.cochat.ai/papers/10.1145/1014052.1014072
- The paper
- Horváth, T., Gärtner, T., & Wrobel, S. (2004). Cyclic pattern kernels for predictive graph mining. Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining. https://doi.org/10.1145/1014052.1014072
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.