Feature Selection for Partially Labeled Data Based on Neighborhood Granulation Measures

12Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

As an effective feature selection technique, rough set theory plays an important part in machine learning. However, it is only applicable to labeled data. In reality, there are massive partially labeled data in machine learning tasks, such as webpage classification, speech recognition, and text categorization. To effectively remove redundant features of partially labeled data, the neighborhood granulation measures based on a neighborhood rough set model are put forward in this paper, which can be used to evaluate the discernibility ability of feature subsets under both information systems and decision systems. Moreover, a new definition of significance is introduced. Based on that, a semisupervised reduction algorithm is presented for the feature selection of partially labeled data. Several datasets are chosen to verify its effectiveness. The comparative experiments show that our proposed method is more effective and applicable to the feature selection of partially labeled data.

Cite

CITATION STYLE

APA

Li, B., Xiao, J., & Wang, X. (2019). Feature Selection for Partially Labeled Data Based on Neighborhood Granulation Measures. IEEE Access, 7, 37238–37250. https://doi.org/10.1109/ACCESS.2019.2903845

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free