Abstract
This paper presents an effective and simple method, termed Global Conformity Pursuit (GCP), for robust manifold learning. Data points lying on a union of low-dimensional non-linear manifolds are expected to be highly conforming. On the other hand, outliers do not typically adhere to low-dimensional structures or otherwise do not exist in large numbers. Hence, they can be identified by their low overall resemblance to the rest of the data. Our kernel-based setting allows us to capture the underlying non-linear structure of the manifold data, while avoiding the construction of local neighborhood regions which typically causes extreme sensitivity to noise and outliers. Aside from its significantly simple structure – involving only a matrix evaluation and multiplication – GCP is the first manifold learning approach that is simultaneously non-iterative and capable of tolerating a large number of outliers, dependent outliers and noise components. Theoretical analysis guarantees a large gap between conformity values of inliers and outliers. Experimental results showcase potential uses of the proposed framework on benchmark datasets.
Funding Information
  • NSF (CCF-1552497)
  • NSF (1643835, 1161228, 1356233)
  • CSIT TEAm BOG

This publication has 23 references indexed in Scilit: