Unsupervised feature selection with ordinal locality
Lists
Only you see this
Abstract
Unsupervised feature selection has shown significant potential in distance-based clustering tasks. This paper proposes a novel triplet induced method. Firstly, a triplet-based loss function is introduced to enforce the selected feature groups to preserve ordinal locality of original data, which contributes to distance-based clustering tasks. Secondly, we simplify the orthogonal basis clustering by imposing an orthogonal constraint on the feature projection matrix. Consequently, a general framework for simultaneous feature selection and clustering is discussed. Thirdly, an alternating minimization algorithm is employed to efficiently optimize the proposed model together with rapid convergence. Extensive comparison experiments on several benchmark datasets well validate the encouraging gain in clustering from our proposed method.
BibTeX
@inproceedings{guo2017unsupervised,
author = {Jun Guo and Yanqing Guo and Xiangwei Kong and Ran He},
title = {{Unsupervised feature selection with ordinal locality}},
booktitle = {ICME},
year = {2017},
doi = {10.1109/icme.2017.8019357},
}Loading related content...