High-dimensional data visualization is receiving increasing interest because of the growing abundance of highdimensional datasets. To understand such datasets, visualization of th...
Clustering using the Hilbert Schmidt independence criterion (CLUHSIC) is a recent clustering algorithm that maximizes the dependence between cluster labels and data observations ac...
Wenliang Zhong, Weike Pan, James T. Kwok, Ivor W. ...
We introduce a robust and efficient framework called CLUMP (CLustering Using Multiple Prototypes) for unsupervised discovery of structure in data. CLUMP relies on finding multip...
This work examines under what conditions compression methodologies can retain the outcome of clustering operations. We focus on the popular k-Means clustering algorithm and we dem...
Deepak S. Turaga, Michail Vlachos, Olivier Versche...
Clustering is an important technique for understanding and analysis of large multi-dimensional datasets in many scientific applications. Most of clustering research to date has be...