A novel cluster detection of COVID-19 patients and medical disease conditions using improved evolutionary clustering algorithm star

With the increasing number of samples, the manual clustering of COVID-19 and medical disease data samples becomes time-consuming and requires highly skilled labour. Recently, several algorithms have been used for clustering medical datasets deterministically; however, these definitions have not been...

Full description

Saved in:
Bibliographic Details
Published in:Computers in biology and medicine Vol. 138; p. 104866
Main Authors: Hassan, Bryar A., Rashid, Tarik A., Hamarashid, Hozan K.
Format: Journal Article
Language:English
Published: Oxford Elsevier Ltd 01.11.2021
Elsevier Limited
Subjects:
ISSN:0010-4825, 1879-0534, 1879-0534
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract With the increasing number of samples, the manual clustering of COVID-19 and medical disease data samples becomes time-consuming and requires highly skilled labour. Recently, several algorithms have been used for clustering medical datasets deterministically; however, these definitions have not been effective in grouping and analysing medical diseases. The use of evolutionary clustering algorithms may help to effectively cluster these diseases. On this presumption, we improved the current evolutionary clustering algorithm star (ECA*), called iECA*, in three manners: (i) utilising the elbow method to find the correct number of clusters; (ii) cleaning and processing data as part of iECA* to apply it to multivariate and domain-theory datasets; (iii) using iECA* for real-world applications in clustering COVID-19 and medical disease datasets. Experiments were conducted to examine the performance of iECA* against state-of-the-art algorithms using performance and validation measures (validation measures, statistical benchmarking, and performance ranking framework). The results demonstrate three primary findings. First, iECA* was more effective than other algorithms in grouping the chosen medical disease datasets according to the cluster validation criteria. Second, iECA* exhibited the lower execution time and memory consumption for clustering all the datasets, compared to the current clustering methods analysed. Third, an operational framework was proposed to rate the effectiveness of iECA* against other algorithms in the datasets analysed, and the results indicated that iECA* exhibited the best performance in clustering all medical datasets. Further research is required on real-world multi-dimensional data containing complex knowledge fields for experimental verification of iECA* compared to evolutionary algorithms. [Display omitted] •Proposing an improved algorithm, called iECA*, for clustering COVID-19 and medical disease conditions.•The performance of iECA* is examined against the state-of-the-art algorithms using performance and clustering validation measures.•iECA* is more effective than its rivals in grouping the medical datasets.•iECA* is the winning algorithm among current clustering methods in less execution time and memory consumption.•An operational framework is proposed to rate the effectiveness of iECA* against its competitors for medical datasets.
AbstractList With the increasing number of samples, the manual clustering of COVID-19 and medical disease data samples becomes time-consuming and requires highly skilled labour. Recently, several algorithms have been used for clustering medical datasets deterministically; however, these definitions have not been effective in grouping and analysing medical diseases. The use of evolutionary clustering algorithms may help to effectively cluster these diseases. On this presumption, we improved the current evolutionary clustering algorithm star (ECA*), called iECA*, in three manners: (i) utilising the elbow method to find the correct number of clusters; (ii) cleaning and processing data as part of iECA* to apply it to multivariate and domain-theory datasets; (iii) using iECA* for real-world applications in clustering COVID-19 and medical disease datasets. Experiments were conducted to examine the performance of iECA* against state-of-the-art algorithms using performance and validation measures (validation measures, statistical benchmarking, and performance ranking framework). The results demonstrate three primary findings. First, iECA* was more effective than other algorithms in grouping the chosen medical disease datasets according to the cluster validation criteria. Second, iECA* exhibited the lower execution time and memory consumption for clustering all the datasets, compared to the current clustering methods analysed. Third, an operational framework was proposed to rate the effectiveness of iECA* against other algorithms in the datasets analysed, and the results indicated that iECA* exhibited the best performance in clustering all medical datasets. Further research is required on real-world multi-dimensional data containing complex knowledge fields for experimental verification of iECA* compared to evolutionary algorithms. Image 1
AbstractWith the increasing number of samples, the manual clustering of COVID-19 and medical disease data samples becomes time-consuming and requires highly skilled labour. Recently, several algorithms have been used for clustering medical datasets deterministically; however, these definitions have not been effective in grouping and analysing medical diseases. The use of evolutionary clustering algorithms may help to effectively cluster these diseases. On this presumption, we improved the current evolutionary clustering algorithm star (ECA*), called iECA*, in three manners: (i) utilising the elbow method to find the correct number of clusters; (ii) cleaning and processing data as part of iECA* to apply it to multivariate and domain-theory datasets; (iii) using iECA* for real-world applications in clustering COVID-19 and medical disease datasets. Experiments were conducted to examine the performance of iECA* against state-of-the-art algorithms using performance and validation measures (validation measures, statistical benchmarking, and performance ranking framework). The results demonstrate three primary findings. First, iECA* was more effective than other algorithms in grouping the chosen medical disease datasets according to the cluster validation criteria. Second, iECA* exhibited the lower execution time and memory consumption for clustering all the datasets, compared to the current clustering methods analysed. Third, an operational framework was proposed to rate the effectiveness of iECA* against other algorithms in the datasets analysed, and the results indicated that iECA* exhibited the best performance in clustering all medical datasets. Further research is required on real-world multi-dimensional data containing complex knowledge fields for experimental verification of iECA* compared to evolutionary algorithms.
With the increasing number of samples, the manual clustering of COVID-19 and medical disease data samples becomes time-consuming and requires highly skilled labour. Recently, several algorithms have been used for clustering medical datasets deterministically; however, these definitions have not been effective in grouping and analysing medical diseases. The use of evolutionary clustering algorithms may help to effectively cluster these diseases. On this presumption, we improved the current evolutionary clustering algorithm star (ECA*), called iECA*, in three manners: (i) utilising the elbow method to find the correct number of clusters; (ii) cleaning and processing data as part of iECA* to apply it to multivariate and domain-theory datasets; (iii) using iECA* for real-world applications in clustering COVID-19 and medical disease datasets. Experiments were conducted to examine the performance of iECA* against state-of-the-art algorithms using performance and validation measures (validation measures, statistical benchmarking, and performance ranking framework). The results demonstrate three primary findings. First, iECA* was more effective than other algorithms in grouping the chosen medical disease datasets according to the cluster validation criteria. Second, iECA* exhibited the lower execution time and memory consumption for clustering all the datasets, compared to the current clustering methods analysed. Third, an operational framework was proposed to rate the effectiveness of iECA* against other algorithms in the datasets analysed, and the results indicated that iECA* exhibited the best performance in clustering all medical datasets. Further research is required on real-world multi-dimensional data containing complex knowledge fields for experimental verification of iECA* compared to evolutionary algorithms.With the increasing number of samples, the manual clustering of COVID-19 and medical disease data samples becomes time-consuming and requires highly skilled labour. Recently, several algorithms have been used for clustering medical datasets deterministically; however, these definitions have not been effective in grouping and analysing medical diseases. The use of evolutionary clustering algorithms may help to effectively cluster these diseases. On this presumption, we improved the current evolutionary clustering algorithm star (ECA*), called iECA*, in three manners: (i) utilising the elbow method to find the correct number of clusters; (ii) cleaning and processing data as part of iECA* to apply it to multivariate and domain-theory datasets; (iii) using iECA* for real-world applications in clustering COVID-19 and medical disease datasets. Experiments were conducted to examine the performance of iECA* against state-of-the-art algorithms using performance and validation measures (validation measures, statistical benchmarking, and performance ranking framework). The results demonstrate three primary findings. First, iECA* was more effective than other algorithms in grouping the chosen medical disease datasets according to the cluster validation criteria. Second, iECA* exhibited the lower execution time and memory consumption for clustering all the datasets, compared to the current clustering methods analysed. Third, an operational framework was proposed to rate the effectiveness of iECA* against other algorithms in the datasets analysed, and the results indicated that iECA* exhibited the best performance in clustering all medical datasets. Further research is required on real-world multi-dimensional data containing complex knowledge fields for experimental verification of iECA* compared to evolutionary algorithms.
With the increasing number of samples, the manual clustering of COVID-19 and medical disease data samples becomes time-consuming and requires highly skilled labour. Recently, several algorithms have been used for clustering medical datasets deterministically; however, these definitions have not been effective in grouping and analysing medical diseases. The use of evolutionary clustering algorithms may help to effectively cluster these diseases. On this presumption, we improved the current evolutionary clustering algorithm star (ECA*), called iECA*, in three manners: (i) utilising the elbow method to find the correct number of clusters; (ii) cleaning and processing data as part of iECA* to apply it to multivariate and domain-theory datasets; (iii) using iECA* for real-world applications in clustering COVID-19 and medical disease datasets. Experiments were conducted to examine the performance of iECA* against state-of-the-art algorithms using performance and validation measures (validation measures, statistical benchmarking, and performance ranking framework). The results demonstrate three primary findings. First, iECA* was more effective than other algorithms in grouping the chosen medical disease datasets according to the cluster validation criteria. Second, iECA* exhibited the lower execution time and memory consumption for clustering all the datasets, compared to the current clustering methods analysed. Third, an operational framework was proposed to rate the effectiveness of iECA* against other algorithms in the datasets analysed, and the results indicated that iECA* exhibited the best performance in clustering all medical datasets. Further research is required on real-world multi-dimensional data containing complex knowledge fields for experimental verification of iECA* compared to evolutionary algorithms.
With the increasing number of samples, the manual clustering of COVID-19 and medical disease data samples becomes time-consuming and requires highly skilled labour. Recently, several algorithms have been used for clustering medical datasets deterministically; however, these definitions have not been effective in grouping and analysing medical diseases. The use of evolutionary clustering algorithms may help to effectively cluster these diseases. On this presumption, we improved the current evolutionary clustering algorithm star (ECA*), called iECA*, in three manners: (i) utilising the elbow method to find the correct number of clusters; (ii) cleaning and processing data as part of iECA* to apply it to multivariate and domain-theory datasets; (iii) using iECA* for real-world applications in clustering COVID-19 and medical disease datasets. Experiments were conducted to examine the performance of iECA* against state-of-the-art algorithms using performance and validation measures (validation measures, statistical benchmarking, and performance ranking framework). The results demonstrate three primary findings. First, iECA* was more effective than other algorithms in grouping the chosen medical disease datasets according to the cluster validation criteria. Second, iECA* exhibited the lower execution time and memory consumption for clustering all the datasets, compared to the current clustering methods analysed. Third, an operational framework was proposed to rate the effectiveness of iECA* against other algorithms in the datasets analysed, and the results indicated that iECA* exhibited the best performance in clustering all medical datasets. Further research is required on real-world multi-dimensional data containing complex knowledge fields for experimental verification of iECA* compared to evolutionary algorithms. [Display omitted] •Proposing an improved algorithm, called iECA*, for clustering COVID-19 and medical disease conditions.•The performance of iECA* is examined against the state-of-the-art algorithms using performance and clustering validation measures.•iECA* is more effective than its rivals in grouping the medical datasets.•iECA* is the winning algorithm among current clustering methods in less execution time and memory consumption.•An operational framework is proposed to rate the effectiveness of iECA* against its competitors for medical datasets.
ArticleNumber 104866
Author Rashid, Tarik A.
Hamarashid, Hozan K.
Hassan, Bryar A.
Author_xml – sequence: 1
  givenname: Bryar A.
  orcidid: 0000-0002-4476-9351
  surname: Hassan
  fullname: Hassan, Bryar A.
  email: bryar.hassan@kissr.edu.krd
  organization: Department of Computer Networks, Technical College of Informatics, Sulaimani Polytechnic University, Sulaimani, 46001, Iraq
