9 search results - page 1 / 2 » Kernel MDL to Determine the Number of Clusters |
MLDM
2007
Springer
13 years 11 months ago
2007
Springer
In this paper we propose a new criterion, based on Minimum Description Length (MDL), to estimate an optimal number of clusters. This criterion, called Kernel MDL (KMDL), is particu...
KDD
2006
ACM
14 years 5 months ago
2006
ACM
How do we find a natural clustering of a real world point set, which contains an unknown number of clusters with different shapes, and which may be contaminated by noise? Most clu...
PAKDD
2005
ACM
13 years 10 months ago
2005
ACM
Density-based clustering has the advantages for (i) allowing arbitrary shape of cluster and (ii) not requiring the number of clusters as input. However, when clusters touch each o...
ITSL
2008
13 years 6 months ago
2008
Clustering can be defined as a data assignment problem where the goal is to partition the data into nonhierarchical groups of items. In our previous work, we suggested an informati...
CVPR
2011
IEEE
12 years 8 months ago
2011
IEEE
Given a unlabelled set of points X ∈ RN belonging to k groups, we propose a method to identify cluster assignments that provides maximum separating margin among the clusters. We...