526 search results - page 48 / 106 » Increments of Random Partitions |
AAAI
2008
15 years 2 months ago
2008
This paper presents a fast simulated annealing framework for combining multiple clusterings (i.e. clustering ensemble) based on some measures of agreement between partitions, whic...
188
click to vote
APDC
1997
15 years 1 months ago
1997
Delaunaytriangulationhas beenmuchusedin suchapplicationsas volumerendering, shape representation, terrain modeling and so on. The main disadvantage of Delaunay triangulationis lar...
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
The K-means clustering problem seeks to partition the columns of a data matrix in subsets, such that columns in the same subset are ‘close’ to each other. The co-clustering pr...
113
click to vote
SIGMOD
1998
ACM
15 years 4 months ago
1998
ACM
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...
106
click to vote
ICIP
2001
IEEE
16 years 1 months ago
2001
IEEE
This paper introduces multi-scale tree-based approaches to image segmentation, using Rissanen's coding theoretic minimum description length (MDL) principle to penalize overly...