Sciweavers

1385 search results - page 25 / 277
» Clustering by Random Projections
Sort
View
PDP
2006
IEEE
15 years 5 months ago
A Distributed Query Structure to Explore Random Mappings in Parallel
We explore the possibilities to organize a query data structure in the main memories or hard disks of a cluster computer. The query data structure serves to improve the performanc...
Jan Heichler, Jorg Keller
COLT
2004
Springer
15 years 5 months ago
On the Convergence of Spectral Clustering on Random Samples: The Normalized Case
Given a set of n randomly drawn sample points, spectral clustering in its simplest form uses the second eigenvector of the graph Laplacian matrix, constructed on the similarity gra...
Ulrike von Luxburg, Olivier Bousquet, Mikhail Belk...
FSTTCS
2001
Springer
15 years 4 months ago
On Clustering Using Random Walks
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
David Harel, Yehuda Koren
DCC
2009
IEEE
16 years 10 days ago
Compressive-Projection Principal Component Analysis and the First Eigenvector
An analysis is presented that extends existing Rayleigh-Ritz theory to the special case of highly eccentric distributions. Specifically, a bound on the angle between the first Rit...
James E. Fowler
DCC
2008
IEEE
15 years 11 months ago
Compressive-Projection Principal Component Analysis for the Compression of Hyperspectral Signatures
A method is proposed for the compression of hyperspectral signature vectors on severely resourceconstrained encoding platforms. The proposed technique, compressive-projection prin...
James E. Fowler