Abstract

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.

Original languageEnglish (US)
Title of host publicationProceedings of the 17th SIAM International Conference on Data Mining, SDM 2017
PublisherSociety for Industrial and Applied Mathematics Publications
Pages507-515
Number of pages9
ISBN (Electronic)9781611974874
StatePublished - 2017
Event17th SIAM International Conference on Data Mining, SDM 2017 - Houston, United States
Duration: Apr 27 2017Apr 29 2017

Other

Other17th SIAM International Conference on Data Mining, SDM 2017
CountryUnited States
CityHouston
Period4/27/174/29/17

Fingerprint

Feature extraction
Labels
Microarrays
Genes
Pixels

ASJC Scopus subject areas

  • Software
  • Computer Science Applications

Cite this

Wang, S., Wang, Y., Tang, J., Aggarwal, C., Ranganath, S., & Liu, H. (2017). Exploiting hierarchical structures for unsupervised feature selection. In Proceedings of the 17th SIAM International Conference on Data Mining, SDM 2017 (pp. 507-515). Society for Industrial and Applied Mathematics Publications.

Exploiting hierarchical structures for unsupervised feature selection. / Wang, Suhang; Wang, Yilin; Tang, Jiliang; Aggarwal, Charu; Ranganath, Suhas; Liu, Huan.

Proceedings of the 17th SIAM International Conference on Data Mining, SDM 2017. Society for Industrial and Applied Mathematics Publications, 2017. p. 507-515.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Wang, S, Wang, Y, Tang, J, Aggarwal, C, Ranganath, S & Liu, H 2017, Exploiting hierarchical structures for unsupervised feature selection. in Proceedings of the 17th SIAM International Conference on Data Mining, SDM 2017. Society for Industrial and Applied Mathematics Publications, pp. 507-515, 17th SIAM International Conference on Data Mining, SDM 2017, Houston, United States, 4/27/17.
Wang S, Wang Y, Tang J, Aggarwal C, Ranganath S, Liu H. Exploiting hierarchical structures for unsupervised feature selection. In Proceedings of the 17th SIAM International Conference on Data Mining, SDM 2017. Society for Industrial and Applied Mathematics Publications. 2017. p. 507-515
Wang, Suhang ; Wang, Yilin ; Tang, Jiliang ; Aggarwal, Charu ; Ranganath, Suhas ; Liu, Huan. / Exploiting hierarchical structures for unsupervised feature selection. Proceedings of the 17th SIAM International Conference on Data Mining, SDM 2017. Society for Industrial and Applied Mathematics Publications, 2017. pp. 507-515
@inproceedings{7c75f6b01d6b477b8fd195336748c39b,
title = "Exploiting hierarchical structures for unsupervised feature selection",
abstract = "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.",
author = "Suhang Wang and Yilin Wang and Jiliang Tang and Charu Aggarwal and Suhas Ranganath and Huan Liu",
year = "2017",
language = "English (US)",
pages = "507--515",
booktitle = "Proceedings of the 17th SIAM International Conference on Data Mining, SDM 2017",
publisher = "Society for Industrial and Applied Mathematics Publications",
address = "United States",

}

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

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

M3 - Conference contribution

SP - 507

EP - 515

BT - Proceedings of the 17th SIAM International Conference on Data Mining, SDM 2017

PB - Society for Industrial and Applied Mathematics Publications

ER -