2720 search results - page 1 / 544 » Parallel Pairwise Clustering. |
SDM
2009
SIAM
14 years 2 months ago
2009
SIAM
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...
BIBE
2008
IEEE
13 years 11 months ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
AINA
2004
IEEE
13 years 9 months ago
2004
IEEE
Efficient computing the PageRank scores for a large web graph is actually one of the hot issues in Web-IR community. Recent researches propose to accelerate the computation, both ...
ICPR
2006
IEEE
14 years 6 months ago
2006
IEEE
Each clustering algorithm induces a similarity between given data points, according to the underlying clustering criteria. Given the large number of available clustering technique...
KDD
2007
ACM
14 years 5 months ago
2007
ACM
Data clustering is an important task in many disciplines. A large number of studies have attempted to improve clustering by using the side information that is often encoded as pai...