291 search results - page 16 / 59 » Clustering and the Biclique Partition Problem |
ICPR
2008
IEEE
14 years 3 months ago
2008
IEEE
To find how many clusters in a sample set is an old yet unsolved problem in unsupervised clustering. Many segmentation methods require the user to specify the number of regions in...
CSDA
2007
13 years 9 months ago
2007
Model-based clustering exploits finite mixture models for detecting group in a data set. It provides a sound statistical framework which can address some important issues, such as...
ALENEX
2008
13 years 10 months ago
2008
Consensus clustering is the problem of reconciling clustering information about the same data set coming from different sources or from different runs of the same algorithm. Cast ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
FOCS
1999
IEEE
14 years 1 months ago
1999
IEEE
The metric 2-clustering problem is de ned as follows: given a metric (X;d), partition X into two sets S1 and S2 in order to minimize the value of X i X fu;vg Si d(u;v) In this pap...