15 search results - page 2 / 3 » Finding Median Partitions Using Information-Theoretical-Base... |
PAMI
2006
13 years 4 months ago
2006
The k-means algorithm is widely used for clustering because of its computational efficiency. Given n points in d-dimensional space and the number of desired clusters k, k-means see...
EAAI
2006
13 years 4 months ago
2006
The problem of partitioning appears in several areas ranging from VLSI, parallel programming, to molecular biology. The interest in finding an optimal partition especially in VLSI ...
ALENEX
2008
13 years 6 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 ...
ERCIMDL
2000
Springer
13 years 8 months ago
2000
Springer
Segmentation of a colour image composed of different kinds of texture regions can be a hard problem, namely to compute for an exact texture fields and a decision of the optimum num...
ADBIS
2010
Springer
13 years 6 months ago
2010
Springer
al Partitioning by Predicate Abstraction and its Application to Data Warehouse Design Aleksandar Dimovski1 , Goran Velinov2 , and Dragan Sahpaski2 1 Faculty of Information-Communic...