The DOI matches its Crossref record.
A distance measure between attributed relational graphs for pattern recognition
Abstract
A method to determine a distance measure between two nonhierarchical attributed relational graphs is presented. In order to apply this distance measure, the graphs are characterised by descriptive graph grammars (DGG). The proposed distance measure is based on the computation of the minimum number of modifications required to transform an input graph into the reference one. Specifically, the distance measure is defined as the cost of recognition of nodes plus the number of transformations which include node insertion, node deletion, branch insertion, branch deletion, node label substitution and branch label substitution. The major difference between the proposed distance measure and the other ones is the consideration of the cost of recognition of nodes in the distance computation. In order to do this, the principal features of the nodes are described by one or several cost functions which are used to compute the similarity between the input nodes and the reference ones. Finally, an application of this distance measure to the recognition of lower case handwritten English characters is presented.
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
Cited by
Quantification of network structural dissimilarities
Schieber, T. A., Carpi, L., Díaz-Guilera, A., Pardalos, P. M., Masoller, C., & Ravetti, M. G. (2017) · Nature Communications · doi:10.1038/ncomms13928 · Cited by 237
Unexpected means of protocol inference
Ma, J., Levchenko, K., Kreibich, C., Savage, S., & Voelker, G. M. (2006) · Proceedings of the 6th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1177080.1177123 · Cited by 204
Does BLEU Score Work for Code Migration?
Tran, N., Tran, H., Nguyen, S., Nguyen, H., & Nguyen, T. (2019) · 2019 IEEE/ACM 27th International Conference on Program Comprehension (ICPC) · doi:10.1109/icpc.2019.00034 · Cited by 49
From Legacy to Standard: LLM-Assisted Transformation of Cybersecurity Playbooks into CACAO Format
Akbari Gurabi, M., Nitz, L., Castravet, R.-M., Matzutt, R., Mandal, A., & Decker, S. (2026) · Lecture Notes in Computer Science · doi:10.1007/978-3-032-16092-8_27 · Cited by 3
Comparing Planning Domain Models Using Answer Set Programming
Chrpa, L., Dodaro, C., Maratea, M., Mochi, M., & Vallati, M. (2023) · Lecture Notes in Computer Science · doi:10.1007/978-3-031-43619-2_16 · Cited by 2
Metadata
- Authors
- Sanfeliu, A., & Fu, K.-S.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics
- Published
- 1983-05
- Volume
- SMC-13
- Issue
- 3
- Pages
- 353-362
- ISSN
- 0018-9472 (ISSN-L)
- 2168-2909
- OpenAlex
- W2010541316
- Cited by
- 999
- References
- 0
- FWCI
- 7.16
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A distance measure between attributed relational graphs for pattern recognition. https://app.cochat.ai/papers/10.1109/tsmc.1983.6313167
- The paper
- Sanfeliu, A., & Fu, K.-S. (1983). A distance measure between attributed relational graphs for pattern recognition. IEEE Transactions on Systems, Man, and Cybernetics. https://doi.org/10.1109/tsmc.1983.6313167
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.
