1105 search results - page 47 / 221 » Approximate Spectral Clustering. |
PAKDD
2011
ACM
13 years 25 days ago
2011
ACM
Abstract. Given a graph with billions of nodes and edges, how can we find patterns and anomalies? Are there nodes that participate in too many or too few triangles? Are there clos...
COCOON
2010
Springer
14 years 2 months ago
2010
Springer
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...
ICDE
2008
IEEE
14 years 11 months ago
2008
IEEE
Subspace clustering has attracted great attention due to its capability of finding salient patterns in high dimensional data. Order preserving subspace clusters have been proven to...
EUSFLAT
2009
13 years 7 months ago
2009
-- An approach to estimate the number of rules by spectral analysis of the training dataset has been recently proposed [1]. This work presents an analysis of such a method in high ...
DIS
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. Clustering algorithms based on a matrix of pairwise similarities (kernel matrix) for the data are widely known and used, a particularly popular class being spectral clust...