Loading…

An Improved Water Flow Optimizer for Data Clustering

Recently, various meta-heuristic algorithms have been considered to allocate the data into different clusters based on similar information. These algorithms have obtained state of the art clustering results compared to traditional algorithms and proven their capability in the field of data clusterin...

Full description

Saved in:
Bibliographic Details
Published in:SN computer science 2024-07, Vol.5 (6), p.715, Article 715
Main Authors: Thakral, Prateek, Kumar, Yugal
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites cdi_FETCH-LOGICAL-c1150-3d68a1ca56552a6ddd6b45be090c294d9b6c4c47e85a445e7082cd154006c1a23
container_end_page
container_issue 6
container_start_page 715
container_title SN computer science
container_volume 5
creator Thakral, Prateek
Kumar, Yugal
description Recently, various meta-heuristic algorithms have been considered to allocate the data into different clusters based on similar information. These algorithms have obtained state of the art clustering results compared to traditional algorithms and proven their capability in the field of data clustering. This work presents an improved version of the water flow optimizer, called the IWFO algorithm for effective cluster analysis. The proposed IWFO algorithm handles the performance issues associated with the water flow optimizer algorithm such as random initialization, unbalanced search mechanism and local optima. The random initialization issues are handled through the gaussian map that can generate the initial population systematically. The search mechanism of the WFO algorithm is enhanced using the combination of non-linear functions and the previous best solution. The local optima issue is alleviated by using a neighbourhood search mechanism. The efficacy of the proposed IWFO algorithm is evaluated using benchmark clustering datasets and results are compared with popular clustering algorithms. The simulation results are assessed using intra-cluster distance (intra), standard deviation (SD), rank, accuracy rate (AR) and detection rate (DR) parameters. Some statistical tests are also performed to validate the efficiency of the proposed IWFO algorithm. The proposed IWFO algorithm improves the clustering results (average accuracy rate of more than 7%) compared to the original WFO.
doi_str_mv 10.1007/s42979-024-03048-0
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_3082048244</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3082048244</sourcerecordid><originalsourceid>FETCH-LOGICAL-c1150-3d68a1ca56552a6ddd6b45be090c294d9b6c4c47e85a445e7082cd154006c1a23</originalsourceid><addsrcrecordid>eNp9UE1LAzEQDaJgqf0DngKeo5PsJLt7LNVqodCL4jGkSSpbuh8mu4r-elNX0JOX-WDevJn3CLnkcM0B8puIosxLBgIZZIAFgxMyEUpxVpSQn_6pz8ksxj0ACAmISk4Izhu6qrvQvnlHn03vA10e2ne66fqqrj5Tu2sDvTW9oYvDENO8al4uyNnOHKKf_eQpeVrePS4e2Hpzv1rM18xyLoFlThWGWyOVlMIo55zaotx6KMGKEl25VRYt5r6QBlH6HAphHZcIoCw3IpuSq5E3_fc6-NjrfTuEJp3UWcImqQIxocSIsqGNMfid7kJVm_ChOeijQXo0SCeD9LdBKU5JNi7F7qjIh1_qf7a-AMqdZhU</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>3082048244</pqid></control><display><type>article</type><title>An Improved Water Flow Optimizer for Data Clustering</title><source>Springer Nature</source><creator>Thakral, Prateek ; Kumar, Yugal</creator><creatorcontrib>Thakral, Prateek ; Kumar, Yugal</creatorcontrib><description>Recently, various meta-heuristic algorithms have been considered to allocate the data into different clusters based on similar information. These algorithms have obtained state of the art clustering results compared to traditional algorithms and proven their capability in the field of data clustering. This work presents an improved version of the water flow optimizer, called the IWFO algorithm for effective cluster analysis. The proposed IWFO algorithm handles the performance issues associated with the water flow optimizer algorithm such as random initialization, unbalanced search mechanism and local optima. The random initialization issues are handled through the gaussian map that can generate the initial population systematically. The search mechanism of the WFO algorithm is enhanced using the combination of non-linear functions and the previous best solution. The local optima issue is alleviated by using a neighbourhood search mechanism. The efficacy of the proposed IWFO algorithm is evaluated using benchmark clustering datasets and results are compared with popular clustering algorithms. The simulation results are assessed using intra-cluster distance (intra), standard deviation (SD), rank, accuracy rate (AR) and detection rate (DR) parameters. Some statistical tests are also performed to validate the efficiency of the proposed IWFO algorithm. The proposed IWFO algorithm improves the clustering results (average accuracy rate of more than 7%) compared to the original WFO.</description><identifier>ISSN: 2661-8907</identifier><identifier>ISSN: 2662-995X</identifier><identifier>EISSN: 2661-8907</identifier><identifier>DOI: 10.1007/s42979-024-03048-0</identifier><language>eng</language><publisher>Singapore: Springer Nature Singapore</publisher><subject>Algorithms ; Cluster analysis ; Clustering ; Clusters ; Computer Imaging ; Computer Science ; Computer Systems Organization and Communication Networks ; Data Structures and Information Theory ; Datasets ; Effectiveness ; Flow mapping ; Heuristic ; Heuristic methods ; Information Systems and Communication Service ; Linear functions ; Multimedia ; Optimization ; Original Research ; Pattern Recognition and Graphics ; Performance evaluation ; Searching ; Software Engineering/Programming and Operating Systems ; Statistical tests ; Vision ; Water flow</subject><ispartof>SN computer science, 2024-07, Vol.5 (6), p.715, Article 715</ispartof><rights>The Author(s), under exclusive licence to Springer Nature Singapore Pte Ltd. 2024. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c1150-3d68a1ca56552a6ddd6b45be090c294d9b6c4c47e85a445e7082cd154006c1a23</cites><orcidid>0000-0003-3451-4897</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27903,27904</link.rule.ids></links><search><creatorcontrib>Thakral, Prateek</creatorcontrib><creatorcontrib>Kumar, Yugal</creatorcontrib><title>An Improved Water Flow Optimizer for Data Clustering</title><title>SN computer science</title><addtitle>SN COMPUT. SCI</addtitle><description>Recently, various meta-heuristic algorithms have been considered to allocate the data into different clusters based on similar information. These algorithms have obtained state of the art clustering results compared to traditional algorithms and proven their capability in the field of data clustering. This work presents an improved version of the water flow optimizer, called the IWFO algorithm for effective cluster analysis. The proposed IWFO algorithm handles the performance issues associated with the water flow optimizer algorithm such as random initialization, unbalanced search mechanism and local optima. The random initialization issues are handled through the gaussian map that can generate the initial population systematically. The search mechanism of the WFO algorithm is enhanced using the combination of non-linear functions and the previous best solution. The local optima issue is alleviated by using a neighbourhood search mechanism. The efficacy of the proposed IWFO algorithm is evaluated using benchmark clustering datasets and results are compared with popular clustering algorithms. The simulation results are assessed using intra-cluster distance (intra), standard deviation (SD), rank, accuracy rate (AR) and detection rate (DR) parameters. Some statistical tests are also performed to validate the efficiency of the proposed IWFO algorithm. The proposed IWFO algorithm improves the clustering results (average accuracy rate of more than 7%) compared to the original WFO.</description><subject>Algorithms</subject><subject>Cluster analysis</subject><subject>Clustering</subject><subject>Clusters</subject><subject>Computer Imaging</subject><subject>Computer Science</subject><subject>Computer Systems Organization and Communication Networks</subject><subject>Data Structures and Information Theory</subject><subject>Datasets</subject><subject>Effectiveness</subject><subject>Flow mapping</subject><subject>Heuristic</subject><subject>Heuristic methods</subject><subject>Information Systems and Communication Service</subject><subject>Linear functions</subject><subject>Multimedia</subject><subject>Optimization</subject><subject>Original Research</subject><subject>Pattern Recognition and Graphics</subject><subject>Performance evaluation</subject><subject>Searching</subject><subject>Software Engineering/Programming and Operating Systems</subject><subject>Statistical tests</subject><subject>Vision</subject><subject>Water flow</subject><issn>2661-8907</issn><issn>2662-995X</issn><issn>2661-8907</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><recordid>eNp9UE1LAzEQDaJgqf0DngKeo5PsJLt7LNVqodCL4jGkSSpbuh8mu4r-elNX0JOX-WDevJn3CLnkcM0B8puIosxLBgIZZIAFgxMyEUpxVpSQn_6pz8ksxj0ACAmISk4Izhu6qrvQvnlHn03vA10e2ne66fqqrj5Tu2sDvTW9oYvDENO8al4uyNnOHKKf_eQpeVrePS4e2Hpzv1rM18xyLoFlThWGWyOVlMIo55zaotx6KMGKEl25VRYt5r6QBlH6HAphHZcIoCw3IpuSq5E3_fc6-NjrfTuEJp3UWcImqQIxocSIsqGNMfid7kJVm_ChOeijQXo0SCeD9LdBKU5JNi7F7qjIh1_qf7a-AMqdZhU</recordid><startdate>20240717</startdate><enddate>20240717</enddate><creator>Thakral, Prateek</creator><creator>Kumar, Yugal</creator><general>Springer Nature Singapore</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>JQ2</scope><orcidid>https://orcid.org/0000-0003-3451-4897</orcidid></search><sort><creationdate>20240717</creationdate><title>An Improved Water Flow Optimizer for Data Clustering</title><author>Thakral, Prateek ; Kumar, Yugal</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c1150-3d68a1ca56552a6ddd6b45be090c294d9b6c4c47e85a445e7082cd154006c1a23</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Algorithms</topic><topic>Cluster analysis</topic><topic>Clustering</topic><topic>Clusters</topic><topic>Computer Imaging</topic><topic>Computer Science</topic><topic>Computer Systems Organization and Communication Networks</topic><topic>Data Structures and Information Theory</topic><topic>Datasets</topic><topic>Effectiveness</topic><topic>Flow mapping</topic><topic>Heuristic</topic><topic>Heuristic methods</topic><topic>Information Systems and Communication Service</topic><topic>Linear functions</topic><topic>Multimedia</topic><topic>Optimization</topic><topic>Original Research</topic><topic>Pattern Recognition and Graphics</topic><topic>Performance evaluation</topic><topic>Searching</topic><topic>Software Engineering/Programming and Operating Systems</topic><topic>Statistical tests</topic><topic>Vision</topic><topic>Water flow</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Thakral, Prateek</creatorcontrib><creatorcontrib>Kumar, Yugal</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Computer Science Collection</collection><jtitle>SN computer science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Thakral, Prateek</au><au>Kumar, Yugal</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An Improved Water Flow Optimizer for Data Clustering</atitle><jtitle>SN computer science</jtitle><stitle>SN COMPUT. SCI</stitle><date>2024-07-17</date><risdate>2024</risdate><volume>5</volume><issue>6</issue><spage>715</spage><pages>715-</pages><artnum>715</artnum><issn>2661-8907</issn><issn>2662-995X</issn><eissn>2661-8907</eissn><abstract>Recently, various meta-heuristic algorithms have been considered to allocate the data into different clusters based on similar information. These algorithms have obtained state of the art clustering results compared to traditional algorithms and proven their capability in the field of data clustering. This work presents an improved version of the water flow optimizer, called the IWFO algorithm for effective cluster analysis. The proposed IWFO algorithm handles the performance issues associated with the water flow optimizer algorithm such as random initialization, unbalanced search mechanism and local optima. The random initialization issues are handled through the gaussian map that can generate the initial population systematically. The search mechanism of the WFO algorithm is enhanced using the combination of non-linear functions and the previous best solution. The local optima issue is alleviated by using a neighbourhood search mechanism. The efficacy of the proposed IWFO algorithm is evaluated using benchmark clustering datasets and results are compared with popular clustering algorithms. The simulation results are assessed using intra-cluster distance (intra), standard deviation (SD), rank, accuracy rate (AR) and detection rate (DR) parameters. Some statistical tests are also performed to validate the efficiency of the proposed IWFO algorithm. The proposed IWFO algorithm improves the clustering results (average accuracy rate of more than 7%) compared to the original WFO.</abstract><cop>Singapore</cop><pub>Springer Nature Singapore</pub><doi>10.1007/s42979-024-03048-0</doi><orcidid>https://orcid.org/0000-0003-3451-4897</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 2661-8907
ispartof SN computer science, 2024-07, Vol.5 (6), p.715, Article 715
issn 2661-8907
2662-995X
2661-8907
language eng
recordid cdi_proquest_journals_3082048244
source Springer Nature
subjects Algorithms
Cluster analysis
Clustering
Clusters
Computer Imaging
Computer Science
Computer Systems Organization and Communication Networks
Data Structures and Information Theory
Datasets
Effectiveness
Flow mapping
Heuristic
Heuristic methods
Information Systems and Communication Service
Linear functions
Multimedia
Optimization
Original Research
Pattern Recognition and Graphics
Performance evaluation
Searching
Software Engineering/Programming and Operating Systems
Statistical tests
Vision
Water flow
title An Improved Water Flow Optimizer for Data Clustering
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-23T21%3A17%3A19IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20Improved%20Water%20Flow%20Optimizer%20for%20Data%20Clustering&rft.jtitle=SN%20computer%20science&rft.au=Thakral,%20Prateek&rft.date=2024-07-17&rft.volume=5&rft.issue=6&rft.spage=715&rft.pages=715-&rft.artnum=715&rft.issn=2661-8907&rft.eissn=2661-8907&rft_id=info:doi/10.1007/s42979-024-03048-0&rft_dat=%3Cproquest_cross%3E3082048244%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c1150-3d68a1ca56552a6ddd6b45be090c294d9b6c4c47e85a445e7082cd154006c1a23%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=3082048244&rft_id=info:pmid/&rfr_iscdi=true