Robust path-based spectral clustering

doi:10.1016/j.patcog.2007.04.010

Robust path-based spectral clustering

2008-01-01

508

PRE

AI

常虹 (Hong Chang)

D

Dit‐Yan Yeung *

DOI：10.1016/j.patcog.2007.04.010

Original

Original request for help

Save

Abstract

En 中文

Spectral clustering and path-based clustering are two recently developed clustering approaches that have delivered impressive results in a number of challenging clustering tasks. However, they are not robust enough against noise and outliers in the data. In this paper, based on M-estimation from robust statistics, we develop a robust path-based spectral clustering method by defining a robust path-based similarity measure for spectral clustering under both unsupervised and semi-supervised settings. Our proposed method is significantly more robust than spectral clustering and path-based clustering. We have performed experiments based on both synthetic and real-world data, comparing our method with some other methods. In particular, color images from the Berkeley segmentation data set and benchmark are used in the image segmentation experiments. Experimental results show that our method consistently outperforms other methods due to its higher robustness. (C) 2007 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.

Keywords:

path-based clustering

spectral clustering

robust statistics

unsupervised learning

semi-supervised learning

image segmentation

Robust path-based spectral clustering

Abstract

AI Summary

Journal

Organization