On the public citation graph

Graph Mining and Graph Kernels

https://doi.org/10.1145/1401890.1551565
0 signed · 16 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-45372-5_2openalex-snapshot
An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data
inferredcites →https://doi.org/10.1007/3-540-48686-0_1openalex-snapshot
The Web as a Graph: Measurements, Models, and Methods
inferredcites →https://doi.org/10.1007/978-3-540-45167-9_11openalex-snapshot
On Graph Kernels: Hardness Results and Efficient Alternatives
inferredcites →https://doi.org/10.1016/j.neunet.2005.07.009openalex-snapshot
Graph kernels for chemical informatics
inferredcites →https://doi.org/10.1093/bioinformatics/bth919openalex-snapshot
An efficient algorithm for detecting frequent subgraphs in biological networks
inferredcites →https://doi.org/10.1093/bioinformatics/bti1007openalex-snapshot
Protein function prediction via graph kernels
inferredcites →https://doi.org/10.1109/icdm.2001.989534openalex-snapshot
Frequent subgraph discovery
inferredcites →https://doi.org/10.1109/icdm.2002.1184038openalex-snapshot
gSpan: graph-based substructure pattern mining
inferredcites →https://doi.org/10.1109/icdm.2005.132openalex-snapshot
Shortest-Path Kernels on Graphs
inferredcites →https://doi.org/10.1145/1007568.1007607openalex-snapshot
Graph indexing
inferredcites →https://doi.org/10.1145/1014052.1014072openalex-snapshot
Cyclic pattern kernels for predictive graph mining
inferredcites →https://doi.org/10.1145/1015330.1015446openalex-snapshot
Extensions of marginalized graph kernels
inferredcites →https://doi.org/10.1145/316188.316229openalex-snapshot
On power-law relationships of the Internet topology
inferredcites →https://doi.org/10.7551/mitpress/7503.003.0186openalex-snapshot
Fast Computation of Graph Kernels

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.5281/zenodo.14640032openalex-extracted
Empirical Analysis of Data Mining Techniques for Social Network Websites
inferred← citeshttps://doi.org/10.1109/cse.2009.435openalex-snapshot
Collaborative Mining in Multiple Social Networks Data for Criminal Group Discovery
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.