Learning topology of a labeled data set with the supervised generative Gaussian graph

Pierre Gaillard*, Michaël Aupetit, Gérard Govaert

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

16 Citations (Scopus)

Abstract

Extracting the topology of a set of a labeled data is expected to provide important information in order to analyze the data or to design a better decision system. In this work, we propose to extend the generative Gaussian graph to supervised learning in order to extract the topology of labeled data sets. The graph obtained learns the intra-class and inter-class connectedness and also the manifold-overlapping of the different classes. We propose a way to vizualize these topological features. We apply it to analyze the well-known Iris database and the three-phase pipe flow database.

Original languageEnglish
Pages (from-to)1283-1299
Number of pages17
JournalNeurocomputing
Volume71
Issue number7-9
DOIs
Publication statusPublished - Mar 2008
Externally publishedYes

Keywords

  • Delaunay graph
  • EM algorithm
  • Gabriel graph
  • Mixture models
  • Supervised topology learning
  • Topology representing graph

Fingerprint

Dive into the research topics of 'Learning topology of a labeled data set with the supervised generative Gaussian graph'. Together they form a unique fingerprint.

Cite this