This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Detecting Intrinsic Loops Underlying Data Manifold
Feb. 2013 (vol. 25 no. 2)
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
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 and Data Engineering, vol. 25, no. 2, pp. 337-347, Feb. 2013, doi:10.1109/TKDE.2011.191
Usage of this product signifies your acceptance of the Terms of Use.