234 search results - page 11 / 47 » Spectral Clustering with Perturbed Data |
KDD
2004
ACM
14 years 8 months ago
2004
ACM
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
KDD
2012
ACM
11 years 10 months ago
2012
ACM
Spectral clustering is a widely used method for organizing data that only relies on pairwise similarity measurements. This makes its application to non-vectorial data straightforw...
ICIP
2009
IEEE
14 years 8 months ago
2009
IEEE
An unsupervised seabed segmentation algorithm for synthetic aperture sonar (SAS) imagery is proposed. Each 2 m ? 2 m area of seabed is treated as a unique data point. A set of fea...
ACL
2006
13 years 9 months ago
2006
This paper presents an unsupervised learning approach to disambiguate various relations between name entities by use of various lexical and syntactic features from the contexts. I...
ICPR
2008
IEEE
14 years 8 months ago
2008
IEEE
Many existing spectral clustering algorithms share a conventional graph partitioning criterion: normalized cuts (NC). However, one problem with NC is that it poorly captures the g...