2015
DOI: 10.1007/978-3-319-19644-2_16
|View full text |Cite
|
Sign up to set email alerts
|

A Discrete Bat Algorithm for the Community Detection Problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 28 publications
(8 citation statements)
references
References 24 publications
0
8
0
Order By: Relevance
“…In the bat motion step, all the search agents move toward the best solution (position with best fitness value), and thus, leads to falling into local optima. In addition to lacking the parameters that increase its exploration ability and prevent it from falling into this problem (Hassan et al , 2015). Another determinant is that in the standard bat algorithm, the movement to a new location (a new solution) is not performed unless it is better than the current global solution and this leads to limiting the movement of search agents (Hassan et al , 2015).…”
Section: Bat Algorithm Limitationsmentioning
confidence: 99%
See 1 more Smart Citation
“…In the bat motion step, all the search agents move toward the best solution (position with best fitness value), and thus, leads to falling into local optima. In addition to lacking the parameters that increase its exploration ability and prevent it from falling into this problem (Hassan et al , 2015). Another determinant is that in the standard bat algorithm, the movement to a new location (a new solution) is not performed unless it is better than the current global solution and this leads to limiting the movement of search agents (Hassan et al , 2015).…”
Section: Bat Algorithm Limitationsmentioning
confidence: 99%
“…In addition to lacking the parameters that increase its exploration ability and prevent it from falling into this problem (Hassan et al , 2015). Another determinant is that in the standard bat algorithm, the movement to a new location (a new solution) is not performed unless it is better than the current global solution and this leads to limiting the movement of search agents (Hassan et al , 2015). BA cannot support the optimization problems with discrete values and needs to improve its implementation, as well as requiring different parameter tuning (Ezugwu et al , 2020).…”
Section: Bat Algorithm Limitationsmentioning
confidence: 99%
“…BA is another MH algorithm that has been used to develop and improve CD methods. In [132], Hassan et al proposed a new CD method based on discrete BA optimization. The method uses the modularity function as a fitness function that should be maximized.…”
Section: B Community Detection Based On Meta-heuristic Algorithmsmentioning
confidence: 99%
“…More recently, the community has started to explore the suitability of modern nature-inspired meta-heuristics for community detection in graphs. One of these methods is BA, as exposed by works such as [72] and [162]. Particularly relevant are [120] and [207], which focus on the application of BA over dynamic social networks, and in which a multi-objective community finding problem is formulated.…”
Section: Recent Work In Community Detection Using Bio-inspired Meta-hmentioning
confidence: 99%