The DOI matches its Crossref record; 30 of the 30 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.
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
A training algorithm for optimal margin classifiers
Boser, B. E., Guyon, I. M., & Vapnik, V. N. (1992) · Proceedings of the fifth annual workshop on Computational learning theory · doi:10.1145/130385.130401 · Cited by 11,992
Advances in Neural Information Processing Systems 14: Proceedings of the 2001 Conference
(2002) · The MIT Press eBooks · doi:10.7551/mitpress/1120.001.0001 · Cited by 8,890
Depth-First Search and Linear Graph Algorithms
Tarjan, R. (1972) · SIAM Journal on Computing · doi:10.1137/0201010 · Cited by 6,081
Advances in kernel methods: support vector learning
Schölkopf, B., Burges, C. J. C., & Smola, A. J. (1999) · doi:10.5555/299094 · Cited by 5,789
Diestel, R. (1997) · Cited by 5,082
Making Large-Scale SVM Learning Practical
Joachims, T. (1998) · RePEc: Research Papers in Economics · doi:10.17877/de290r-14262 · Cited by 4,411
Advances in knowledge discovery and data mining
(1996) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(96)90007-3 · Cited by 2,971
Fast discovery of association rules
Agrawal, R., Mannila, H., Srikant, R., Toivonen, H. T. T., & Verkamo, A. I. (1996) · Knowledge Discovery and Data Mining · Cited by 2,376
The Complexity of Enumeration and Reliability Problems
Valiant, L. G. (1979) · SIAM Journal on Computing · doi:10.1137/0208032 · Cited by 2,076
Robust classification for imprecise environments
Provost, F., & Fawcett, T. (2001) · Machine Learning · doi:10.1023/a:1007601015854 · Cited by 1,250
Department of Computer Science
(1993) · Journal of Computational and Applied Mathematics · doi:10.1016/0377-0427(93)90083-n · Cited by 1,210
Ebbinghaus, H.-D., & Flum, J. (1995) · Springer Monographs in Mathematics · doi:10.1007/3-540-28788-4 · Cited by 1,124
Convolution kernels on discrete structures
Haussler, D. H. (1999) · Cited by 1,089
Kuramochi, M., & Karypis, G. (2002) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989534 · Cited by 1,068
The Case against Accuracy Estimation for Comparing Induction Algorithms
Provost, F. J., Fawcett, T. E., & Kohavi, R. (1998) · Cited by 1,031
On Graph Kernels: Hardness Results and Efficient Alternatives
Gärtner, T., Flach, P., & Wrobel, S. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45167-9_11 · Cited by 879
Self-citationConvolution Kernels for Natural Language
Collins, M., & Duffy, N. (2002) · Advances in Neural Information Processing Systems 14 · doi:10.7551/mitpress/1120.003.0085 · Cited by 808
Marginalized kernels between labeled graphs
Kashima, H., Tsuda, K., & Inokuchi, A. (2003) · Cited by 710
Text Classification using String Kernels
Lodhi, H. M., Shawe-Taylor, J. S., Cristianini, N., & Watkins, C. J. C. H. (2000) · Bristol Research (University of Bristol) · Cited by 620
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
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
Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tompkins, A., & Upfal, E. (2000) · Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '00 · doi:10.1145/335168.335170 · Cited by 288
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
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
Graph kernels and Gaussian processes for relational reinforcement learning
Driessens, K., Ramon, J., & Gärtner, T. (2006) · Machine Learning · doi:10.1007/s10994-006-8258-y · Cited by 92
Self-citationFINITE MODEL THEORY (Perspectives in Mathematical Logic)
Dawar, A. (1997) · Bulletin of the London Mathematical Society · doi:10.1112/s0024609396222416 · Cited by 91
Union of all the Minimum Cycle Bases of a Graph
Vismara, P. (1997) · The Electronic Journal of Combinatorics · doi:10.37236/1294 · 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
Positive Definite Rational Kernels
Cortes, C., Haffner, P., & Mohri, M. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45167-9_5 · Cited by 35
Cited by
Yanardag, P., & Vishwanathan, S. V. N. (2015) · Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2783258.2783417 · Cited by 1,021
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
Comparison of descriptor spaces for chemical compound retrieval and classification
Wale, N., Watson, I. A., & Karypis, G. (2008) · Knowledge and Information Systems · doi:10.1007/s10115-007-0103-5 · Cited by 453
Graph kernels for chemical informatics
Ralaivola, L., Swamidass, S. J., Saigo, H., & Baldi, P. (2005) · Neural Networks · doi:10.1016/j.neunet.2005.07.009 · Cited by 442
Kriege, N. M., Johansson, F. D., & Morris, C. (2020) · Applied Network Science · doi:10.1007/s41109-019-0195-3 · Cited by 381
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
- 30
- 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
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.