5659 search results - page 330 / 1132 » Comparing Clusterings in Space |
238
click to vote
COMPGEOM
2011
ACM
14 years 9 months ago
2011
ACM
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
239
click to vote
CANPC
2000
Springer
15 years 10 months ago
2000
Springer
Improvements in microprocessor and networking performance have made networks of workstations a very attractive platform for high-end parallel and distributed computing. However, t...
219
click to vote
COMGEO
2004
ACM
15 years 6 months ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
213
click to vote
ICDM
2010
IEEE
15 years 4 months ago
2010
IEEE
: D-LDA: A Topic Modeling Approach without Constraint Generation for Semi-Defined Classification Fuzhen Zhuang, Ping Luo, Zhiyong Shen, Qing He, Yuhong Xiong, Zhongzhi Shi HP Labo...
196
click to vote
BIBE
2008
IEEE
16 years 22 days 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...