291 search results - page 43 / 59 » Clustering and the Biclique Partition Problem |
ICCV
2003
IEEE
14 years 11 months ago
2003
IEEE
Dominant sets are a new graph-theoretic concept that has proven to be relevant in partitional (flat) clustering as well as image segmentation problems. However, in many computer v...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
XML has become a popular method of data representation both on the web and in databases in recent years. One of the reasons for the popularity of XML has been its ability to encod...
ICASSP
2011
IEEE
13 years 22 days 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...
BMCBI
2008
13 years 9 months ago
2008
Background: The analysis of large-scale data sets via clustering techniques is utilized in a number of applications. Biclustering in particular has emerged as an important problem...
ICIP
1997
IEEE
14 years 10 months ago
1997
IEEE
In this paper we introduce a novel optimization framework for hierarchical data clustering and apply it to the problem of unsupervised texture segmentation. The proposed objective...