Sciweavers

22 search results - page 2 / 5
» Quantization and clustering with Bregman divergences
Sort
View
CVPR
2010
IEEE
13 years 4 months ago
Total Bregman divergence and its applications to shape retrieval
Shape database search is ubiquitous in the world of biometric systems, CAD systems etc. Shape data in these domains is experiencing an explosive growth and usually requires search...
Meizhu Liu, Baba C. Vemuri, Shun-ichi Amari, Frank...
ICDM
2010
IEEE
135views Data Mining» more  ICDM 2010»
13 years 2 months ago
Learning a Bi-Stochastic Data Similarity Matrix
An idealized clustering algorithm seeks to learn a cluster-adjacency matrix such that, if two data points belong to the same cluster, the corresponding entry would be 1; otherwise ...
Fei Wang, Ping Li, Arnd Christian König
KDD
2005
ACM
112views Data Mining» more  KDD 2005»
14 years 4 months ago
Model-based overlapping clustering
While the vast majority of clustering algorithms are partitional, many real world datasets have inherently overlapping clusters. Several approaches to finding overlapping clusters...
Arindam Banerjee, Chase Krumpelman, Joydeep Ghosh,...

Publication
1763views
14 years 28 days ago
Reranking with Contextual dissimilarity measures from representational Bregman k-means
We present a novel reranking framework for Content Based Image Retrieval (CBIR) systems based on con-textual dissimilarity measures. Our work revisit and extend the method of Perro...
Olivier Schwander, Frank Nielsen
SDM
2004
SIAM
189views Data Mining» more  SDM 2004»
13 years 5 months ago
An Abstract Weighting Framework for Clustering Algorithms
act Weighting Framework for Clustering Algorithms Richard Nock Frank Nielsen Recent works in unsupervised learning have emphasized the need to understand a new trend in algorithmi...
Richard Nock, Frank Nielsen