The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
A survey of graph edit distance
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
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 29,065
Kohonen, T. (2001) · Springer Series in Information Sciences · doi:10.1007/978-3-642-56927-2 · Cited by 16,019
Binary Codes capable of currecting deletions, insertions, and reversals
Levenshtein, V. I. (1965) · Soviet physics. Doklady · Cited by 14,807
Davies, D. L., & Bouldin, D. W. (1979) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1979.4766909 · Cited by 9,145
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
Objective Criteria for the Evaluation of Clustering Methods
Rand, W. M. (1971) · Journal of the American Statistical Association · doi:10.1080/01621459.1971.10482356 · Cited by 6,566
Algorithms for clustering data
Flury, B. (1989) · Journal of Statistical Planning and Inference · doi:10.1016/0378-3758(89)90033-5 · Cited by 6,432
A dendrite method for cluster analysis
Caliński, T., & Harabasz, J. (1974) · Communications in Statistics · doi:10.1080/03610927408827101 · Cited by 4,480
The String-to-String Correction Problem
Wagner, R. A., & Fischer, M. J. (1974) · Journal of the ACM · doi:10.1145/321796.321811 · Cited by 3,032
Well-Separated Clusters and Optimal Fuzzy Partitions
Dunn†, J. C. (1974) · Journal of Cybernetics · doi:10.1080/01969727408546059 · Cited by 2,510
Measures of Association for Cross Classifications
Goodman, L. A., & Kruskal, W. H. (1979) · Springer Series in Statistics · doi:10.1007/978-1-4612-9995-0 · Cited by 2,244
A Method for Comparing Two Hierarchical Clusterings
Fowlkes, E. B., & Mallows, C. L. (1983) · Journal of the American Statistical Association · doi:10.1080/01621459.1983.10478008 · Cited by 1,614
Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
Zhang, K., & Shasha, D. (1989) · SIAM Journal on Computing · doi:10.1137/0218082 · Cited by 1,310
A distance measure between attributed relational graphs for pattern recognition
Sanfeliu, A., & Fu, K.-S. (1983) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1983.6313167 · Cited by 999
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
Ristad, E. S., & Yianilos, P. N. (1998) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.682181 · Cited by 859
QUADRATIC ASSIGNMENT AS A GENERAL DATA ANALYSIS STRATEGY
Hubert, L., & Schultz, J. (1976) · British Journal of Mathematical and Statistical Psychology · doi:10.1111/j.2044-8317.1976.tb00714.x · Cited by 829
A survey on tree edit distance and related problems
Bille, P. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2004.12.030 · Cited by 751 · cited 1×
“The similarity of labeled trees is compared in [61] by various methods, in which definitions of cost functions are given ahead.”
MethodAn eigendecomposition approach to weighted graph matching problems
Umeyama, S. (1988) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.6778 · Cited by 727
Recognition of shapes by editing their shock graphs
Sebastian, T. B., Klein, P. N., & Kimia, B. B. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.1273924 · Cited by 727
On a relation between graph edit distance and maximum common subgraph
Bunke, H. (1997) · Pattern Recognition Letters · doi:10.1016/s0167-8655(97)00060-3 · Cited by 530
Structural matching in computer vision using probabilistic relaxation
Christmas, W. J., Kittler, J., & Petrou, M. (1995) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.400565 · Cited by 495
A new algorithm for error-tolerant subgraph isomorphism detection
Messmer, B., & Bunke, H. (1998) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.682179 · Cited by 348
Computation of normalized edit distance and applications
Marzal, A., & Vidal, E. (1993) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.232078 · Cited by 340
Structural matching by discrete relaxation
Wilson, R. C., & Hancock, E. R. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.601251 · Cited by 311
Error correcting graph matching: on the influence of the underlying cost function
Bunke, H. (1999) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.790431 · Cited by 229
A Constrained Edit Distance Between Unordered Labeled Trees
Zhang, K. (1996) · Algorithmica · doi:10.1007/bf01975866 · Cited by 221
On the k-NN performance in a challenging scenario of imbalance and overlapping
García, V., Mollineda, R. A., & Sánchez, J. S. (2008) · Pattern Analysis and Applications · doi:10.1007/s10044-007-0087-5 · Cited by 219
A graph distance metric combining maximum common subgraph and minimum common supergraph
Fernández, M.-L., & Valiente, G. (2001) · Pattern Recognition Letters · doi:10.1016/s0167-8655(01)00017-4 · Cited by 206
An eigenspace projection clustering method for inexact graph matching
Caelli, T., & Kosinov, S. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.1265866 · Cited by 204
Graph edit distance from spectral seriation
Robles-Kelly, A., & Hancock, E. R. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.56 · Cited by 200
A binary linear programming formulation of the graph edit distance
Justice, D., & Hero, A. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.152 · Cited by 184
Recent developments in graph matching
Bunke, H. (2002) · Proceedings 15th International Conference on Pattern Recognition. ICPR-2000 · doi:10.1109/icpr.2000.906030 · Cited by 180
Myers, R., Wison, R. C., & Hancock, E. R. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.862201 · Cited by 171
Video indexing and similarity retrieval by largest common subgraph detection using decision trees
Shearer, K., Bunke, H., & Venkatesh, S. (2001) · Pattern Recognition · doi:10.1016/s0031-3203(00)00048-0 · Cited by 113
Graph matching and clustering using spectral partitions
Qiu, H., & Hancock, E. R. (2005) · Pattern Recognition · doi:10.1016/j.patcog.2005.06.014 · Cited by 100
Self-Organizing Maps for Learning the Edit Costs in Graph Matching
Neuhaus, M., & Horst Bunke, A. (2005) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/tsmcb.2005.846635 · Cited by 94
Computing approximate tree edit distance using relaxation labeling
Torsello, A., & Hancock, E. R. (2003) · Pattern Recognition Letters · doi:10.1016/s0167-8655(02)00255-6 · Cited by 73
Image categorization: Graph edit direction histogram
Gao, X., Xiao, B., Tao, D., & Li, X. (2008) · Pattern Recognition · doi:10.1016/j.patcog.2008.03.025 · Cited by 54
Self-citationSTRING EDIT DISTANCE, RANDOM WALKS AND GRAPH MATCHING
Robles‐Kelly, A., & Hancock, E. R. (2004) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001404003277 · Cited by 54
Feature Selection for Graph-Based Image Classifiers
Saux, B. L., & Bunke, H. (2005) · Lecture notes in computer science · doi:10.1007/11492542_19 · Cited by 28
Edit Distance Based Kernel Functions for Attributed Graph Matching
Neuhaus, M., & Horst Bunke, A. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-31988-7_34 · Cited by 12
Cited by
Graph based anomaly detection and description: a survey
Akoglu, L., Tong, H., & Koutra, D. (2015) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-014-0365-y · Cited by 1,504
Graph R-CNN for Scene Graph Generation
Yang, J., Lu, J., Lee, S., Batra, D., & Parikh, D. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-01246-5_41 · Cited by 851
A Survey on Metric Learning for Feature Vectors and Structured Data
Bellet, A., Habrard, A., & Sebban, M. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1306.6709 · Cited by 494
Anomaly detection in dynamic networks: a survey
Ranshous, S., Shen, S., Koutra, D., Harenberg, S., Faloutsos, C., & Samatova, N. F. (2015) · WIREs Computational Statistics · doi:10.1002/wics.1347 · Cited by 379
AfterQC: automatic filtering, trimming, error removing and quality control for fastq data
Chen, S., Huang, T., Zhou, Y., Han, Y., Xu, M., & Gu, J. (2017) · BMC Bioinformatics · doi:10.1186/s12859-017-1469-3 · Cited by 366
Metadata
- Authors
- Gao, X., Xiao, B., Tao, D., & Li, X.
- Venue
- Pattern Analysis and Applications
- Published
- 2009-01-13
- Volume
- 13
- Issue
- 1
- Pages
- 113-129
- ISSN
- 1433-7541 (ISSN-L)
- 1433-755X
- OpenAlex
- W1983681808
- Cited by
- 704
- References
- 43
- FWCI
- 20.89
- Type
- journal article
- 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.