112 search results - page 4 / 23 » Spectral Clustering for a Large Data Set by Reducing the Sim... |
KDD
2007
ACM
14 years 6 months ago
2007
ACM
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
EMNLP
2009
13 years 4 months ago
2009
Computing the pairwise semantic similarity between all words on the Web is a computationally challenging task. Parallelization and optimizations are necessary. We propose a highly...
CVPR
2009
IEEE
15 years 1 months ago
2009
IEEE
We propose a novel framework for constrained spectral
clustering with pairwise constraints which specify whether
two objects belong to the same cluster or not. Unlike previous
m...
BMCBI
2010
13 years 3 months ago
2010
Background: We propose a sequence clustering algorithm and compare the partition quality and execution time of the proposed algorithm with those of a popular existing algorithm. T...
PLDI
1995
ACM
13 years 9 months ago
1995
ACM
When dense matrix computations are too large to fit in cache, previous research proposes tiling to reduce or eliminate capacity misses. This paper presents a new algorithm for ch...