2012
DOI: 10.5815/ijitcs.2012.05.03
|View full text |Cite
|
Sign up to set email alerts
|

Feature Selection using a Novel Particle Swarm Optimization and It’s Variants

Abstract: Feature selection has been keen area of research in classification problem. Most of the researchers mainly concentrate on statistical measures to select the feature subset. These methods do not provide a suitable solution because the search space increases with the feature size. The FS is a very popular area for applications of populationbased random techniques. This paper suggests swarm optimization technique, binary particle swarm optimization technique and its variants, to select the optimal feature subset.… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
12
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(12 citation statements)
references
References 19 publications
0
12
0
Order By: Relevance
“…Chittineni and Bhogapathi applied the Exhaustive search and Heuristic search techniques in order to determine features that contribute to cluster data [30]. Parimala and Nallaswamy proposed swarm optimization technique, binary particle swarm optimization technique and its variants in order to select the optimal feature subset [31]. Kalpana and Mani compared the two methods Median Based Discretization and ChiMerge discretization.…”
Section: Proposed Approach and Experimental Resultsmentioning
confidence: 99%
“…Chittineni and Bhogapathi applied the Exhaustive search and Heuristic search techniques in order to determine features that contribute to cluster data [30]. Parimala and Nallaswamy proposed swarm optimization technique, binary particle swarm optimization technique and its variants in order to select the optimal feature subset [31]. Kalpana and Mani compared the two methods Median Based Discretization and ChiMerge discretization.…”
Section: Proposed Approach and Experimental Resultsmentioning
confidence: 99%
“…For example, Chittineni and Bhogapathi applied the Exhaustive search and Heuristic search techniques in order to determine features that contribute to cluster data [7]. Parimala and Nallaswamy proposed swarm optimization technique, binary particle swarm optimization technique and its variants in order to select the optimal feature subset [8]. Kalpana and Mani compared the two methods Median Based Discretization and ChiMerge discretization.…”
Section: Introductionmentioning
confidence: 99%
“…They process multiple candidate solutions concurrently, and they are developed based on characteristics of biological systems [13]. They are widely used for improving the search strategy in FS, because they are easy to implement and incorporate mechanisms to avoid getting trapped in local optima [54] [59] [61] [65]. These algorithms are also able to find best/optimal solution in a reasonable time with efficient II.…”
Section: Introductionmentioning
confidence: 99%