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...
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 ...
While the vast majority of clustering algorithms are partitional, many real world datasets have inherently overlapping clusters. Several approaches to finding overlapping clusters...
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...
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...