The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition
Abstract
The notion of a random graph is formally defined. It deals with both the probabilistic and the structural aspects of relational data. By interpreting an ensemble of attributed graphs as the outcomes of a random graph, we can use its lower order distribution to characterize the ensemble. To reflect the variability of a random graph, Shannon's entropy measure is used. To synthesize an ensemble of attributed graphs into the distribution of a random graph (or a set of distributions), we propose a distance measure between random graphs based on the minimum change of entropy before and after their merging. When the ensemble contains more than one class of pattern graphs, the synthesis process yields distributions corresponding to various classes. This process corresponds to unsupervised learning in pattern classification. Using the maximum likelihood rule and the probability computed for the pattern graph, based on its matching with the random graph distributions of different classes, we can classify the pattern graph to a class.
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
Cites
(1973) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(09)x7013-3 · Cited by 2,937
Structural Pattern Recognition
Pavlidis, T. (1977) · Springer eBooks · doi:10.1007/978-3-642-88304-0 · Cited by 1,055
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
Structural Descriptions and Inexact Matching
Shapiro, L. G., & Haralick, R. M. (1981) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1981.4767144 · Cited by 544
Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis
Tsai, W.-H., & Fu, K.-S. (1979) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1979.4310127 · Cited by 327
A formal picture description scheme as a basis for picture processing systems
Shaw, A. C. (1969) · Information and Control · doi:10.1016/s0019-9958(69)90017-5 · Cited by 249
Probability and Statistical Inference
Kalbfleisch, J. G. (1979) · Universitext · doi:10.1007/978-1-4684-0089-2 · Cited by 197
Subgraph error-correcting isomorphisms for syntactic pattern recognition
Tsai, W., & Fu, K. (1983) · IEEE Transactions on Systems Man and Cybernetics · doi:10.1109/tsmc.1983.6313029 · Cited by 120
Graph Optimal Monomorphism Algorithms
Ghahraman, D. E., Wong, A. K. C., & Au, T. (1980) · IEEE Transactions on Systems Man and Cybernetics · doi:10.1109/tsmc.1980.4308468 · Cited by 54
Self-citationRandom Graphs: Structural-Contextual Dichotomy
Wong, A. K. C., & Ghahraman, D. E. (1980) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1980.4767033 · Cited by 29
Self-citation
Cited by
Menéndez, M. L., Pardo, J. A., Pardo, L., & Pardo, M. C. (1997) · Journal of the Franklin Institute · doi:10.1016/s0016-0032(96)00063-4 · Cited by 521
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
Of bits and wows: A Bayesian theory of surprise with applications to attention
Baldi, P., & Itti, L. (2010) · Neural Networks · doi:10.1016/j.neunet.2009.12.007 · Cited by 302
Huang, C.-H., Tsai, J. J. P., Kurubanjerdjit, N., & Ng, K.-L. (2019) · doi:10.1101/536318 · Cited by 4
Metadata
- Authors
- Wong, A. K. C., & You, M.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 1985-09
- Volume
- PAMI-7
- Issue
- 5
- Pages
- 599-609
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W1971105294
- Cited by
- 291
- References
- 10
- FWCI
- 6.75
- 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: Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition. https://app.cochat.ai/papers/10.1109/tpami.1985.4767707
- The paper
- Wong, A. K. C., & You, M. (1985). Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence. https://doi.org/10.1109/tpami.1985.4767707
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.