Robust L-Isomap with a Novel Landmark Selection Method

Isomap is a widely used nonlinear method for dimensionality reduction. Landmark-Isomap (L-Isomap) has been proposed to improve the scalability of Isomap. In this paper, we focus on two important issues that were not taken into account in L-Isomap, landmark point selection and topological stability. At first, we present a novel landmark point selection method. It first uses a greedy strategy to select some points as landmark candidates and then removes the candidate points that are neighbours of other candidates. The remaining candidate points are the landmark points. The selection method can promote the computation efficiency without sacrificing accuracy. For the topological stability, we define edge density for each edge in the neighbourhood graph. According to the geometrical characteristic of the short-circuit edges, we provide a method to eliminate the short-circuit edge without breaking the data integrity. The approach that integrates L-Isomap with these two improvements is referred to as Robust L-Isomap (RL-Isomap). The effective performance of RL-Isomap is confirmed through several numerical experiments.

[1]  Chen Qiao,et al.  Enhancing Both Efficiency and Representational Capability of Isomap by Extensive Landmark Selection , 2015 .

[2]  Zhu-Hong You,et al.  Increasing reliability of protein interactome by fast manifold embedding , 2013, Pattern Recognit. Lett..

[3]  Baoqun Yin,et al.  A landmark selection method for L-Isomap based on greedy algorithm and its application , 2015, 2015 54th IEEE Conference on Decision and Control (CDC).

[4]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[5]  J. Tenenbaum,et al.  A global geometric framework for nonlinear dimensionality reduction. , 2000, Science.

[6]  Heeyoul Choi,et al.  Robust kernel Isomap , 2007, Pattern Recognit..

[7]  H. Kile,et al.  Bandwidth Selection in Kernel Density Estimation , 2010 .

[8]  Joshua B. Tenenbaum,et al.  Global Versus Local Methods in Nonlinear Dimensionality Reduction , 2002, NIPS.

[9]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[10]  Joshua B. Tenenbaum,et al.  The Isomap Algorithm and Topological Stability , 2002, Science.

[11]  Michel Verleysen,et al.  Nonlinear dimensionality reduction of data manifolds with essential loops , 2005, Neurocomputing.

[12]  C. D. Kemp,et al.  Density Estimation for Statistics and Data Analysis , 1987 .

[13]  David W. Scott,et al.  The Curse of Dimensionality and Dimension Reduction , 2008 .

[14]  Stephen J. Garland,et al.  Algorithm 97: Shortest path , 1962, Commun. ACM.

[15]  Matthew Roughan,et al.  Internet Traffic Matrices: A Primer , 2013 .

[16]  张振跃,et al.  Principal Manifolds and Nonlinear Dimensionality Reduction via Tangent Space Alignment , 2004 .

[17]  Konstantina Papagiannaki,et al.  Structural analysis of network traffic flows , 2004, SIGMETRICS '04/Performance '04.

[18]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[19]  Ian T. Jolliffe,et al.  Principal Component Analysis , 2002, International Encyclopedia of Statistical Science.

[20]  S T Roweis,et al.  Nonlinear dimensionality reduction by locally linear embedding. , 2000, Science.

[21]  Steve Uhlig,et al.  Providing public intradomain traffic matrices to the research community , 2006, CCRV.

[22]  Baoqun Yin,et al.  A novel landmark point selection method for L-ISOMAP , 2016, 2016 12th IEEE International Conference on Control and Automation (ICCA).

[23]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.