A wide variety of distortion functions, such as squared Euclidean distance, Mahalanobis distance, Itakura-Saito distance and relative entropy, have been used for clustering. In th...
Arindam Banerjee, Srujana Merugu, Inderjit S. Dhil...
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
We present an efficient method for feature correspondence and object-based image matching, which exploits both photometric similarity and pairwise geometric consistency from local ...
Minsu Cho (Seoul National University), Jungmin Lee...
The spatio-temporal patterning of gene expression in early embryos is an important source of information for understanding the functions of genes involved in development. Most ana...
Hanchuan Peng, Fuhui Long, Michael B. Eisen, Eugen...