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 language | English |
---|---|
Pages (from-to) | 1283-1299 |
Number of pages | 17 |
Journal | Neurocomputing |
Volume | 71 |
Issue number | 7-9 |
DOIs | |
Publication status | Published - Mar 2008 |
Externally published | Yes |
Keywords
- Delaunay graph
- EM algorithm
- Gabriel graph
- Mixture models
- Supervised topology learning
- Topology representing graph