1105 search results - page 109 / 221 » Approximate Spectral Clustering. |
164
click to vote
CIKM
2010
Springer
15 years 3 months ago
2010
Springer
In Latent Semantic Indexing (LSI), a collection of documents is often pre-processed to form a sparse term-document matrix, followed by a computation of a low-rank approximation to...
128
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We generalize the k-means algorithm presented by the authors [14] and show that the resulting algorithm can solve a larger class of clustering problems that satisfy certa...
138
click to vote
GECCO
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. In many real-world applications of evolutionary computation, it is essential to reduce the number of fitness evaluations. To this end, computationally efficient models c...
160
click to vote
KDD
2004
ACM
15 years 9 months ago
2004
ACM
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
133
click to vote
SDM
2010
SIAM
15 years 6 months ago
2010
SIAM
In recent years, matrix approximation for missing value prediction has emerged as an important problem in a variety of domains such as recommendation systems, e-commerce and onlin...