Banks, D.
(1998),
Maximum Entropy Methods for Graph-Valued Random Objects, Computing Science and Statistics
(Accessed May 18, 2024)
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
Maximum Entropy Methods for Graph-Valued Random Objects
Published
Author(s)
Abstract
Many problems entail the analysis of data that are independent and identically distributed random objects, such as graphs, sequences, partitions, and permutations. Additionally, the analysis can be further complicated by the presence of equivalence clases among the objects induced by the operation of some group. Useful inference requires flexible probability models for such situations; these models should have interpretable location and scale parameters, and support the establishment of confidence regions, maximum likelihood estimates, goodness-of-fit tests, and an appropriate analouge of linear model theory. Banks and Carley (1994) and Banks and Constantine (1998) develop a simple probability model and sketch some analyses; this research extends that work so that analysts are able to choose models that reflect more application-specific metrics on the set of objects. The procedure is illustrated through the analysis of data that are cluster trees.Citation
Computing Science and Statistics
Volume
30
Pub Type
Journals
Keywords
group therapy, metrics, random graphs, trees
Citation
Issues
If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.
Created September 30, 1998, Updated February 17, 2017