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

@article{Wong1985EntropyAD,
  title={Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition},
  author={Andrew K. C. Wong and Manlai You},
  journal={IEEE Transactions on Pattern Analysis and Machine Intelligence},
  year={1985},
  volume={PAMI-7},
  pages={599-609}
}
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… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 130 extracted citations

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Modeling systems as multilevel hierarchical relational structures

  • L. Goldfarb
  • Large Engineering Systems
  • 1978

Similar Papers

Loading similar papers…