Sciweavers

348 search results - page 28 / 70
» A Tutorial on Spectral Clustering
Sort
View
ICML
2005
IEEE
14 years 8 months ago
Clustering through ranking on manifolds
Clustering aims to find useful hidden structures in data. In this paper we present a new clustering algorithm that builds upon the consistency method (Zhou, et.al., 2003), a semi-...
Markus Breitenbach, Gregory Z. Grudic
NIPS
2003
13 years 8 months ago
Pairwise Clustering and Graphical Models
Significant progress in clustering has been achieved by algorithms that are based on pairwise affinities between the datapoints. In particular, spectral clustering methods have ...
Noam Shental, Assaf Zomet, Tomer Hertz, Yair Weiss
KDD
2004
ACM
136views Data Mining» more  KDD 2004»
14 years 7 months ago
Exploring the community structure of newsgroups
d Abstract] Christian Borgs Jennifer Chayes Mohammad Mahdian Amin Saberi We propose to use the community structure of Usenet for organizing and retrieving the information stored i...
Christian Borgs, Jennifer T. Chayes, Mohammad Mahd...
ICCV
2005
IEEE
14 years 1 months ago
A Unifying Approach to Hard and Probabilistic Clustering
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...
Ron Zass, Amnon Shashua
IGARSS
2010
13 years 5 months ago
Spatial preprocessing for endmember extraction using unsupervised clustering and orthogonal subspace projection concepts
In this paper, we develop a new spatial preprocessing strategy which can be applied prior to a spectral-based endmember extraction process for unmixing of hyperspectral data. Our ...
Gabriel Martin, Antonio J. Plaza