Multi-Metric Induced Robust Graph

Abstract

Graph-based learning model has a wide range of applications in machine learning and computer vision. The key issue of the graph-based applications is to construct an informative graph to effectively represent data correlations. In practice, real-world data is usually contaminated by complex noise beyond Gaussian noise and sparse noise, which degrades learning performance dramatically. To construct a robust graph that represents real-world data distribution well, we propose a novel graph construction method. The proposed method is designed to be robust to complex noise beyond sparse or Gaussian noise by combining different previously given metrics of measuring data errors, which robustly and correctly generates a set of edges. To demonstrate the superiority of the proposed method, we employed the clustering and classification tasks on the real-world datasets. The experimental results demonstrate that the proposed method is superior to the existing methods in both accuracy and robustness to complex noise.