152 search results - page 15 / 31 » Finding Consistent Clusters in Data Partitions |
PODS
2005
ACM
15 years 12 months ago
2005
ACM
We present a divide-and-merge methodology for clustering a set of objects that combines a top-down "divide" phase with a bottom-up "merge" phase. In contrast, ...
111
click to vote
ICDE
2010
IEEE
15 years 5 months ago
2010
IEEE
— Finding decompositions of a graph into a family of clusters is crucial to understanding its underlying structure. While most existing approaches focus on partitioning the nodes...
105
click to vote
ICML
2005
IEEE
16 years 16 days ago
2005
IEEE
Clustering aims to find useful hidden structures in data. In this paper we present a new clustering algorithm that builds upon the consistency method (Zhou, et.al., 2003), a semi-...
SAC
2006
ACM
15 years 5 months ago
2006
ACM
We consider the problem of partitioning, in a highly accurate and highly efficient way, a set of n documents lying in a metric space into k non-overlapping clusters. We augment th...
101
click to vote
HIS
2004
15 years 1 months ago
2004
Boosting is a general method for improving the accuracy of a learning algorithm. AdaBoost, short form for Adaptive Boosting method, consists of repeated use of a weak or a base le...