TY - GEN
T1 - Exploiting hierarchical structures for unsupervised feature selection
AU - Wang, Suhang
AU - Wang, Yilin
AU - Tang, Jiliang
AU - Aggarwal, Charu
AU - Ranganath, Suhas
AU - Liu, Huan
N1 - Funding Information: This material is based upon work supported by, or in part by, the NSF grants #1614576 and IIS-1217466, and the ONR grant N00014-16-1-2257. Publisher Copyright: Copyright © by SIAM.
PY - 2017
Y1 - 2017
N2 - Feature selection has been proven to be effective and efficient in preparing high-dimensional data for many mining and learning tasks. Features of real-world high-dimensional data such as words of documents, pixels of images and genes of microarray data, usually present inherent hierarchical structures. In a hierarchical structure, features could share certain properties. Such information has been exploited to help supervised feature selection but it is rarely investigated for unsupervised feature selection, which is challenging due to the lack of labels. Since real world data is often unlabeled, it is of practical importance to study the problem of feature selection with hierarchical structures in an unsupervised setting. In particular, we provide a principled method to exploit hierarchical structures of features and propose a novel framework HUFS, which utilizes the given hierarchical structures to help select features without labels. Experimental study on real-world datasets is conducted to assess the effectiveness of the proposed framework.
AB - Feature selection has been proven to be effective and efficient in preparing high-dimensional data for many mining and learning tasks. Features of real-world high-dimensional data such as words of documents, pixels of images and genes of microarray data, usually present inherent hierarchical structures. In a hierarchical structure, features could share certain properties. Such information has been exploited to help supervised feature selection but it is rarely investigated for unsupervised feature selection, which is challenging due to the lack of labels. Since real world data is often unlabeled, it is of practical importance to study the problem of feature selection with hierarchical structures in an unsupervised setting. In particular, we provide a principled method to exploit hierarchical structures of features and propose a novel framework HUFS, which utilizes the given hierarchical structures to help select features without labels. Experimental study on real-world datasets is conducted to assess the effectiveness of the proposed framework.
UR - http://www.scopus.com/inward/record.url?scp=85027868594&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85027868594&partnerID=8YFLogxK
U2 - 10.1137/1.9781611974973.57
DO - 10.1137/1.9781611974973.57
M3 - Conference contribution
T3 - Proceedings of the 17th SIAM International Conference on Data Mining, SDM 2017
SP - 507
EP - 515
BT - Proceedings of the 17th SIAM International Conference on Data Mining, SDM 2017
A2 - Chawla, Nitesh
A2 - Wang, Wei
PB - Society for Industrial and Applied Mathematics Publications
T2 - 17th SIAM International Conference on Data Mining, SDM 2017
Y2 - 27 April 2017 through 29 April 2017
ER -