Show simple item record

dc.contributor.authorZhu, X
dc.contributor.authorLoy, CC
dc.contributor.authorGong, S (2017). Constructing Robust Affinity Graphs for Spectral Clustering - IEEE Conference Publication. [online] Available at: [Accessed 28 Sep. 2017].
dc.description.abstract© 2014 IEEE.Spectral clustering requires robust and meaningful affinity graphs as input in order to form clusters with desired structures that can well support human intuition. To construct such affinity graphs is non-trivial due to the ambiguity and uncertainty inherent in the raw data. In contrast to most existing clustering methods that typically employ all available features to construct affinity matrices with the Euclidean distance, which is often not an accurate representation of the underlying data structures, we propose a novel unsupervised approach to generating more robust affinity graphs via identifying and exploiting discriminative features for improving spectral clustering. Specifically, our model is capable of capturing and combining subtle similarity information distributed over discriminative feature subspaces for more accurately revealing the latent data distribution and thereby leading to improved data clustering, especially with heterogeneous data sources. We demonstrate the efficacy of the proposed approach on challenging image and video datasets.
dc.format.extent1450 - 1457
dc.titleConstructing robust affinity graphs for spectral clustering
dc.typeConference Proceeding
dc.rights.holder© Copyright 2014 IEEE
pubs.organisational-group/Queen Mary University of London
pubs.organisational-group/Queen Mary University of London/Faculty of Science & Engineering
pubs.organisational-group/Queen Mary University of London/Faculty of Science & Engineering/Electronic Engineering and Computer Science - Staff

Files in this item


This item appears in the following Collection(s)

Show simple item record

Return to top