– sequence: 2
  givenname: Tarik A.
  surname: Rashid
  fullname: Rashid, Tarik A.
  email: tarik.ahmed@ukh.edu.krd
  organization: Computer Science and Engineering Department, University of Kurdistan Hewler, Iraq
– sequence: 3
  givenname: Hozan K.
  surname: Hamarashid
  fullname: Hamarashid, Hozan K.
  email: hozan.khalid@spu.edu.iq
  organization: Information Technology Department, Computer Science Institute, Sulaimani Polytechnic University, Sulaimani 46001, Iraq
BookMark eNqVkk9vFCEYxompsdvV70DixcusMAsMczHWrdUmTXrwz5Uw8O6WlYEVZjbp2S9eJlu30cSknkjg4cfz8Lxn6CTEAAhhShaUUPF2uzCx33Uu9mAXNalp2WZSiGdoRmXTVoQv2QmaEUJJxWTNT9FZzltCCCNL8gKdLhlvJRF8hn6d4xD34LHxYx4gYQsDmMHFgOMar26-X11UtMU7PTgIQ8Y6WFwedUZ7bF0GnQGbGKybrmQ8Zhc22PW7VKAWwz76cTrR6e73C5NA-01MbrjtcR50eomer7XP8OphnaNvlx-_rj5X1zefrlbn15XhTAxV0zWGQ8OtWRPe1sIK0tJ1J6ik2hpe152QtmkFLLWgRUI7xhhIKRoqbaftco7eHbi7sSsZTAmUtFe75PriT0Xt1J8nwd2qTdwryRhvhCyANw-AFH-OkAfVu2zAex0gjlnVvJFNccVYkb7-S7qNYwolXlFJ0TYNKyXNkTyoTIo5J1gfzVCipqbVVj02raam1aHpxzDHq8YNevrrYt35pwA-HABQvnzvIKlsSsemlJvKBCgb3X-4OEKMd2Gajh9wB_mYmapcK6K-TBM5DWRNCRGCkAJ4_2_A0zzcAwxn-bM
CitedBy_id crossref_primary_10_1007_s11042_024_20194_y
crossref_primary_10_3390_math12182893
crossref_primary_10_1007_s11042_024_18579_0
crossref_primary_10_1007_s11042_022_13260_w
crossref_primary_10_1145_3689036
crossref_primary_10_1111_ene_16026
crossref_primary_10_3233_JIFS_231922
crossref_primary_10_1007_s11042_024_19433_z
crossref_primary_10_1016_j_bspc_2021_103455
crossref_primary_10_1080_10255842_2023_2236744
crossref_primary_10_1007_s42235_024_00578_4
crossref_primary_10_1007_s12065_024_00913_y
crossref_primary_10_1109_ACCESS_2024_3393511
crossref_primary_10_1007_s11831_021_09707_2
crossref_primary_10_3390_app15147723
crossref_primary_10_7717_peerj_cs_1493
crossref_primary_10_1016_j_seps_2024_102054
crossref_primary_10_1016_j_heliyon_2024_e31631
crossref_primary_10_3389_fbioe_2022_908356
crossref_primary_10_1007_s11042_024_19192_x
crossref_primary_10_1016_j_fraope_2025_100218
crossref_primary_10_1155_2022_8562194
crossref_primary_10_1007_s11042_024_20146_6
crossref_primary_10_1016_j_jnca_2025_104219
crossref_primary_10_1016_j_eswa_2022_119206
crossref_primary_10_1016_j_knosys_2024_112098
crossref_primary_10_1016_j_asoc_2024_112549
crossref_primary_10_1155_2022_7544772
crossref_primary_10_1007_s11042_023_18026_6
crossref_primary_10_1016_j_neucom_2024_128198
crossref_primary_10_1108_F_08_2023_0068
crossref_primary_10_1111_jebm_12548
crossref_primary_10_1016_j_habitatint_2022_102556
Cites_doi 10.1145/3009966
10.3233/IDA-2007-11602
10.1016/S0031-3203(99)00137-5
10.21037/atm.2016.03.37
10.1109/TPAMI.1979.4766909
10.1016/j.eswa.2017.09.005
10.1007/s00521-013-1535-3
10.1155/2017/4135465
10.1007/978-3-030-12767-1_5
10.1007/s40595-016-0086-9
10.1007/s10773-017-3514-4
10.24017/science.2017.3.8
10.1007/s10489-018-1238-7
10.1007/s12530-012-9046-5
10.1016/j.patrec.2009.09.011
10.1016/j.eswa.2019.05.030
10.1016/j.dib.2021.107044
10.3390/s16030304
10.1016/j.eswa.2016.09.025
10.24017/science.2016.1.2.2
10.1016/j.dib.2019.105046
10.1016/j.ins.2018.09.039
ContentType Journal Article
Copyright 2021 Elsevier Ltd
Elsevier Ltd
2021. Elsevier Ltd
Copyright © 2021 Elsevier Ltd. All rights reserved.
2021 Elsevier Ltd. All rights reserved. 2021 Elsevier Ltd
Copyright_xml – notice: 2021 Elsevier Ltd
– notice: Elsevier Ltd
– notice: 2021. Elsevier Ltd
– notice: Copyright © 2021 Elsevier Ltd. All rights reserved.
– notice: 2021 Elsevier Ltd. All rights reserved. 2021 Elsevier Ltd
DBID AAYXX
CITATION
3V.
7RV
7X7
7XB
88E
8AL
8AO
8FD
8FE
8FG
8FH
8FI
8FJ
8FK
8G5
ABUWG
AFKRA
ARAPS
AZQEC
BBNVY
BENPR
BGLVJ
BHPHI
CCPQU
DWQXO
FR3
FYUFA
GHDGH
GNUQQ
GUQSH
HCIFZ
JQ2
K7-
K9.
KB0
LK8
M0N
M0S
M1P
M2O
M7P
M7Z
MBDVC
NAPCQ
P5Z
P62
P64
PHGZM
PHGZT
PJZUB
PKEHL
PPXIY
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
Q9U
7X8
5PM
DOI 10.1016/j.compbiomed.2021.104866
DatabaseName CrossRef
ProQuest Central (Corporate)
Nursing & Allied Health Database
Health & Medical Collection
ProQuest Central (purchase pre-March 2016)
Medical Database (Alumni Edition)
Computing Database (Alumni Edition)
ProQuest Pharma Collection
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Natural Science Journals
ProQuest Hospital Collection
Hospital Premium Collection (Alumni Edition)
ProQuest Central (Alumni) (purchase pre-March 2016)
ProQuest Research Library
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
Biological Science Collection
ProQuest Central
Technology Collection
Natural Science Collection
ProQuest One Community College
ProQuest Central
Engineering Research Database
Health Research Premium Collection
Health Research Premium Collection (Alumni)
ProQuest Central Student
ProQuest Research Library
SciTech Premium Collection
ProQuest Computer Science Collection
Computer Science Database
ProQuest Health & Medical Complete (Alumni)
Nursing & Allied Health Database (Alumni Edition)
Biological Sciences
Computing Database
ProQuest Health & Medical Collection
Medical Database
ProQuest Research Library
Biological Science Database
Biochemistry Abstracts 1
Research Library (Corporate)
Nursing & Allied Health Premium
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
Biotechnology and BioEngineering Abstracts
ProQuest Central Premium
ProQuest One Academic
ProQuest Health & Medical Research Collection
ProQuest One Academic Middle East (New)
ProQuest One Health & Nursing
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
ProQuest Central Basic
MEDLINE - Academic
PubMed Central (Full Participant titles)
DatabaseTitle CrossRef
Research Library Prep
Computer Science Database
ProQuest Central Student
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
SciTech Premium Collection
ProQuest Central China
ProQuest One Applied & Life Sciences
Health Research Premium Collection
Natural Science Collection
Health & Medical Research Collection
Biological Science Collection
ProQuest Central (New)
ProQuest Medical Library (Alumni)
Advanced Technologies & Aerospace Collection
ProQuest Biological Science Collection
ProQuest One Academic Eastern Edition
ProQuest Hospital Collection
ProQuest Technology Collection
Health Research Premium Collection (Alumni)
Biological Science Database
ProQuest Hospital Collection (Alumni)
Biotechnology and BioEngineering Abstracts
Nursing & Allied Health Premium
ProQuest Health & Medical Complete
ProQuest One Academic UKI Edition
ProQuest Nursing & Allied Health Source (Alumni)
Engineering Research Database
ProQuest One Academic
ProQuest One Academic (New)
Technology Collection
Technology Research Database
ProQuest One Academic Middle East (New)
ProQuest Health & Medical Complete (Alumni)
ProQuest Central (Alumni Edition)
ProQuest One Community College
ProQuest One Health & Nursing
Research Library (Alumni Edition)
ProQuest Natural Science Collection
ProQuest Pharma Collection
ProQuest Central
ProQuest Health & Medical Research Collection
Health and Medicine Complete (Alumni Edition)
ProQuest Central Korea
ProQuest Research Library
ProQuest Computing
ProQuest Central Basic
ProQuest Computing (Alumni Edition)
ProQuest Nursing & Allied Health Source
ProQuest SciTech Collection
Advanced Technologies & Aerospace Database
ProQuest Medical Library
Biochemistry Abstracts 1
ProQuest Central (Alumni)
MEDLINE - Academic
DatabaseTitleList

