Recent advances in nonlinear dimensionality reduction, manifold and topological learning

Proceedings of the 18th European Symposium on Artificial Neural Networks - Computational Intelligence and Machine Learning, ESANN 2010

Volumn , Issue , 2010, Pages 71-80

  Wismüller, Axel ^a   Verleysen, Michel ^b   Aupetit, Michael ^c   Lee, John A ^b  

^a UNIVERSITY OF ROCHESTER   (United States)

^b UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^c CEA DIF   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC APPROACH; DIGITAL DATABASE; DIMENSIONALITY REDUCTION; MANIFOLD LEARNING; NONLINEAR DIMENSIONALITY REDUCTION; QUALITY ASSESSMENT; QUANTITIVE; REAL-WORLD;

LEARNING SYSTEMS; NEURAL NETWORKS;

TOPOLOGY;

EID: 84865697984     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (78)

1. K. Pearson. On lines and planes of closest fit to systems of points in space. Philosophical Magazine, 2:559-572, 1901.
2. H. Hotelling. Analysis of a complex of statistical variables into principal components. Journal of Educational Psychology, 24:417-441, 1933.
3. I.T. Jolliffe. Principal Component Analysis. Springer-Verlag, New York, NY, 1986.
4. G. Young and A.S. Householder. Discussion of a set of points in terms of their mutual distances. Psychometrika, 3:19-22, 1938.
5. T.F. Cox and M.A.A. Cox. Multidimensional Scaling. Chapman & Hall, London, 1995.
6. I. Borg and P. Groenen. Modern Multidimensional Scaling: Theory and Applications. Springer-Verlag, New York, 1997.
7. J.W. Sammon. A nonlinear mapping algorithm for data structure analysis. IEEE Transactions on Computers, CC-18(5):401-409, 1969.
8. P. Demartines and J. Héerault. Curvilinear component analysis: A self-organizing neural network for nonlinear mapping of data sets. IEEE Transactions on Neural Networks, 8(1):148-154, January 1997.
9. J. Venna and S. Kaski. Neighborhood preservation in nonlinear projection methods: An experimental study. In ICANN, pages 485-491, 2001.
10. J.A. Lee and M. Verleysen. Quality assessment of dimensionality reduction: Rank-based criteria. Neurocomputing, 72(7-9):1431-1443, 2009.
11. J. Venna and S. Kaski. Visualizing gene interaction graphs with local multidimensional scaling. In M. Verleysen, editor, Proc. ESANN 2006, 14th European Symposium on Artificial Neural Networks, pages 557-562. d-side, Bruges, Belgium, April 2006.
12. J. Venna and S. Kaski. Local multidimensional scaling. Neural Networks, 19:889-899, 2006.
13. J.B. Tenenbaum, V. de Silva, and J.C. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290(5500):2319-2323, December 2000.
14. M. Bernstein, V. de Silva, J.C. Langford, and J. B. Tenenbaum. Graph approximations to geodesics on embedded manifolds. Technical report, Stanford University, Palo Alto, CA, December 2000.
15. J.A. Lee and M. Verleysen. Curvilinear distance analysis versus isomap. Neurocomputing, 57:49-76, March 2004.
16. M. Belkin and P. Niyogi. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation, 15(6):1373-1396, June 2003.
17. L. Yen, D. Vanvyve, F. Wouters, F. Fouss, M. Verleysen, and M. Saerens. Clustering using a random-walk based distance measure. In M. Verleysen, editor, Proc. ESANN 2005, 13th European Symposium on Artificial Neural Networks, pages 317-324, Bruges, Belgium, April 2005. d-side.
18. K.Q. Weinberger and L.K. Saul. Unsupervised learning of image manifolds by semidefinite programming. International Journal of Computer Vision, 70(1):77-90, 2006.
19. G. Hinton and S.T. Roweis. Stochastic neighbor embedding. In S. Becker, S. Thrun, and K. Obermayer, editors, Advances in Neural Information Processing Systems (NIPS 2002), volume 15, pages 833-840. MIT Press, 2003.
20. L. van der Maaten and G. Hinton. Visualizing data using t-SNE. Journal of Machine Learning Research, 9:2579-2605, 2008.
21. J. Venna, J. Peltonen, K. Nybo, H. Aidos, and S. Kaski. Information retrieval perspective to nonlinear dimensionality reduction for data visualization. Journal of Machine Learning Research: Workshop and Conference Proceedings, 11:(to appear), 2010.
22. J.A. Lee and M. Verleysen. Nonlinear Dimensionality Reduction. Springer, New York, 2007.
23. G. Haro, G. Randall, and G. Sapiro. Stratification learning: Detecting mixed density and dimensionality in high dimensional point clouds. In Proc. NIPS, 2007.
24. A. Wismüller. The exploration machine - a novel method for data visualization. In Lecture Notes in Computer Science. Advances in Self-Organizing Maps, pages 344-352, 2009.
25. V. de Silva and G. Carlsson. Topological estimation using witness complexes. In Eurographics Symposium on Point-Based Graphics, ETH, Zürich, Switzerland, June 2-4, 2004.
26. A. Collins, A. Zomorodian, G. Carlsson, and L. Guibas. A barcode shape descriptor for curve point cloud data. In Eurographics Symposium on Point-Based Graphics, ETH, Zürich, Switzerland, June 2-4, 2004.
27. M. Zeller, R. Sharma, and K. Schulten. Topology representing network for sensor-based robot motion planning. In Proc. WCNN. INNS Press.
28. M. Belkin, P. Niyogi, and V. Sindhwani. Manifold regularization: a geometric framework for learning from labeled and unlabeled examples. Journal of Machine Learning Research, 7:2399-2434, 2006.
29. O. Chapelle, B. Schölkopf, and A. Zien. Semi-Supervised Learning. MIT Press, Cambridge, MA, 2006.
30. R. Tibshirani. Principal curves revisited. Statistics and Computing, 2:183-190, 1992.
31. D. Laney, P.T. Bremer, A. Mascarenhas, P. Miller, and V. Pascucci. Understanding the structure of the turbulent mixing layer in hydrodynamic instabilities. IEEE Trans. on Vis. and Comp. Graph., 12(5):1053-1060, 2006.
32. M. Vlachos, C. Domeniconi, D. Gunopulos, G. Kollios, and N. Koudas. Nonlinear dimensionality reduction techniques for classification and visualization. In Proc. KDD, 2002.
33. A. Argyriou, M. Herbster, and M. Pontil. Combining graph laplacians for semi-supervised learning. In Proc. NIPS, 2005.
34. M. Belkin and P. Niyogi. Laplacian eigenmaps and spectral techniques for embedding and clustering. In Proc. NIPS, 2002.
35. U. von Luxburg. A tutorial on spectral clustering. Statistics and Computing, 17(4):395-416, 2007.
36. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8):888-905, 2000.
37. A. Ng, M. Jordan, and Y. Weiss. On spectral clustering: analysis and an anlgorithm. In Proc. NIPS, 2002.
38. M. Hein and M. Maier. Manifold denoising. Advances in Neural Information Processing Systems, 19, 2007.
39. N. Amenta and M. Bern. Surface reconstruction by Voronoi filtering. Discrete and Computational Geometry, 22(4):481-504, 1999.
40. H. Edelsbrunner and N.R. Shah. Triangulating topological spaces. Int. Journal on Computational Geometry and Applications, 7:365-378, 1997.
41. H. Edelsbrunner, J. Harer, V. Natarajan, and V. Pascucci. Morse-smale complexes for piecewise linear 3-manifolds. In Eurographics Symposium on Point-Based Graphics, Proc. 19th Ann. Symp. Comp. Geom. (SOCG), 2003.
42. F. Chazal, D. Cohen-Steiner, and A. Lieutier. A sampling theory for compact sets in euclidean spaces. Discrete and Computational Geometry, 41(3):461-479, 2007.
43. P. Niyogi, S. Smale, and S. Weinberger. Finding the homology of submanifolds with high confidence from random samples. Discrete and Computational Geometry, 39(1-3):419-441, 2006.
44. H. Edelsbrunner, D. Letscher, and A. Zomorodian. Topological persistence and simplification. In IEEE Symp. on Found. of Comp. Sci., pages 454-463, 2000.
45. F. Chazal and A. Lieutier. Topology guaranteeing manifold reconstruction using distance function to noisy data. In Proc. Symp. on Computational Geometry, 2006.
46. J.D. Boissonnat, L. Guibas, and S. Oudot. Manifold reconstruction in arbitrary dimensions using witness complexes. In Proc. Symp. on Computational Geometry, pages 194-203, 2007.
47. J.D. Boissonnat, F. Nielsen, and R. Nock. On Bregman Voronoi diagrams. In Proc. 18th ACM-SIAM Symp. on Discrete Algorithms, 2007.
48. M. Aupetit. Learning topology with the generative gaussian graph and the em algorithm. In Proc. of NIPS, 2005.
49. T. Kohonen. The self-organizing map. Proc. IEEE, 78(9):1464-1480, 1990.
50. T. Villmann, R. Der, M. Herrmann, and T. Martinetz. Topology preservation in self-organizing feature maps: Exact definition and measurement. IEEE Transactions on Neural Networks, 8(2):256-266, 1997.
51. H.-U. Bauer and K.R. Pawelzik. Quantifying the neighborhood preservation of Self-Organizing Feature Maps. IEEE Trans. on Neural Networks, 3(4):570-579, 1992.
52. H. U. Bauer, R. Der, and M. Herrmann. Controlling the magnification factor of self-organizing feature maps. Neural Computation, 8(4):757-71, 1996.
53. J. Sinkkonen and S. Kaski. Clustering based on conditional distributions in an auxiliary space. Neural Computation, 14:217-239, 2002.
54. J. Lampinen and T. Kostiainen. Generative probability density model in the self-organizing map. In U. Seiffert and L.C. Jain, editors, Self-Organizing Neural Networks, Studies in Fuzzi-ness and Soft Computing, pages 75-92. Physica-Verlag, Heidelberg, New York, 2001.
55. M. Van Hulle. Faithful Representations and Topographic Maps. Wiley Series and Adaptive Learning Systems for Signal Processing, Communications, and Control. Wiley & Sons, New York, 2000.
56. J.A. Lee, C. Archambeau, and M. Verleysen. Locally linear embedding versus Isotop. In Proc. of the 11th Europ. Symp. on Art. Neur. Netw. (ESANN), pages 527-534, Bruges, Belgium, 2003. d-side publishers.
57. A. Wismüller, F. Vietze, D.R. Dersch, J. Behrends, K. Hahn, and H. Ritter. The deformable feature map - a novel neurocomputing algorithm for adaptive plasticity in pattern analysis. Neurocomputing, 48:107-139, 2002.
58. A. Wismüller, F. Vietze, J. Behrends, A. Meyer-Baese, M.F. Reiser, and H. Ritter. Fullyautomated biomedical image segmentation by self-organized model adaptation. Neural Networks, 17:1327-1344, 2004.
59. T. Kohonen. Self-Organizing Maps. Springer, 3rd edition, 2001.
60. A. Wismüller. Exploratory Morphogenesis (XOM): A Novel Computational Framework for Self-Organization. Ph.D. thesis, Technical University of Munich, Department of Electrical and Computer Engineering, 2006.
61. A. Wismüller. A computational framework for nonlinear dimensionality reduction and clustering. In Lecture Notes in Computer Science. Advances in Self-Organizing Maps, pages 334-343, 2009.
62. A. Wismüller. Exploration-organized morphogenesis (XOM) - a general framework for learning by self-organization. In Human and Machine Perception. Research Reports of the Institute for Phonetics and Speech Communication (FIPKM), volume 37, pages 205-239. University of Munich, 2001.
63. A. Wismüller. A computational framework for exploratory data analysis. In M. Verleysen, editor, European Symposium on Artificial Neural Networks - Advances in Computational Intelligence and Learning. d-side Publishers, 2009.
64. A. Wismüller. The exploration machine - a novel method for structure-preserving dimensionality reduction. In M. Verleysen, editor, European Symposium on Artificial Neural Networks - Advances in Computational Intelligence and Learning. d-side Publishers, 2009.
65. A. Wismüller. The exploration machine: a novel method for analyzing high-dimensional data in computer-aided diagnosis. In N. Karssemeijer and M. Giger, editors, Medical Imaging 2009: Computer-Aided Diagnosis. Proc. SPIE, volume 7260, pages 72600G-72600G-7, 2009.
66. K. Bunte, B. Hammer, A. Wismüller, and M. Biehl. Adaptive local dissimilarity measures for discriminative dimension reduction of labeled data. Neurocomputing, In Press:-, 2010.
67. K. Bunte, B. Hammer, T. Villmann, M. Biehl, and A. Wismüller. Exploratory Observation Machine (XOM) with Kullback-Leibler divergence for dimensionality reduction and visualization In Proc. of the 18th Europ. Symp. on ArtNeur. Netw. (ESANN), Bruges, Belgium, 2010. d-side publishers.
68. G. Hinton and S. Roweis. Stochastic neighbor embedding. In Advances in Neural Information Processing Systems, volume 15. MIT Press, 2003.
69. M. Aupetit. Visualizing distortions and recovering topology in continuous projection techniques. Neurocomputing, 70(7-9):1304-1330, 2007.
70. S. Lespinats, M. Verleysen, A. Giron, and B. Fertil. DD-HDS: A method for visualization and exploration of high-dimensional data. IEEE Transactions on Neural Networks, 18(5):1265-1279, 2007.
71. J. Vesanto. SOM-based data visualization methods. Intelligent Data Analysis, 3(2):111-126, 1999.
72. H.P. Siemon and A. Ultsch. Kohonen networks on transputers: Implementation and animation. In International Neural Networks, pages 643-646. Kluwer Academic Press, Paris, 1990.
73. S. Kaski, J. Venna, and T. Kohonen. Coloring that reveals cluster structures in multivariate data. Australian Journal of Intelligent Information Processing,Systems, 6:82-88, 2000.
74. P. Rousset and C. Guinot. Distance between kohonen classes, visualization tool to use som in data set analysis and representation. In J. Mira and A. Prieto, editors, Proc. Intl. Workshop on Artificial Neural Networks (IWANN'01), LNCS 2085, pages 119-126. Springer-Verlag, 2001.
75. G. Pölzlbauer, A. Rauber, and M. Dittenbach. Graph projection techniques for self-organizing maps. In Michel Verleysen, editor, Proc. European Symposium on Artificial Neural Networks (ESANN'05), pages 533-538, Bruges, Belgium, April 27-29 2005. d-side publications.
76. K. Tasdemir and E. Merényi. Exploiting data topology in visualization and clustering of selforganizing maps. IEEE Trans. on Neural Networks, 20(4):549-562, 2009.
77. Th. Martinetz and K. Schulten. Topology representing networks. Neural Networks, 7(3):507-522, 1994.
78. P. Gaillard, M. Aupetit, and G. Govaert. Learning topology of a labeled data set with the supervised generative gaussian graph. Neurocomputing, 71(7-9):1283-1299, 2008.