256 search results - page 6 / 52 » Sparse random graphs with clustering |
CPC
2010
13 years 4 months ago
2010
SDM
2007
SIAM
13 years 9 months ago
2007
SIAM
We propose the use of random projections with a sparse matrix to maintain a sketch of a collection of high-dimensional data-streams that are updated asynchronously. This sketch al...
ICCS
2004
Springer
14 years 26 days ago
2004
Springer
This paper gives a theoretical framework for clustering a set of conceptual graphs characterized by sparse descriptions. The formed clusters are named in an intelligible manner thr...
COLT
2004
Springer
14 years 26 days ago
2004
Springer
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...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...