MEDLINE - Academic
Research Library Prep


Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Medicine
EISSN 1879-0534
EndPage 104866
ExternalDocumentID PMC8445768
10_1016_j_compbiomed_2021_104866
S0010482521006600
1_s2_0_S0010482521006600
GroupedDBID ---
--K
--M
--Z
-~X
.1-
.55
.DC
.FO
.GJ
.~1
0R~
1B1
1P~
1RT
1~.
1~5
29F
4.4
457
4G.
53G
5GY
5VS
7-5
71M
77I
7RV
7X7
88E
8AO
8FE
8FG
8FH
8FI
8FJ
8G5
8P~
9JN
AAEDT
AAEDW
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AATTM
AAXKI
AAXUO
AAYFN
AAYWO
ABBOA
ABFNM
ABJNI
ABMAC
ABMZM
ABOCM
ABUWG
ABWVN
ABXDB
ACDAQ
ACGFS
ACIEU
ACIUM
ACIWK
ACLOT
ACNNM
ACPRK
ACRLP
ACRPL
ACVFH
ACZNC
ADBBV
ADCNI
ADEZE
ADJOM
ADMUD
ADNMO
AEBSH
AEIPS
AEKER
AENEX
AEUPX
AEVXI
AFJKZ
AFKRA
AFPUW
AFRAH
AFRHN
AFTJW
AFXIZ
AGHFR
AGQPQ
AGUBO
AGYEJ
AHHHB
AHMBA
AHZHX
AIALX
AIEXJ
AIGII
AIIUN
AIKHN
AITUG
AJRQY
AJUYK
AKBMS
AKRWK
AKYEP
ALMA_UNASSIGNED_HOLDINGS
AMRAJ
ANKPU
ANZVX
AOUOD
APXCP
ARAPS
ASPBG
AVWKF
AXJTR
AZFZN
AZQEC
BBNVY
BENPR
BGLVJ
BHPHI
BKEYQ
BKOJK
BLXMC
BNPGV
BPHCQ
BVXVI
CCPQU
CS3
DU5
DWQXO
EBS
EFJIC
EFKBS
EFLBG
EJD
EMOBN
EO8
EO9
EP2
EP3
EX3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
FYUFA
G-2
G-Q
GBLVA
GBOLZ
GNUQQ
GUQSH
HCIFZ
HLZ
HMCUK
HMK
HMO
HVGLF
HZ~
IHE
J1W
K6V
K7-
KOM
LK8
LX9
M1P
M29
M2O
M41
M7P
MO0
N9A
NAPCQ
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
P62
PC.
PHGZM
PHGZT
PJZUB
PPXIY
PQGLB
PQQKQ
PROAC
PSQYO
Q38
R2-
ROL
RPZ
RXW
SAE
SBC
SCC
SDF
SDG
SDP
SEL
SES
SEW
SPC
SPCBC
SSH
SSV
SSZ
SV3
T5K
TAE
UAP
UKHRP
WOW
WUQ
X7M
XPP
Z5R
ZGI
~G-
~HD
3V.
AACTN
AFCTW
AFKWA
AJOXV
ALIPV
AMFUW
M0N
RIG
AAIAV
ABLVK
ABYKQ
AHPSJ
AJBFU
LCYCR
9DU
AAYXX
AFFHD
CITATION
7XB
8AL
8FD
8FK
FR3
JQ2
K9.
M7Z
MBDVC
P64
PKEHL
PQEST
PQUKI
PRINS
Q9U
7X8
PUEGO
5PM
ID FETCH-LOGICAL-c546t-7b7c5e75dcf05926d6091fb6181adc522b68d796e3a61f051b444e886718dbad3
IEDL.DBID K7-
ISICitedReferencesCount 35
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000705435800008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0010-4825
1879-0534
IngestDate Tue Nov 04 02:01:55 EST 2025
Thu Oct 02 11:31:22 EDT 2025
Sat Nov 29 14:52:51 EST 2025
Sat Nov 29 07:02:29 EST 2025
Tue Nov 18 21:08:17 EST 2025
Fri Feb 23 02:43:32 EST 2024
Tue Feb 25 20:08:37 EST 2025
Tue Oct 14 19:33:08 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Keywords COVID-19
ECA
Medical conditions
Coronavirus disease 2019
Evolutionary clustering algorithm star
iECA
Improved evolutionary clustering algorithm star
Language English
License Since January 2020 Elsevier has created a COVID-19 resource centre with free information in English and Mandarin on the novel coronavirus COVID-19. The COVID-19 resource centre is hosted on Elsevier Connect, the company's public news and information website. Elsevier hereby grants permission to make all its COVID-19-related research that is available on the COVID-19 resource centre - including this research content - immediately available in PubMed Central and other publicly funded repositories, such as the WHO COVID database with rights for unrestricted research re-use and analyses in any form or by any means with acknowledgement of the original source. These permissions are granted for free by Elsevier for as long as the COVID-19 resource centre remains active.
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c546t-7b7c5e75dcf05926d6091fb6181adc522b68d796e3a61f051b444e886718dbad3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ORCID 0000-0002-4476-9351
OpenAccessLink https://pubmed.ncbi.nlm.nih.gov/PMC8445768
PMID 34598065
PQID 2586977405
PQPubID 1226355
PageCount 1
ParticipantIDs pubmedcentral_primary_oai_pubmedcentral_nih_gov_8445768
proquest_miscellaneous_2578760944
proquest_journals_2586977405
crossref_primary_10_1016_j_compbiomed_2021_104866
crossref_citationtrail_10_1016_j_compbiomed_2021_104866
elsevier_sciencedirect_doi_10_1016_j_compbiomed_2021_104866
elsevier_clinicalkeyesjournals_1_s2_0_S0010482521006600
elsevier_clinicalkey_doi_10_1016_j_compbiomed_2021_104866
PublicationCentury 2000
PublicationDate 2021-11-01
PublicationDateYYYYMMDD 2021-11-01
PublicationDate_xml – month: 11
  year: 2021
  text: 2021-11-01
  day: 01
