Learning Topology with the Generative Gaussian Graph and the EM Algorithm
Abstract
Given a set of points and a set of prototypes representing them, how to create a graph of the prototypes whose topology accounts for that of the points? This problem had not yet been explored in the framework of statistical learning theory. In this work, we propose a generative model based on the Delaunay graph of the prototypes and the ExpectationMaximization algorithm to learn the parameters. This work is a first step towards the construction of a topological model of a set of points grounded on statistics.
Cite
Text
Aupetit. "Learning Topology with the Generative Gaussian Graph and the EM Algorithm." Neural Information Processing Systems, 2005.Markdown
[Aupetit. "Learning Topology with the Generative Gaussian Graph and the EM Algorithm." Neural Information Processing Systems, 2005.](https://mlanthology.org/neurips/2005/aupetit2005neurips-learning/)BibTeX
@inproceedings{aupetit2005neurips-learning,
title = {{Learning Topology with the Generative Gaussian Graph and the EM Algorithm}},
author = {Aupetit, Michaël},
booktitle = {Neural Information Processing Systems},
year = {2005},
pages = {83-90},
url = {https://mlanthology.org/neurips/2005/aupetit2005neurips-learning/}
}