Applying PSO in finding useful features

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

Abstract

In data mining and knowledge discovery, the curse of dimensionality is a damning factor for numerous potentially powerful machine learning techniques, while rough set theory can be employed to reduce the dimensionality of datasets as a preprocessing step. For rough set based methods, finding reducts is an essential step, yet it is of high complexity. In this paper, based on particle swarm optimization(PSO) which is an optimization algorithm inspired by social behavior of flocks of birds when they are searching for food, a novel method is proposed for finding useful features instead of reducts in rough set theory. Subsequent experiments on UCI show that this method performs well on whole convergence, and can retrieve useful subsets effectively while retaining attributes of high importance as possible. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Zhao, Y., Zhang, X., Jia, S., & Zhang, F. (2006). Applying PSO in finding useful features. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4062 LNAI, pp. 580–585). Springer Verlag. https://doi.org/10.1007/11795131_84

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