PublicationDecade 2020
PublicationPlace Oxford
PublicationPlace_xml – name: Oxford
PublicationTitle Computers in biology and medicine
PublicationYear 2021
Publisher Elsevier Ltd
Elsevier Limited
Publisher_xml – name: Elsevier Ltd
– name: Elsevier Limited
References (bib14) 2020
Lughofer (bib16) 2012; 3
Pavai, V Geetha (bib30) 2016; 49
Jain (bib3) 2010; 31
Lapp (bib29) 2019
B.A. Hassan, S.M. Qader, A new framework to adopt multidimensional databases for organizational information sys-tem strategies, (n.d.).
Hassan, Rashid, Mirjalili (bib8) 2021
Visalakshi, Suguna (bib17) 2009
Suthaharan (bib33) 2016
Hassani, Seidl (bib39) 2017; 4
Hassan, Rashid (bib13) 2021
Ghosal, Nandy, Das, Goswami, Panday (bib1) 2020
Forsyth Richard (bib26) 1990
Cho, Hoang (bib34) 2017; 2017
Islam, Estivill-Castro, Rahman, Bossomaier (bib31) 2018; 91
Hassan, Ahmed, Saeed, Saeed (bib47) 2016; 1
Rashid, Star, Repos (bib22) 2021
Rubini (bib28) 2015
Hassan (bib49) 2021
(bib21) 2019
Hassan, Rashid (bib7) 2021
Umargono, Suseno, Gunawan (bib20) 2020
Omran, Engelbrecht, Salman (bib24) 2007; 11
B.H.H. K (bib25) 2020
Evalclusters (bib42)
Fränti, Sieranoja (bib2) 2018; 48
Chen, Zou, Lu, Li (bib19) 2019; 473
Khanmohammadi, Adibeig, Shanehbandy (bib9) 2017; 67
Arthur, Vassilvitskii, k-means (bib4) 2007
Zhang (bib36) 2016; 4
Davies, Bouldin (bib41) 1979
Hassan (bib45) 2020
Nova, Estévez (bib32) 2014; 25
Adak, Yumusak (bib35) 2016; 16
Saeed, Hassan, Qader (bib46) 2017; 2
Adam, Alexandropoulos, Pardalos, Vrahatis (bib44) 2019
Civicioglu (bib15) 2013; 219
Kocakalay (bib27) 2020
Pryke, Mostaghim, Nazemi (bib43) 2007
B. Hassan, S. Dasmahapatra, Towards semantic web: challenges and needs, (n.d.).
Hassan, Rashid (bib11) 2020; 28
Maulik, Bandyopadhyay (bib5) 2000; 33
Janani, Vijayarani (bib40) 2019; 134
Hassan, Rashid, Mirjalili (bib12) 2021
Bholowalia, Kumar (bib23) 2014; 105
Ruan, Xue, Liu, Tan, Li (bib37) 2017; 56
Zhuang, Cai, Wang, Zhang, Zheng (bib38) 2020
Tsymbal, Bolshakova, Cunningham (bib10) 2004
Ezugwu, Shukla, Agbaje, Oyelade, José-García, Agushaka (bib18) 2020
Hassan, Rashid (bib6) 2019
Arthur (10.1016/j.compbiomed.2021.104866_bib4) 2007
B.H.H. K (10.1016/j.compbiomed.2021.104866_bib25)
10.1016/j.compbiomed.2021.104866_bib50
Civicioglu (10.1016/j.compbiomed.2021.104866_bib15) 2013; 219
Kocakalay (10.1016/j.compbiomed.2021.104866_bib27)
Adak (10.1016/j.compbiomed.2021.104866_bib35) 2016; 16
Adam (10.1016/j.compbiomed.2021.104866_bib44) 2019
Rubini (10.1016/j.compbiomed.2021.104866_bib28) 2015
Ezugwu (10.1016/j.compbiomed.2021.104866_bib18) 2020
Rashid (10.1016/j.compbiomed.2021.104866_bib22)
Maulik (10.1016/j.compbiomed.2021.104866_bib5) 2000; 33
Lapp (10.1016/j.compbiomed.2021.104866_bib29) 2019
Chen (10.1016/j.compbiomed.2021.104866_bib19) 2019; 473
Suthaharan (10.1016/j.compbiomed.2021.104866_bib33) 2016
Zhuang (10.1016/j.compbiomed.2021.104866_bib38) 2020
Lughofer (10.1016/j.compbiomed.2021.104866_bib16) 2012; 3
Janani (10.1016/j.compbiomed.2021.104866_bib40) 2019; 134
Hassan (10.1016/j.compbiomed.2021.104866_bib49) 2021
Hassan (10.1016/j.compbiomed.2021.104866_bib47) 2016; 1
Forsyth Richard (10.1016/j.compbiomed.2021.104866_bib26) 1990
Ghosal (10.1016/j.compbiomed.2021.104866_bib1) 2020
Hassan (10.1016/j.compbiomed.2021.104866_bib12) 2021
Ruan (10.1016/j.compbiomed.2021.104866_bib37) 2017; 56
Islam (10.1016/j.compbiomed.2021.104866_bib31) 2018; 91
Davies (10.1016/j.compbiomed.2021.104866_bib41) 1979
Tsymbal (10.1016/j.compbiomed.2021.104866_bib10) 2004
Hassan (10.1016/j.compbiomed.2021.104866_bib7) 2021
Hassan (10.1016/j.compbiomed.2021.104866_bib11) 2020; 28
Visalakshi (10.1016/j.compbiomed.2021.104866_bib17) 2009
Khanmohammadi (10.1016/j.compbiomed.2021.104866_bib9) 2017; 67
Saeed (10.1016/j.compbiomed.2021.104866_bib46) 2017; 2
Hassan (10.1016/j.compbiomed.2021.104866_bib45) 2020
Hassan (10.1016/j.compbiomed.2021.104866_bib6) 2019
Omran (10.1016/j.compbiomed.2021.104866_bib24) 2007; 11
(10.1016/j.compbiomed.2021.104866_bib14) 2020
Bholowalia (10.1016/j.compbiomed.2021.104866_bib23) 2014; 105
Pryke (10.1016/j.compbiomed.2021.104866_bib43) 2007
Hassan (10.1016/j.compbiomed.2021.104866_bib13) 2021
10.1016/j.compbiomed.2021.104866_bib48
Fränti (10.1016/j.compbiomed.2021.104866_bib2) 2018; 48
Hassani (10.1016/j.compbiomed.2021.104866_bib39) 2017; 4
Pavai (10.1016/j.compbiomed.2021.104866_bib30) 2016; 49
Evalclusters (10.1016/j.compbiomed.2021.104866_bib42)
Zhang (10.1016/j.compbiomed.2021.104866_bib36) 2016; 4
Umargono (10.1016/j.compbiomed.2021.104866_bib20) 2020
Cho (10.1016/j.compbiomed.2021.104866_bib34) 2017; 2017
Jain (10.1016/j.compbiomed.2021.104866_bib3) 2010; 31
Hassan (10.1016/j.compbiomed.2021.104866_bib8) 2021
Nova (10.1016/j.compbiomed.2021.104866_bib32) 2014; 25
References_xml – year: 2021
  ident: bib13
  article-title: Artificial intelligence algorithms for natural language processing and the semantic web ontology learning
  publication-title: ArXiv Prepr
– volume: 105
  year: 2014
  ident: bib23
  article-title: EBK-means: a clustering technique based on elbow method and k-means in WSN
  publication-title: Int. J. Comput. Appl.
– reference: B. Hassan, S. Dasmahapatra, Towards semantic web: challenges and needs, (n.d.).
– volume: 91
  start-page: 402
  year: 2018
  end-page: 417
  ident: bib31
  article-title: Combining k-means and a genetic algorithm through a novel arrangement of genetic operators for high quality clustering
  publication-title: Expert Syst. Appl.
– volume: 473
  start-page: 202
  year: 2019
  end-page: 226
  ident: bib19
  article-title: Backtracking search optimization algorithm based on knowledge learning
  publication-title: Inf. Sci. (Ny)
– volume: 67
  start-page: 12
  year: 2017
  end-page: 18
  ident: bib9
  article-title: An improved overlapping k-means clustering method for medical applications
  publication-title: Expert Syst. Appl.
– start-page: 576
  year: 2004
  end-page: 581
  ident: bib10
  article-title: Ensemble clustering in medical diagnostics
  publication-title: Proceedings. 17th IEEE Symp. Comput. Med. Syst.
– year: 2021
  ident: bib49
  article-title: Analysis for the overwhelming success of the web compared to microcosm and hyper-G systems
  publication-title: ArXiv Prepr
– volume: 11
  start-page: 583
  year: 2007
  end-page: 605
  ident: bib24
  article-title: An overview of clustering methods
  publication-title: Intell. Data Anal.
– volume: 31
  start-page: 651
  year: 2010
  end-page: 666
  ident: bib3
  article-title: Data clustering: 50 years beyond K-means
  publication-title: Pattern Recogn. Lett.
– year: 2019
  ident: bib21
  article-title: Natural computational intelligence research center
– start-page: 361
  year: 2007
  end-page: 375
  ident: bib43
  article-title: Heatmap visualization of population based multi objective algorithms
  publication-title: Int. Conf. Evol. Multi-Criterion Optim.
– volume: 1
  start-page: 1
  year: 2016
  end-page: 7
  ident: bib47
  article-title: Evaluating e-government services in kurdistan institution for strategic studies and scientific research using the EGOVSAT model
  publication-title: Kurdistan J. Appl. Res.
– volume: 33
  start-page: 1455
  year: 2000
  end-page: 1465
  ident: bib5
  article-title: Genetic algorithm-based clustering technique
  publication-title: Pattern Recogn.
– start-page: 207
  year: 2016
  end-page: 235
  ident: bib33
  article-title: Support vector machine
  publication-title: Mach. Learn. Model. Algorithms Big Data Classif.
– volume: 56
  start-page: 3496
  year: 2017
  end-page: 3507
  ident: bib37
  article-title: Quantum algorithm for k-nearest neighbors classification based on the metric of hamming distance
  publication-title: Int. J. Theor. Phys.
– start-page: 57
  year: 2019
  end-page: 82
  ident: bib44
  article-title: No free lunch theorem: a review
  publication-title: Approx. Optim.
– start-page: 1027
  year: 2007
  end-page: 1035
  ident: bib4
  article-title: The advantages of careful seeding
  publication-title: Proc. Eighteenth Annu. ACM-SIAM Symp. Discret. Algorithms, Society for Industrial and Applied Mathematics
– ident: bib42
  article-title: Evaluate clustering solutions
– volume: 4
  year: 2016
  ident: bib36
  article-title: Introduction to machine learning: k-nearest neighbors
  publication-title: Ann. Transl. Med.
– volume: 134
  start-page: 192
  year: 2019
  end-page: 200
  ident: bib40
  article-title: Text document clustering using spectral clustering algorithm with particle swarm optimization
  publication-title: Expert Syst. Appl.
– start-page: 124919
  year: 2019
  ident: bib6
  article-title: Operational framework for recent advances in backtracking search optimisation algorithm: a systematic review and performance evaluation
  publication-title: Appl. Math. Comput.
– year: 2020
  ident: bib27
  article-title: Diabets dataset
– year: 2020
  ident: bib25
  article-title: COVID-19 symptoms checker
– start-page: 69
  year: 2020
  end-page: 83
  ident: bib1
  article-title: A short review on different clustering techniques and their applications
  publication-title: Emerg. Technol. Model. Graph.
– volume: 25
  start-page: 511
  year: 2014
  end-page: 524
  ident: bib32
  article-title: A review of learning vector quantization classifiers
  publication-title: Neural Comput. Appl.
– year: 2021
  ident: bib22
– year: 2015
  ident: bib28
  article-title: UCI machine learning repository
– reference: B.A. Hassan, S.M. Qader, A new framework to adopt multidimensional databases for organizational information sys-tem strategies, (n.d.).
– year: 2020
  ident: bib14
  article-title: A multi-disciplinary ensemble algorithm for clustering heterogeneous datasets, neural comput
  publication-title: Appl
– volume: 16
  start-page: 304
  year: 2016
  ident: bib35
  article-title: Classification of E-nose aroma data of four fruit types by ABC-based neural network
  publication-title: Sensors
– year: 2021
  ident: bib7
  article-title: A multidisciplinary ensemble algorithm for clustering heterogeneous datasets, Neural Comput
  publication-title: Appl
– volume: 2017
  year: 2017
  ident: bib34
  article-title: Feature selection and parameters optimization of SVM using particle swarm optimization for fault classification in power distribution systems
  publication-title: Comput. Intell. Neurosci.
– volume: 49
  start-page: 1
  year: 2016
  end-page: 43
  ident: bib30
  article-title: A survey on crossover operators
  publication-title: ACM Comput. Surv.
– start-page: 107044
  year: 2021
  ident: bib8
  article-title: Performance evaluation results of evolutionary clustering algorithm star for clustering heterogeneous datasets
  publication-title: Data Br
– volume: 3
  start-page: 135
  year: 2012
  end-page: 151
  ident: bib16
  article-title: A dynamic split-and-merge approach for evolving cluster models
  publication-title: Evol. Syst.
– volume: 4
  start-page: 171
  year: 2017
  end-page: 183
  ident: bib39
  article-title: Using internal evaluation measures to validate the quality of diverse stream clustering algorithms
  publication-title: Vietnam J. Comput. Sci.
– start-page: 1
  year: 2021
  end-page: 16
  ident: bib12
  article-title: Formal context reduction in deriving concept hierarchies from corpora using adaptive evolutionary clustering algorithm star
  publication-title: Complex Intell. Syst.
– volume: 2
  start-page: 92
  year: 2017
  end-page: 97
  ident: bib46
  article-title: An optimized framework to adopt computer laboratory administrations for operating system and application installations
  publication-title: Kurdistan J. Appl. Res.
– start-page: 127
  year: 2020
  end-page: 136
  ident: bib38
  article-title: Deep kNN for medical image classification
  publication-title: Int. Conf. Med. Image Comput. Comput. Interv.
– start-page: 1
  year: 2009
  end-page: 6
  ident: bib17
  article-title: K-means clustering using Max-min distance measure
  publication-title: NAFIPS 2009-2009 Annu. Meet. North Am. Fuzzy Inf. Process. Soc
– year: 1990
  ident: bib26
  article-title: UCI machine learning repository
– start-page: 1
  year: 2020
  end-page: 60
  ident: bib18
  article-title: Automatic clustering algorithms: a systematic review and bibliometric analysis of relevant literature
  publication-title: Neural Comput. Appl.
– start-page: 1
  year: 2020
  end-page: 20
  ident: bib45
  article-title: CSCF: a chaotic sine cosine firefly algorithm for practical application problems
  publication-title: Neural Comput. Appl.
– year: 2019
  ident: bib29
  article-title: Heart Disease Dataset
– volume: 48
  start-page: 4743
  year: 2018
  end-page: 4759
  ident: bib2
  article-title: K-means properties on six clustering benchmark datasets
  publication-title: Appl. Intell.
– volume: 28
  start-page: 105046
  year: 2020
  ident: bib11
  article-title: Datasets on statistical analysis and performance evaluation of backtracking search optimisation algorithm compared with its counterpart algorithms
  publication-title: Data Br
– start-page: 121
  year: 2020
  end-page: 129
  ident: bib20
  article-title: K-means clustering optimization using the elbow method and early centroid determination based on mean and median formula
  publication-title: 2nd Int. Semin. Sci. Technol. (ISSTEC 2019)
– start-page: 224
  year: 1979
  end-page: 227
  ident: bib41
  article-title: A cluster separation measure
  publication-title: IEEE Trans. Pattern Anal. Mach. Intell.
– volume: 219
  start-page: 8121
  year: 2013
  end-page: 8144
  ident: bib15
  article-title: Backtracking search optimization algorithm for numerical optimization problems
  publication-title: Appl. Math. Comput.
– volume: 49
  start-page: 1
  year: 2016
  ident: 10.1016/j.compbiomed.2021.104866_bib30
  article-title: A survey on crossover operators
  publication-title: ACM Comput. Surv.
  doi: 10.1145/3009966
– volume: 11
  start-page: 583
  year: 2007
  ident: 10.1016/j.compbiomed.2021.104866_bib24
  article-title: An overview of clustering methods
  publication-title: Intell. Data Anal.
  doi: 10.3233/IDA-2007-11602
– start-page: 576
  year: 2004
  ident: 10.1016/j.compbiomed.2021.104866_bib10
  article-title: Ensemble clustering in medical diagnostics
– ident: 10.1016/j.compbiomed.2021.104866_bib22
– volume: 219
  start-page: 8121
  year: 2013
  ident: 10.1016/j.compbiomed.2021.104866_bib15
  article-title: Backtracking search optimization algorithm for numerical optimization problems
  publication-title: Appl. Math. Comput.
– start-page: 1
  year: 2020
  ident: 10.1016/j.compbiomed.2021.104866_bib45
  article-title: CSCF: a chaotic sine cosine firefly algorithm for practical application problems
  publication-title: Neural Comput. Appl.
– volume: 33
  start-page: 1455
  year: 2000
  ident: 10.1016/j.compbiomed.2021.104866_bib5
  article-title: Genetic algorithm-based clustering technique
  publication-title: Pattern Recogn.
  doi: 10.1016/S0031-3203(99)00137-5
– volume: 4
  year: 2016
  ident: 10.1016/j.compbiomed.2021.104866_bib36
  article-title: Introduction to machine learning: k-nearest neighbors
  publication-title: Ann. Transl. Med.
  doi: 10.21037/atm.2016.03.37
– start-page: 224
  year: 1979
  ident: 10.1016/j.compbiomed.2021.104866_bib41
  article-title: A cluster separation measure
  publication-title: IEEE Trans. Pattern Anal. Mach. Intell.
  doi: 10.1109/TPAMI.1979.4766909
– start-page: 1027
  year: 2007
  ident: 10.1016/j.compbiomed.2021.104866_bib4
  article-title: The advantages of careful seeding
– volume: 91
  start-page: 402
  year: 2018
  ident: 10.1016/j.compbiomed.2021.104866_bib31
  article-title: Combining k-means and a genetic algorithm through a novel arrangement of genetic operators for high quality clustering
  publication-title: Expert Syst. Appl.
  doi: 10.1016/j.eswa.2017.09.005
– volume: 25
  start-page: 511
  year: 2014
  ident: 10.1016/j.compbiomed.2021.104866_bib32
  article-title: A review of learning vector quantization classifiers
  publication-title: Neural Comput. Appl.
  doi: 10.1007/s00521-013-1535-3
– ident: 10.1016/j.compbiomed.2021.104866_bib50
– start-page: 1
  year: 2021
  ident: 10.1016/j.compbiomed.2021.104866_bib12
  article-title: Formal context reduction in deriving concept hierarchies from corpora using adaptive evolutionary clustering algorithm star
  publication-title: Complex Intell. Syst.
– start-page: 124919
  year: 2019
  ident: 10.1016/j.compbiomed.2021.104866_bib6
  article-title: Operational framework for recent advances in backtracking search optimisation algorithm: a systematic review and performance evaluation
  publication-title: Appl. Math. Comput.
– volume: 2017
  year: 2017
  ident: 10.1016/j.compbiomed.2021.104866_bib34
  article-title: Feature selection and parameters optimization of SVM using particle swarm optimization for fault classification in power distribution systems
  publication-title: Comput. Intell. Neurosci.
  doi: 10.1155/2017/4135465
– start-page: 57
  year: 2019
  ident: 10.1016/j.compbiomed.2021.104866_bib44
  article-title: No free lunch theorem: a review
  publication-title: Approx. Optim.
  doi: 10.1007/978-3-030-12767-1_5
– start-page: 1
  year: 2020
  ident: 10.1016/j.compbiomed.2021.104866_bib18
  article-title: Automatic clustering algorithms: a systematic review and bibliometric analysis of relevant literature
  publication-title: Neural Comput. Appl.
– start-page: 1
  year: 2009
  ident: 10.1016/j.compbiomed.2021.104866_bib17
  article-title: K-means clustering using Max-min distance measure
– start-page: 207
  year: 2016
  ident: 10.1016/j.compbiomed.2021.104866_bib33
  article-title: Support vector machine
– start-page: 121
  year: 2020
  ident: 10.1016/j.compbiomed.2021.104866_bib20
  article-title: K-means clustering optimization using the elbow method and early centroid determination based on mean and median formula
– start-page: 361
  year: 2007
  ident: 10.1016/j.compbiomed.2021.104866_bib43
  article-title: Heatmap visualization of population based multi objective algorithms
– start-page: 69
  year: 2020
  ident: 10.1016/j.compbiomed.2021.104866_bib1
  article-title: A short review on different clustering techniques and their applications
– volume: 4
  start-page: 171
  year: 2017
  ident: 10.1016/j.compbiomed.2021.104866_bib39
  article-title: Using internal evaluation measures to validate the quality of diverse stream clustering algorithms
  publication-title: Vietnam J. Comput. Sci.
  doi: 10.1007/s40595-016-0086-9
– volume: 56
  start-page: 3496
  year: 2017
  ident: 10.1016/j.compbiomed.2021.104866_bib37
  article-title: Quantum algorithm for k-nearest neighbors classification based on the metric of hamming distance
  publication-title: Int. J. Theor. Phys.
  doi: 10.1007/s10773-017-3514-4
– volume: 2
  start-page: 92
  year: 2017
  ident: 10.1016/j.compbiomed.2021.104866_bib46
  article-title: An optimized framework to adopt computer laboratory administrations for operating system and application installations
  publication-title: Kurdistan J. Appl. Res.
  doi: 10.24017/science.2017.3.8
– year: 2021
  ident: 10.1016/j.compbiomed.2021.104866_bib13
  article-title: Artificial intelligence algorithms for natural language processing and the semantic web ontology learning
  publication-title: ArXiv Prepr
– year: 2020
  ident: 10.1016/j.compbiomed.2021.104866_bib14
  article-title: A multi-disciplinary ensemble algorithm for clustering heterogeneous datasets, neural comput
  publication-title: Appl
– volume: 48
  start-page: 4743
  year: 2018
  ident: 10.1016/j.compbiomed.2021.104866_bib2
  article-title: K-means properties on six clustering benchmark datasets
  publication-title: Appl. Intell.
  doi: 10.1007/s10489-018-1238-7
– volume: 3
  start-page: 135
  year: 2012
  ident: 10.1016/j.compbiomed.2021.104866_bib16
  article-title: A dynamic split-and-merge approach for evolving cluster models
  publication-title: Evol. Syst.
  doi: 10.1007/s12530-012-9046-5
– volume: 31
  start-page: 651
  year: 2010
  ident: 10.1016/j.compbiomed.2021.104866_bib3
  article-title: Data clustering: 50 years beyond K-means
  publication-title: Pattern Recogn. Lett.
  doi: 10.1016/j.patrec.2009.09.011
– volume: 105
  year: 2014
  ident: 10.1016/j.compbiomed.2021.104866_bib23
  article-title: EBK-means: a clustering technique based on elbow method and k-means in WSN
  publication-title: Int. J. Comput. Appl.
– start-page: 127
  year: 2020
  ident: 10.1016/j.compbiomed.2021.104866_bib38
  article-title: Deep kNN for medical image classification
– year: 2019
  ident: 10.1016/j.compbiomed.2021.104866_bib29
– year: 1990
  ident: 10.1016/j.compbiomed.2021.104866_bib26
– year: 2021
  ident: 10.1016/j.compbiomed.2021.104866_bib7
  article-title: A multidisciplinary ensemble algorithm for clustering heterogeneous datasets, Neural Comput
  publication-title: Appl
– ident: 10.1016/j.compbiomed.2021.104866_bib25
– volume: 134
  start-page: 192
  year: 2019
  ident: 10.1016/j.compbiomed.2021.104866_bib40
  article-title: Text document clustering using spectral clustering algorithm with particle swarm optimization
  publication-title: Expert Syst. Appl.
  doi: 10.1016/j.eswa.2019.05.030
– year: 2021
  ident: 10.1016/j.compbiomed.2021.104866_bib49
  article-title: Analysis for the overwhelming success of the web compared to microcosm and hyper-G systems
  publication-title: ArXiv Prepr
– year: 2015
  ident: 10.1016/j.compbiomed.2021.104866_bib28
– start-page: 107044
  year: 2021
  ident: 10.1016/j.compbiomed.2021.104866_bib8
  article-title: Performance evaluation results of evolutionary clustering algorithm star for clustering heterogeneous datasets
  publication-title: Data Br
  doi: 10.1016/j.dib.2021.107044
– ident: 10.1016/j.compbiomed.2021.104866_bib48
– volume: 16
  start-page: 304
  year: 2016
  ident: 10.1016/j.compbiomed.2021.104866_bib35
  article-title: Classification of E-nose aroma data of four fruit types by ABC-based neural network
  publication-title: Sensors
  doi: 10.3390/s16030304
– volume: 67
  start-page: 12
  year: 2017
  ident: 10.1016/j.compbiomed.2021.104866_bib9
  article-title: An improved overlapping k-means clustering method for medical applications
  publication-title: Expert Syst. Appl.
  doi: 10.1016/j.eswa.2016.09.025
– ident: 10.1016/j.compbiomed.2021.104866_bib42
– volume: 1
  start-page: 1
  year: 2016
  ident: 10.1016/j.compbiomed.2021.104866_bib47
  article-title: Evaluating e-government services in kurdistan institution for strategic studies and scientific research using the EGOVSAT model
  publication-title: Kurdistan J. Appl. Res.
  doi: 10.24017/science.2016.1.2.2
– volume: 28
  start-page: 105046
  year: 2020
  ident: 10.1016/j.compbiomed.2021.104866_bib11
  article-title: Datasets on statistical analysis and performance evaluation of backtracking search optimisation algorithm compared with its counterpart algorithms
  publication-title: Data Br
  doi: 10.1016/j.dib.2019.105046
– volume: 473
  start-page: 202
  year: 2019
  ident: 10.1016/j.compbiomed.2021.104866_bib19
  article-title: Backtracking search optimization algorithm based on knowledge learning
  publication-title: Inf. Sci. (Ny)
  doi: 10.1016/j.ins.2018.09.039
– ident: 10.1016/j.compbiomed.2021.104866_bib27
SSID ssj0004030
Score 2.5205834
Snippet With the increasing number of samples, the manual clustering of COVID-19 and medical disease data samples becomes time-consuming and requires highly skilled...
AbstractWith the increasing number of samples, the manual clustering of COVID-19 and medical disease data samples becomes time-consuming and requires highly...
SourceID pubmedcentral
proquest
crossref
elsevier
SourceType Open Access Repository
Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 104866
SubjectTerms Algorithms
Chromosomes
Clustering
Coronavirus disease 2019
Coronaviruses
COVID-19
Data processing
Datasets
Decision making
Disease
ECA
Elbow
Evolutionary algorithms
Evolutionary clustering algorithm star
Genetic algorithms
iECA
Improved evolutionary clustering algorithm star
Internal Medicine
Medical conditions
Medical research
Methods
Multidimensional data
Mutation
Noise
Other
Performance evaluation
Statistical methods
Stellar evolution
Title A novel cluster detection of COVID-19 patients and medical disease conditions using improved evolutionary clustering algorithm star
URI https://www.clinicalkey.com/#!/content/1-s2.0-S0010482521006600
https://www.clinicalkey.es/playcontent/1-s2.0-S0010482521006600
https://dx.doi.org/10.1016/j.compbiomed.2021.104866
https://www.proquest.com/docview/2586977405
https://www.proquest.com/docview/2578760944
https://pubmed.ncbi.nlm.nih.gov/PMC8445768
Volume 138
WOSCitedRecordID wos000705435800008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1879-0534
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0004030
  issn: 0010-4825
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 1879-0534
  dateEnd: 20231231
  omitProxy: false
  ssIdentifier: ssj0004030
  issn: 0010-4825
  databaseCode: P5Z
  dateStart: 20030101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Biological Science Database
  customDbUrl:
  eissn: 1879-0534
  dateEnd: 20231231
  omitProxy: false
  ssIdentifier: ssj0004030
  issn: 0010-4825
  databaseCode: M7P
  dateStart: 20030101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/biologicalscijournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 1879-0534
  dateEnd: 20231231
  omitProxy: false
  ssIdentifier: ssj0004030
  issn: 0010-4825
  databaseCode: K7-
  dateStart: 20030101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Health & Medical Collection
  customDbUrl:
  eissn: 1879-0534
  dateEnd: 20231231
  omitProxy: false
  ssIdentifier: ssj0004030
  issn: 0010-4825
  databaseCode: 7X7
  dateStart: 20030101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/healthcomplete
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Nursing & Allied Health Database
  customDbUrl:
  eissn: 1879-0534
  dateEnd: 20231231
  omitProxy: false
  ssIdentifier: ssj0004030
  issn: 0010-4825
  databaseCode: 7RV
  dateStart: 20030101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/nahs
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1879-0534
  dateEnd: 20231231
  omitProxy: false
  ssIdentifier: ssj0004030
  issn: 0010-4825
  databaseCode: BENPR
  dateStart: 20030101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Research Library
  customDbUrl:
  eissn: 1879-0534
  dateEnd: 20231231
  omitProxy: false
  ssIdentifier: ssj0004030
  issn: 0010-4825
  databaseCode: M2O
  dateStart: 20030101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/pqrl
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3db9MwELfYhhAvfE90jMpIvEbEiRM72gMaYxMIrasGTBUvlmM7W1GXjKatxDP_OHeJ067ShCrxci_xyWnuev6d74uQtzGzmUwKHcgkzQMe2zSQjmVBUZgw1k7zrMibYRNiMJCjUTb0F261T6vsbGJjqG1l8I78XZTIFLFKmLy_-RXg1CiMrvoRGltkh0URQz3_IoJVXWQYtyUoYGs4uEI-k6fN78KU7bbEHbzEiGGwUza9Eu88nm7Bz_XkyVun0cnj__0dT8gjj0PpYas4T8k9Vz4jD059pP05-XNIy2rhJtRM5thLgVo3a7K2SloV9Ojs4vPHgGXUt2WtqS4tvW6DPtQHfSi42rbNCKOYXn9Jx80NhrPULbzG6-nvbgdcoCeX8K6zq2sKoHX6gnw_Of529CnwAxsCk_B0FohcmMSJxJoCUFuU2hTQSJGngCK0NYD08lRakaUu1imDJSznnDuJLfakzbWNd8l2WZXuJaEO4HRk8yxyDhBbnmgpDIBTm8tQGMl4j4hOTsr4buY4VGOiurS1n2olYYUSVq2Ee4QtOW_ajh4b8GSdKqiuYhVsrIJjZwNecRevq72xqBVTdaRC9bXplQRqCl44AMEw7JGDJafHQy3O2XDf_U4B1XKrlfb1yJvlY7AoGCbSpavmuAaMOEiO40de0_Xl98Ke5OtPyvFV05tcco4e7N6_N39FHuKbtjWd-2R7Np271-S-WczG9bRPtsT5BdKRaKjsk50Px4Pheb_5ewM9jc6QiiHQYfLjL5KOXE0
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9NAEF6VgoALb9RAgUWCo4XXXttrIYSqlqpR24CgVL0t6911myq1S5wE9cz_4Tcy47WdRqpQLj1w9k42Gs_jG8-LkDchM6mIcuWJKM48HprYE5alXp5rP1RW8TTP6mUTyWAgjo7SLyvkT9sLg2WVrU2sDbUpNX4jfxdEIkas4kcfz396uDUKs6vtCg0nFrv24heEbNWH_ha837dBsP3pYHPHa7YKeDri8cRLskRHNomMzgFaBLGJwWXmWQyuThkNcCSLhUnS2IYqZnCEZZxzK3AOnDCZMiH87g1yE-w4wxKy5OvhvA_TD13LC9g2DqFXUznk6smwRNy11ENUGjBMrop6NuOV7vAS3F0s1rzk_bbv_298e0DuNTibbjjFeEhWbPGI3N5vKgkek98btChndkT1aIqzIqixk7oqraBlTjc_H_a3PJbSZuxsRVVh6JlLatEmqUV1ifl-1FuK7QPHdFh_obGG2lmj0Wp80d6AB9ToGHgzOTmjAMrHT8j3a2HBU7JalIVdI9RCuBCYLA2sBUSaRUokGsC3yYSfaMF4jyStXEjdTGvHpSEj2Zblncq5REmUKOkkqkdYR3nuJpYsQZO2oifbjlzwIRLc6hK0yVW0tmqMYSWZrALpy2_1LChQi4Ah0PX9HnnfUTZ4z-G4Je9dbwVedlfNpb1HXnePwWJiGkwVtpziGXBS8OY4MnlBtzp-4cz1xSfF8KSevS44xwj92b8vf0Xu7Bzs78m9_mD3ObmL_9r1r66T1cl4al-QW3o2GVbjl7UBoeTHdWveX6Xasas
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9NAEF6VgiouvBGBAosER6tee22vhRCqGiKiQKjEQ70t6911G5TaJU6CeuZf8euYsddOI1Uolx44eycbjefxjedFyMuQmVREufJEFGceD03sCctSL8-1HyqreJpn9bKJZDwWR0fp4Rb50_bCYFllaxNrQ21Kjd_I94JIxIhV_Ggvd2URh_3B27OfHm6Qwkxru06jEZGRPf8F4Vv1ZtiHd_0qCAbvvhy899yGAU9HPJ57SZboyCaR0TnAjCA2MbjPPIvB7SmjAZpksTBJGttQxQyOsIxzbgXOhBMmUyaE371GroMXjlDHRom36sn0w6b9BewchzDMVRE1tWVYLt6010OEGjBMtIp6TuOlrvEC9F0v3LzgCQe3_2ce3iG3HP6m-43C3CVbtrhHdj66CoP75Pc-LcqlnVI9XeAMCWrsvK5WK2iZ04NP34Z9j6XUjaOtqCoMPW2SXdQlu6gusQ4A9ZliW8ExndRfbqyhduk0Xc3O2xvwgJoeA2_mJ6cUwPrsAfl6JSx4SLaLsrCPCLUQRgQmSwNrAalmkRKJBlBuMuEnWjDeI0krI1K7Ke64TGQq23K9H3IlXRKlSzbS1SOsozxrJplsQJO2YijbTl3wLRLc7Qa0yWW0tnJGspJMVoH05ed6RhSoSMAQAPt-j7zuKB0ObPDdhvfutsIvu6tWkt8jL7rHYEkxPaYKWy7wDDgveHMcmbymZx2_cBb7-pNiclLPZBecY-T--N-XPyc7oHDyw3A8ekJu4p9u2lp3yfZ8trBPyQ29nE-q2bPallDy_aoV7y_nX7oH
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+novel+cluster+detection+of+COVID-19+patients+and+medical+disease+conditions+using+improved+evolutionary+clustering+algorithm+star&rft.jtitle=Computers+in+biology+and+medicine&rft.au=Hassan%2C+Bryar+A.&rft.au=Rashid%2C+Tarik+A.&rft.au=Hamarashid%2C+Hozan+K.&rft.date=2021-11-01&rft.pub=Elsevier+Ltd&rft.issn=0010-4825&rft.eissn=1879-0534&rft.volume=138&rft_id=info:doi/10.1016%2Fj.compbiomed.2021.104866&rft.externalDocID=S0010482521006600
thumbnail_m http://cvtisr.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fcdn.clinicalkey.com%2Fck-thumbnails%2F00104825%2Fcov200h.gif