2015
DOI: 10.1016/j.engappai.2015.06.003
|View full text |Cite
|
Sign up to set email alerts
|

Weighted bee colony algorithm for discrete optimization problems with application to feature selection

Abstract: Document embargo until 20/06/2016The conventional bee colony optimization (BCO) algorithm, one of the recent swarm intelligence (SI) methods, is good at exploration whilst being weak at exploitation. In order to improve the exploitation power of BCO, in this paper we introduce a novel algorithm, dubbed as weighted BCO (wBCO), that allows the bees to search in the solution space deliberately while considering policies to share the attained information about the food sources heuristically. For this purpose, wBCO… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 35 publications
(11 citation statements)
references
References 39 publications
0
11
0
Order By: Relevance
“…The main idea in EACO is to embed the edges that were previously traversed in the earlier executions. Moayedikia et al 10 introduced a weighted bee colony optimization for the feature selection (FS-wBCO). The authors used global and local weights to measure the importance of the features and also a new recruiter selection procedure.…”
Section: Overview Of Feature Selection Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…The main idea in EACO is to embed the edges that were previously traversed in the earlier executions. Moayedikia et al 10 introduced a weighted bee colony optimization for the feature selection (FS-wBCO). The authors used global and local weights to measure the importance of the features and also a new recruiter selection procedure.…”
Section: Overview Of Feature Selection Methodsmentioning
confidence: 99%
“…The weight which is calculated in Eq. (6) was proposed for a Bee Colony Optimization (BCO) algorithm 10 to measure the acceptance degree of each source food and to compute the loyalty assessment. However, the authors use it in a different context than the one we propose.…”
Section: Weighted Local Search (Wls)mentioning
confidence: 99%
“…The behavior of a bee in nature is the main inspiration for the BCO algorithm. This methodology is based on creation of multi agent system (colony of artificial bees) capabilities to successfully solve difficult combinatorial optimization problems [43][44][45]. BCO was proposed by Teodorovi膰 in 2001.…”
Section: Original Bee Colony Optimization Algorithm (Bco)mentioning
confidence: 99%
“…Then the fitness (denoted f () in Algorithm 1) of this NHV is evaluated (lines 20 -21), where the vector will replace the worst vector of HM provided that the fitness of the newly generated harmony vector is better than worst fitness of HM. The fitness function can be classification accuracy, kappa statistics, G-Mean or any statistical measure such as Wilcoxon [8,9,23,36,38].…”
Section: Symonmentioning
confidence: 99%
“…SYMON displays similar performance across three data sets: LEU, SRBCT and LUG, with the values of 0.875, 1 and Underpinning SYMON's feature selection strategy is a meta-heuristic optimisation algorithm capable of finding the near-optimal part of the solution space. We opted for near-optimality as it is often hard and at times impossible to locate the optimal solution [38,39]. Nevertheless, this is sufficient to deliver SYMON a subset of features that is better than the compared works.…”
Section: Classifier Metricsmentioning
confidence: 99%