Brain storm optimization with agglomerative hierarchical clustering analysis

Junfeng Chen; Jingyu Wang; Shi Cheng; Yuhui Shi

doi:10.1007/978-3-319-41009-8_12

Brain storm optimization with agglomerative hierarchical clustering analysis

Junfeng Chen^*
, Jingyu Wang
, Shi Cheng
, Yuhui Shi

^*Corresponding author for this work

Hohai University
University of Nottingham Ningbo China

Research output: Contribution to journal › Article › peer-review

22 Citations (Scopus)

Abstract

Brain storm optimization (BSO) is a relatively new swarm intelligence algorithm, which simulates the problem-solving process of human brainstorming. In General, BSO employs flat clustering which has a number of drawbacks. In this paper, the agglomerative hierarchical clustering is introduced into BSO and its impact on the performance of the creating operator is then analyzed. The proposed algorithm is applied to numerical optimization problems in comparison with the BSO with k-means Clustering. Experimental results show that the proposed algorithm achieves satisfactory results and guarantees a high coverage rate.

Original language	English
Pages (from-to)	115-122
Number of pages	8
Journal	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	9713 LNCS
DOIs	https://doi.org/10.1007/978-3-319-41009-8_12
Publication status	Published - 2016

Keywords

Agglomerative hierarchical clustering
Brain storm optimization
k-means clustering

Access to Document

10.1007/978-3-319-41009-8_12

Cite this

@article{10c65d69dafe4988add8679aaa2c4a74,

title = "Brain storm optimization with agglomerative hierarchical clustering analysis",

abstract = "Brain storm optimization (BSO) is a relatively new swarm intelligence algorithm, which simulates the problem-solving process of human brainstorming. In General, BSO employs flat clustering which has a number of drawbacks. In this paper, the agglomerative hierarchical clustering is introduced into BSO and its impact on the performance of the creating operator is then analyzed. The proposed algorithm is applied to numerical optimization problems in comparison with the BSO with k-means Clustering. Experimental results show that the proposed algorithm achieves satisfactory results and guarantees a high coverage rate.",

keywords = "Agglomerative hierarchical clustering, Brain storm optimization, k-means clustering",

author = "Junfeng Chen and Jingyu Wang and Shi Cheng and Yuhui Shi",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2016.",

year = "2016",

doi = "10.1007/978-3-319-41009-8\_12",

language = "English",

volume = "9713 LNCS",

pages = "115--122",

journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

issn = "0302-9743",

}

TY - JOUR

T1 - Brain storm optimization with agglomerative hierarchical clustering analysis

AU - Chen, Junfeng

AU - Wang, Jingyu

AU - Cheng, Shi

AU - Shi, Yuhui

N1 - Publisher Copyright: © Springer International Publishing Switzerland 2016.

PY - 2016

Y1 - 2016

N2 - Brain storm optimization (BSO) is a relatively new swarm intelligence algorithm, which simulates the problem-solving process of human brainstorming. In General, BSO employs flat clustering which has a number of drawbacks. In this paper, the agglomerative hierarchical clustering is introduced into BSO and its impact on the performance of the creating operator is then analyzed. The proposed algorithm is applied to numerical optimization problems in comparison with the BSO with k-means Clustering. Experimental results show that the proposed algorithm achieves satisfactory results and guarantees a high coverage rate.

AB - Brain storm optimization (BSO) is a relatively new swarm intelligence algorithm, which simulates the problem-solving process of human brainstorming. In General, BSO employs flat clustering which has a number of drawbacks. In this paper, the agglomerative hierarchical clustering is introduced into BSO and its impact on the performance of the creating operator is then analyzed. The proposed algorithm is applied to numerical optimization problems in comparison with the BSO with k-means Clustering. Experimental results show that the proposed algorithm achieves satisfactory results and guarantees a high coverage rate.

KW - Agglomerative hierarchical clustering

KW - Brain storm optimization

KW - k-means clustering

UR - https://www.scopus.com/pages/publications/85007504917

U2 - 10.1007/978-3-319-41009-8_12

DO - 10.1007/978-3-319-41009-8_12

M3 - Article

AN - SCOPUS:85007504917

SN - 0302-9743

VL - 9713 LNCS

SP - 115

EP - 122

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -

Brain storm optimization with agglomerative hierarchical clustering analysis

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this