Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition

DOI10.1109/TPAMI.1985.4767707zbMath0564.05047OpenAlexW1971105294WikidataQ52267053 ScholiaQ52267053MaRDI QIDQ3677798

Andrew K. C. Wong, Manlai You

Publication date: 1985

Published in: IEEE Transactions on Pattern Analysis and Machine Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tpami.1985.4767707

zbMATH Keywords

pattern classificationunsupervised learningrandom graphrelational dataShannon's entropy measurepattern graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Pattern recognition, speech recognition (68T10)

Related Items (18)

Unnamed Item ⋮ Analysis of symbolic sequences using the Jensen-Shannon divergence ⋮ The Pólya information divergence ⋮ The Yoccoz-Birkeland livestock population model coupled with random price dynamics ⋮ Upper and lower bounds for the \(q\)-entropy of network models with application to network model selection ⋮ Matching Delaunay graphs ⋮ The Jensen-Shannon divergence ⋮ A survey of multiple sequence comparison methods ⋮ A multiple sequence comparison method ⋮ Of bits and wows: a Bayesian theory of surprise with applications to attention ⋮ Hierachical random graph representation of handwritten characters and its application to Hangul recognition ⋮ Least-commitment graph matching with genetic algorithms ⋮ Graph-based representations and techniques for image processing and image analysis ⋮ A Structural and Semantic Probabilistic Model for Matching and Representing a Set of Graphs ⋮ Chaotic Traversal (CHAT): Very Large Graphs Traversal Using Chaotic Dynamics ⋮ Relational object recognition from large structural libraries ⋮ A tunable distance measure for coloured solid models ⋮ Quantitative linguistic study of DNA sequences

This page was built for publication: Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition