The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - Feb. (2013 vol.25)
pp: 337-347
Deyu Meng , Xi'an Jiaotong University, Xi'an
Yee Leung , The Chinese University of Hong Kong, Hong Kong
Zongben Xu , Xi'an Jiaotong University, Xi'an
ABSTRACT
Detecting intrinsic loop structures of a data manifold is the necessary prestep for the proper employment of the manifold learning techniques and of fundamental importance in the discovery of the essential representational features underlying the data lying on the loopy manifold. An effective strategy is proposed to solve this problem in this study. In line with our intuition, a formal definition of a loop residing on a manifold is first given. Based on this definition, theoretical properties of loopy manifolds are rigorously derived. In particular, a necessary and sufficient condition for detecting essential loops of a manifold is derived. An effective algorithm for loop detection is then constructed. The soundness of the proposed theory and algorithm is validated by a series of experiments performed on synthetic and real-life data sets. In each of the experiments, the essential loops underlying the data manifold can be properly detected, and the intrinsic representational features of the data manifold can be revealed along the loop structure so detected. Particularly, some of these features can hardly be discovered by the conventional manifold learning methods.
INDEX TERMS
Manifolds, Learning systems, Feature extraction, Mathematical analysis, Logic gates, Gene expression, Laplace equations, nonlinear dimensionality reduction, Isometric feature mapping, loop structure, manifold learning
CITATION
Deyu Meng, Yee Leung, Zongben Xu, "Detecting Intrinsic Loops Underlying Data Manifold", IEEE Transactions on Knowledge & Data Engineering, vol.25, no. 2, pp. 337-347, Feb. 2013, doi:10.1109/TKDE.2011.191
REFERENCES
[1] J.B. Tenenbaum, V. de Silva, and J.C. Langford, "A Global Geometric Framework for Nonlinear Dimensionality Reduction," Science, vol. 290, pp. 2319-2323, 2000.
[2] S.T. Roweis and L.K. Saul, "Nonlinear Dimensionality Reduction by Locally Linear Embedding," Science, vol. 290, pp. 2323-2326, 2000.
[3] M. Belkin and P. Niyogi, "Laplacian Eigenmaps for Dimensionality Reduction and Data Representation," Neural Computation, vol. 15, pp. 1373-1396, 2003.
[4] J.A. Lee, A. Lendasse, and M. Verleysen, "Nonlinear Projection with Curvilinear Distances: Isomap versus Curvilinear Distance Analysis," Neurocomputing, vol. 57, pp. 49-76, 2004.
[5] K.Q. Weinberger and L.K. Saul, "Unsupervised Learning of Image Manifolds by Semidefinite Programming," Int'l J. Computer Vision, vol. 70, pp. 77-90, 2006.
[6] D.Y. Meng, Y. Leung, T. Fung, and Z.B. Xu, "Nonlinear Dimensionality Reduction of Data Lying on the Multi-Cluster Manifold," IEEE Trans. Systems, Man and Cybernetics, Part B, vol. 38, no. 4, pp. 1111-1122, Aug. 2008.
[7] D.Y. Meng, Y. Leung, Z.B. Xu, T. Fung, and Q.F. Zhang, "Improving Geodesic Distance Estimation Based on Locally Linear Assumption," Pattern Recognition Letters, vol. 29, pp. 862-870, 2008.
[8] D.Y. Meng, Y. Leung, and Z.B. Xu, "A New Quality Assessment Criterion for Nonlinear Dimensionality Reduction Neurocomputing," Neurocomputing, vol. 74, pp. 941-948, 2011.
[9] Z.Y. Zhang and H.Y. Zha, "Principal Manifolds and Nonlinear Dimension Reduction via Local Tangent Space Alignment," Technical Report CSE-02-019, CSE, Penn State Univ., 2002.
[10] D.K. Agrafiotis and H. Xu, "A Self-Organizing Principle for Learning Nonlinear Manifolds," Proc. Nat'l Academy of Sciences USA, vol. 99, pp. 15869-15872, 2002.
[11] R. Pless and I. Simon, "Embedding Images in Non-Flat Spaces," Technical Report WU-CS-01-43, Washington Univ., Dec. 2001.
[12] L.K. Saul and S.T. Roweis, "Think Globally, Fit Locally: Unsupervised Learning of Nonlinear Manifolds," J. Machine learning Research, vol. 4, pp. 119-155, 2003.
[13] A. Hadid and M. Pietikinen, "Efficient Locally Linear Embeddings of Imperfect Manifolds," Proc. Third Int'l Conf. Machine Learning and Data Mining in Pattern Recognition, vol. 5-7, pp. 188-201, 2003.
[14] Z. Han, D.Y. Meng, Z.B. Xu, and N.N. Gu, "Incremental Alignment Manifold Learning," J. Computer Science and Technology, vol. 26, pp. 153-165, 2011.
[15] A. Brun, C.F. Westin, M. Herberthson, and H. Knutsson, "Fast Manifold Learning Based on Riemannian Normal Coordinates," Proc. 14th Scandinavian Conf. Image Analysis (SCIA '05), 2005.
[16] J. Venna and S. Kaski, "Local Multidimensional Scaling," Neural Networks, vol. 19, pp. 889-899, 2006.
[17] T. Lin and H. Zha, "Riemannian Manifold Learning," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 30, no. 5, pp. 796-809, May 2008.
[18] M. Dixon, N. Jacobs, and R. Pless, "Finding Minimal Parameterizations of Cylindrical Image Manifolds," Proc. Conf. Computer Vision and Pattern Recognition Workshop, 2006.
[19] J. Lee and M. Verleysen, "How to Project Circular Manifolds Using Geodesic Distances?" Proc. European Symp. Artificial Neural Networks, pp. 223-230, 2004.
[20] J. Lee and M. Verleysen, "Nonlinear Dimensionality Reduction of Data Manifolds with Essential Loops," Neurocomputing, vol. 67, pp. 29-53, 2005.
[21] J. Munkres, Analysis on Manifold. Addison Wesley, 1990.
[22] M. Zorn, "Derivatives and Frechet Differentials," Bull. Am. Math. Soc., vol. 52, pp. 133-137, 1946.
[23] D.L. Donoho and C.E. Grimes, "When Does Isomap Recover the Natural Parameterization of Families of Articulated Images?" Technical Report 2002-27, Dept. of Statistics, Stanford Univ., Aug. 2002.
[24] D.L. Donoho and C.E. Grimes, "Hessian Eigenmaps: Locally Linear Embedding Techniques for High Dimensional Data," Proc. Nat'l Academy of Arts and Sciences, vol. 100, pp. 5591-5596, 2003.
[25] H. Zha and Z. Zhang, "Isometric Embedding and Continuum Isomap," Proc. 20th Int'l Conf. Machine Learning, pp. 864-871, 2003.
[26] M. Bernstein, V. de Silva, J.C. Langford, and J.B. Tenenbaum, "Graph Approximations to Geodesics on Embedded Manifolds," technical report, Stanford Univ., 2000.
[27] A.M. Tom, Mathematical Analysis. Addison-Wesley, 1974.
[28] L.A. Sidorov, "Riemannian Metric," Encyclopaedia of Mathematics, Kluwer Academic Publishers, 2001.
[29] K. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft, "When Is Nearest Neighbor Meaningful?" Proc. Seventh Int'l Conf. Database Theory, pp. 217-235, 1999.
[30] V. de Silva and J.B. Tenenbaum, "Sparse Multidimensional Scaling Using Landmark Points," technical report, Stanford Univ., 2004.
[31] M. Balasubramanian, E.L. Schwartz, J.B. Tenenbaum, V. de Silva, and J.C. Langford, "The Isomap Algorithm and Topological Stability," Science, vol. 295, p. 7, 2002.
[32] J. Wang, Z. Zhang, and H. Zha, "Adaptive Manifold Learning," Proc. Advances in Neural Information Processing Systems, vol. 17, pp. 1473-1480, 2005.
26 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool