Fuzzy rough incremental attribute reduction applying dependency measures

7Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Since data increases with time and space, many incremental rough based reduction techniques have been proposed. In these techniques, some focus on knowledge representation on the increasing data, some focus on inducing rules from the increasing data. Whereas there is less work on incremental feature selection (i.e., attribute reduction) from the increasing data, especially the increasing real valued data. And fuzzy rough sets is then applied in this incremental method because fuzzy rough set can effectively reduce attributes from the real valued data. By analyzing the basic concepts, such as lower approximation and positive region, of fuzzy rough sets on incremental datasets, the incremental mechanisms of these concepts are then proposed. An incremental algorithm is then designed. Finally, some numerical experiments demonstrate that the incremental algorithm is effective and efficient compared to non-incremental attribute reduction algorithms, especially on the datasets with large number of attributes.

Cite

CITATION STYLE

APA

Liu, Y., Zhao, S., Chen, H., Li, C., & Lu, Y. (2017). Fuzzy rough incremental attribute reduction applying dependency measures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10366 LNCS, pp. 484–492). Springer Verlag. https://doi.org/10.1007/978-3-319-63579-8_37

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