Robust Regularized Locality Preserving Indexing for Fiedler Vector Estimation

by   Aylin Tastan, et al.
Technische Universität Darmstadt

The Fiedler vector of a connected graph is the eigenvector associated with the algebraic connectivity of the graph Laplacian and it provides substantial information to learn the latent structure of a graph. In real-world applications, however, the data may be subject to heavy-tailed noise and outliers which results in deteriorations in the structure of the Fiedler vector estimate. We design a Robust Regularized Locality Preserving Indexing (RRLPI) method for Fiedler vector estimation that aims to approximate the nonlinear manifold structure of the Laplace Beltrami operator while minimizing the negative impact of outliers. First, an analysis of the effects of two fundamental outlier types on the eigen-decomposition for block affinity matrices which are essential in cluster analysis is conducted. Then, an error model is formulated and a robust Fiedler vector estimation algorithm is developed. An unsupervised penalty parameter selection algorithm is proposed that leverages the geometric structure of the projection space to perform robust regularized Fiedler estimation. The performance of RRLPI is benchmarked against existing competitors in terms of detection probability, partitioning quality, image segmentation capability, robustness and computation time using a large variety of synthetic and real data experiments.


page 9

page 10

page 12

page 35

page 39

page 40


SCE: A manifold regularized set-covering method for data partitioning

Cluster analysis plays a very important role in data analysis. In these ...

Real Elliptically Skewed Distributions and Their Application to Robust Cluster Analysis

This article proposes a new class of Real Elliptically Skewed (RESK) dis...

Robust Bayesian Cluster Enumeration

A major challenge in cluster analysis is that the number of data cluster...

Adaptive Locality Preserving Regression

This paper proposes a novel discriminative regression method, called ada...

Error Analysis on Graph Laplacian Regularized Estimator

We provide a theoretical analysis of the representation learning problem...

Regularized Laplacian Estimation and Fast Eigenvector Approximation

Recently, Mahoney and Orecchia demonstrated that popular diffusion-based...

Student's T Robust Bundle Adjustment Algorithm

Bundle adjustment (BA) is the problem of refining a visual reconstructio...

Please sign up or login with your details

Forgot password? Click here to reset