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

Neurocomputing

Volumn 71, Issue 7-9, 2008, Pages 1283-1299

  Gaillard, Pierre ^a   Aupetit, Michaël ^a   Govaert, Gérard ^b  

^a DIF   (France)

^b UNIVERSITÉ DE TECHNOLOGIE DE COMPIÈGNE   (France)

Author keywords

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

Indexed keywords

COMPUTER SIMULATION; DATABASE SYSTEMS; GRAPH THEORY; SUPERVISED LEARNING;

GAUSSIAN GRAPH; SUPERVISED TOPOLOGY LEARNING;

DATA PROCESSING;

ARTICLE; COMPUTER GRAPHICS; CORRELATION ANALYSIS; DATA ANALYSIS; FACTUAL DATABASE; LEARNING ALGORITHM; NORMAL DISTRIBUTION; PRIORITY JOURNAL; PROCESS OPTIMIZATION; STATISTICAL MODEL;

EID: 40649110460     PISSN: 09252312     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.neucom.2007.12.028     Document Type: Article

References (36)

1. E. Agrell, A method for examining vector quantizer structures, in: Proceedings of IEEE International Symposium on Information Theory, 1993, p. 394.
2. Aupetit M. Robust topology representing networks. Proceedings of the European Symposium on Artificial Neural Networks (2003), d-side, Bruges, Belgium
3. Aupetit M. Learning topology with the generative Gaussian graph and the em algorithm. In: Weiss Y., Schölkopf B., and Platt J. (Eds). Advances in Neural Information Processing Systems vol. 18 (2006), MIT Press, Cambridge, MA 83-90
4. Aupetit M. Visualizing distortions and recovering topology in continuous projection techniques. Neurocomputing 70 (2007) 1304-1330
5. Aupetit M., and Catz T. High-dimensional labeled data analysis with topology representing graphs. Neurocomputing 63 (2005) 139-169
6. Barber C., Dobkin D., and Huhdanpaa H. The quickhull algorithm for convex hulls. ACM Trans. Math. Software 22 (1996) 469-483
7. Belkin M., Niyogi P., and Sindhwani V. Manifold regularization: a geometric framework for learning from examples. J. Mach. Learn. Res. 7 (2006) 2399-2434
8. Bishop C., Svensén M., and Williams C. Developments of the generative topographic mapping. Neurocomputing 21 (1998) 203-224
9. Bouchard G., and Celeux G. Selection of generative models in classification. IEEE Trans. Pattern Anal. Mach. Intell. 28 (2006) 544-554
10. Boyles R. On the convergence of the EM algorithm. J. R. Stat. Soc. Ser. B 45 (1983) 47-50
11. Cattell R. The scree test for the number of factors. Multivar. Behav. Res. 1 (1966) 245-276
12. M.C. Ferreira de Oliveira, H. Levkowitz, From visual data exploration to visual data mining: a survey, IEEE Trans. Visualization Comput. Graphics 9 (2003) 378-394.
13. de Silva V., and Carlsson G. Topological estimation using witness complexes. In: Alexa M., and Rusinkiewicz S. (Eds). Eurographics Symposium on Point-Based Graphics (2004) 157-166
14. de Silva V., and Tenenbaum J.B. Global versus local methods in nonlinear dimensionality reduction. In: Becker S.T.S., and Obermayer K. (Eds). Advances in Neural Information Processing Systems vol. 15 (2003), MIT Press, Cambridge, MA 705-712
15. Dempster A., Laird N., and Rubin D. Maximum likelihood from incomplete data via the em algorithm. J. R. Stat. Soc. Ser. B 39 1 (1977) 1-38
16. Dhillon I., Modha D., and Spangler W. Class visualization of high-dimensional data with applications. Comput. Stat. Data Anal. 41 1 (2002) 59-90
17. Duda R., and Hart P. Pattern Classification and Scene Analysis (1973), Wiley, New York
18. Frisone F., Firenze F., Morasso P., and Ricciardiello L. Application of topology representing networks to the estimation of the intrinsic dimensionality of data. Proceedings of the ICANN'95 vol. 1 (1995) 323-327
19. Hastie T., and Tibshirani R. Discriminant analysis by Gaussian mixtures. J. R. Stat. Soc. Ser. B 58 (1996) 158-176
20. Hérault J., Jausions-Picaud C., and Guérin-Dugué A. Curvilinear component analysis: a self-organizing neural network for nonlinear mapping of data sets. IEEE Trans. Neural Networks 8 (1997) 625-634
21. Iwata T., Saito K., and Ueda N. Visual nonlinear discriminant analysis for classifier design. Proceedings of the European Symposium on Artificial Neural Networks (2006), d-side, Bruges, Belgium
22. Keribin C. Consistent estimation of the order of mixture. Sankhya 62 (2000) 49-66
23. Lallich S., Muhlenbach F., and Zighed D. Improving classification by removing or relabeling mislabeled instances. Proceedings of the 13th International Symposium on Foundations of Intelligent Systems (2002), Springer, London, UK
24. Lee J., Lendasse A., and Verleysen M. Curvilinear distance analysis versus isomap. Proceedings of the European Symposium on Artificial Neural Networks (2002), d-side, Bruges, Belgium
25. Martinetz T., and Schulten K. Topology representing networks. Neural Networks 7 (1994) 507-522
26. McLachlan G., and Peel D. Finite Mixture Models (2000), Wiley, New York
27. Melnik O. Decision region connectivity analysis: a method for analyzing high-dimensional classifiers. Mach. Learn. 48 1 (2002) 321-351
28. Miller D., and Uyar S. In: Mozer M., Jordan M., and Petsche T. (Eds). A Mixture of Experts Classifier with Learning Based on Both Labelled and Unlabelled data vol. 9 (1997), MIT Press, Cambridge, MA 571-577
29. Munkres J. Elements of Algebraic Topology (1993), Westview Press, Boulder, CO
30. D. Newman, S. Hettich, C. Blake, C. Merz, UCI repository of machine learning databases, 1998.
31. P. Niyogi, S. Smale, S. Weinberger, Finding the homology of submanifolds with high confidence from random samples, Discrete Comput. Geometry, Online article available at: http://www.springerlink.com/content/g716761480425781.
32. Okabe A., Boots B., and Sugihara K. Spatial Tessellations: Concepts and Applications of Voronoï Diagrams (1992), Wiley, Chichester
33. Roeder K., and Wasserman L. Practical Bayesian density estimation using mixtures of normals. J. Am. Stat. Assoc. 92 439 (1997) 894-902
34. Schwartz G. Estimating the dimension of a model. Ann. Stat. 6 (1978) 461-464
35. Tibshirani R. Principal curves revisited. Stat. Comput. 2 (1992) 183-190
36. Veltkamp R. The gamma-neighborhood graph. Comput. Geometry 1 (1991) 227-246