Sciweavers

115 search results - page 2 / 23
» Fast approximate spectral clustering
Sort
View
BMCBI
2010
136views more  BMCBI 2010»
13 years 4 months ago
SCPS: a fast implementation of a spectral method for detecting protein families on a genome-wide scale
Background: An important problem in genomics is the automatic inference of groups of homologous proteins from pairwise sequence similarities. Several approaches have been proposed...
Tamás Nepusz, Rajkumar Sasidharan, Alberto ...
CVPR
2006
IEEE
14 years 6 months ago
Graph Partitioning by Spectral Rounding: Applications in Image Segmentation and Clustering
ct We introduce a new family of spectral partitioning methods. Edge separators of a graph are produced by iteratively reweighting the edges until the graph disconnects into the pre...
David Tolliver, Gary L. Miller
NIPS
2004
13 years 6 months ago
Hierarchical Eigensolver for Transition Matrices in Spectral Methods
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
Chakra Chennubhotla, Allan D. Jepson
IJCNN
2006
IEEE
13 years 10 months ago
Information Theoretic Angle-Based Spectral Clustering: A Theoretical Analysis and an Algorithm
— Recent work has revealed a close connection between certain information theoretic divergence measures and properties of Mercer kernel feature spaces. Specifically, it has been...
Robert Jenssen, Deniz Erdogmus, Jose C. Principe
CORR
2008
Springer
143views Education» more  CORR 2008»
13 years 4 months ago
Locally computable approximations for spectral clustering and absorption times of random walks
We address the problem of determining a natural local neighbourhood or "cluster" associated to a given seed vertex in an undirected graph. We formulate the task in terms...
Pekka Orponen, Satu Elisa Schaeffer, Vanesa Avalos...