.png){kind=icon}
Return
Robust path-based spectral clustering
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2007.04.010.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
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
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
No organization information available
Cited Papers
Tinnitus Retraining Therapy (TRT) as a Method for Treatment of Tinnitus and Hyperacusis Patients
.png){kind=icon}
PREAI
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSaveBoosting-Based Frameworks in Financial Modeling: Application to Symbolic Volatility Forecasting
PREAI
ShareSaveShareSave
View more