Sciweavers

387 search results - page 27 / 78
» Beyond Pairwise Clustering
Sort
View
SOCO
2008
Springer
13 years 7 months ago
A particular Gaussian mixture model for clustering and its application to image retrieval
We introduce a new method for data clustering based on a particular Gaussian mixture model (GMM). Each cluster of data, modeled as a GMM into an input space, is interpreted as a hy...
Hichem Sahbi
TKDE
2008
148views more  TKDE 2008»
13 years 7 months ago
Semisupervised Clustering with Metric Learning using Relative Comparisons
Semisupervised clustering algorithms partition a given data set using limited supervision from the user. The success of these algorithms depends on the type of supervision and also...
Nimit Kumar, Krishna Kummamuru
CVPR
1999
IEEE
14 years 9 months ago
Stochastic Image Segmentation by Typical Cuts
We present a stochastic clustering algorithm which uses pairwise similarity of elements, based on a new graph theoretical algorithm for the sampling of cuts in graphs. The stochas...
Yoram Gdalyahu, Daphna Weinshall, Michael Werman
CLA
2004
13 years 8 months ago
Fast Factorization of Concept Lattices by Similarity: Solution and an Open Problem
An important problem in applications of formal concept analysis is a possibly large number of clusters extracted from data. Factorization is one of the methods being used to cope w...
Radim Belohlávek, Jiri Dvorak, Jan Outrata
NIPS
2004
13 years 8 months ago
Efficient Out-of-Sample Extension of Dominant-Set Clusters
Dominant sets are a new graph-theoretic concept that has proven to be relevant in pairwise data clustering problems, such as image segmentation. They generalize the notion of a ma...
Massimiliano Pavan, Marcello Pelillo