On the public citation graph
A Random Walk Kernel Derived from Graph Edit Distance
0 signed · 35 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11492542_19openalex-snapshot
Feature Selection for Graph-Based Image Classifiers
inferredcites →https://doi.org/10.1007/3-540-45028-9_9openalex-snapshot
Graph Edit Distance with Node Splitting and Merging, and Its Application to Diatom Identification
inferredcites →https://doi.org/10.1007/978-3-540-27868-9_18openalex-snapshot
An Error-Tolerant Approximate Matching Algorithm for Attributed Planar Graphs and Its Application to Fingerprint Classification
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.1007/978-3-642-14980-1openalex-snapshot
Structural, Syntactic, and Statistical Pattern Recognition
inferredcites →https://doi.org/10.1007/978-3-642-20844-7openalex-snapshot
Graph-Based Representations in Pattern Recognition
inferredcites →https://doi.org/10.1016/0167-8655(83)90033-8openalex-snapshot
Inexact graph matching for structural pattern recognition
inferredcites →https://doi.org/10.1016/j.neucom.2004.11.011openalex-snapshot
SVM learning with the Schur–Hadamard inner product for graphs
inferredcites →https://doi.org/10.1017/cbo9780511809682openalex-snapshot
Kernel Methods for Pattern Analysis
inferredcites →https://doi.org/10.1093/bioinformatics/bti1007openalex-snapshot
Protein function prediction via graph kernels
inferredcites →https://doi.org/10.1109/tsmc.1983.6313167openalex-snapshot
A distance measure between attributed relational graphs for pattern recognition
inferredcites →https://doi.org/10.1142/s0218001404003228openalex-snapshot
THIRTY YEARS OF GRAPH MATCHING IN PATTERN RECOGNITION
inferredcites →https://doi.org/10.7551/mitpress/1113.001.0001openalex-snapshot
Advances in Large-Margin Classifiers
inferredcites →https://doi.org/10.7551/mitpress/1113.003.0006openalex-snapshot
Dynamic Alignment Kernels
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-47637-2_1openalex-snapshot
Bridging Distinct Spaces in Graph-Based Machine Learning
inferred← citeshttps://doi.org/10.1007/978-3-540-72903-7_10openalex-snapshot
Image Classification Using Marginalized Kernels for Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-72903-7_34openalex-snapshot
Graph Embedding Using Quantum Commute Times
inferred← citeshttps://doi.org/10.1007/978-3-540-76856-2_30openalex-snapshot
Kernel Fusion for Image Classification Using Fuzzy Structural Information
inferred← citeshttps://doi.org/10.1007/s11634-010-0074-3openalex-snapshot
Network ensemble clustering using latent roles
inferred← citeshttps://doi.org/10.1016/j.autcon.2012.12.015openalex-snapshot
Automatic design quality evaluation using graph similarity measures
inferred← citeshttps://doi.org/10.1016/j.imavis.2008.10.013openalex-snapshot
Graph matching using the interference of discrete-time quantum walks
inferred← citeshttps://doi.org/10.1016/j.patcog.2014.03.014openalex-snapshot
A distance measure for large graphs based on prime graphs
inferred← citeshttps://doi.org/10.1016/j.patrec.2011.08.012openalex-snapshot
Pattern analysis with graphs: Parallel work at Bern and York
inferred← citeshttps://doi.org/10.1017/9781108649018openalex-snapshot
Quantitative Analysis of Ecological Networks
inferred← citeshttps://doi.org/10.1109/icde.2015.7113322openalex-snapshot
False rumors detection on Sina Weibo by propagation structures
inferred← citeshttps://doi.org/10.1109/ijcnn.2012.6252681openalex-snapshot
Parallel algorithms for tensor product-based inexact graph matching
inferred← citeshttps://doi.org/10.2197/ipsjtbio.6.2openalex-snapshot
Global Network Alignment Method Using Node Similarity Based on Network Characteristics
inferred← citeshttps://doi.org/10.4018/978-1-4666-1764-3.ch020openalex-snapshot
Enterprise Tomography Driven Root-Cause-Analysis and Integration Lifecycle Management of Federated ERP in Green Clouds
inferred← citeshttps://doi.org/10.4018/978-1-4666-2494-8.ch007openalex-snapshot
Enterprise Tomography
inferred← citeshttps://doi.org/10.48550/arxiv.1502.07576openalex-snapshot
Comparison Issues in Large Graphs: State of the Art and Future Directions
inferred← citeshttps://doi.org/10.5555/2011781.2011785openalex-snapshot
Graph embedding using a quasi-quantum analogue of the hitting times of continuous time quantum walks
inferred← citeshttps://doi.org/10.70675/25248cddz689az4f98z8bd2z381c02a454c3openalex-snapshot
When operations research meets structural pattern recognition : on the solution of error-tolerant graph matching problems
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.