2011
DOI: 10.1016/j.swevo.2011.06.003
|View full text |Cite
|
Sign up to set email alerts
|

Clustering using firefly algorithm: Performance study

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
160
0
2

Year Published

2015
2015
2023
2023

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 436 publications
(162 citation statements)
references
References 18 publications
0
160
0
2
Order By: Relevance
“…In this study, we adapt the standard FA which has been implemented in data clustering (Senthilnath et al, 2011) and present two variants of FA that are to be used in text clustering. The variants include the WFA (Mohammed et al, 2014) and WFA II which enhance the exploitation of WFA that leads to better clustering.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…In this study, we adapt the standard FA which has been implemented in data clustering (Senthilnath et al, 2011) and present two variants of FA that are to be used in text clustering. The variants include the WFA (Mohammed et al, 2014) and WFA II which enhance the exploitation of WFA that leads to better clustering.…”
Section: Related Workmentioning
confidence: 99%
“…4. When the standard FA is applied in clustering (Senthilnath et al, 2011;Rui et al, 2012;Banati and Bajaj, 2013), the number of fireflies are pre-defined and each firefly carries one random solution. This solution is the K number of clusters; hence we must pre-determine the value of k. However, such an approach is not suitable when we do not have any knowledge about the dataset.…”
Section: Standard Firefly Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…Accordingly, in this paper, we have included multiple kernel-based clustering algorithm with firefly optimization. This paper considers the firefly algorithm [3] instead of cuckoo search algorithm which is utilized in [13]. At first, the data is pre-processed by removing the missing variables.…”
Section: Introductionmentioning
confidence: 99%
“…Clustering can be perceived as combinatorial optimization problem -which is known to be NP-hard [5]. It is the reason why diverse heuristic approaches have been already used to tackle it [6], [7]. As a point of reference classic K-means [8] algorithm can be named.…”
mentioning
confidence: 99%