Loading…
Semi-supervised clustering ensemble based on genetic algorithm model
Clustering ensemble can be regarded as a mathematical optimization problem, and the genetic algorithm has been widely used as a powerful tool for solving such optimization problems. However, the existing research on clustering ensemble based on the genetic algorithm model has mainly focused on unsup...
Saved in:
Published in: | Multimedia tools and applications 2024-05, Vol.83 (18), p.55851-55865 |
---|---|
Main Authors: | , |
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-c270t-d3b64f22df34c662e18f1d464182a183ddd5442d08fbf02b29de0fe4fed547153 |
container_end_page | 55865 |
container_issue | 18 |
container_start_page | 55851 |
container_title | Multimedia tools and applications |
container_volume | 83 |
creator | Bi, Sheng Li, Xiangli |
description | Clustering ensemble can be regarded as a mathematical optimization problem, and the genetic algorithm has been widely used as a powerful tool for solving such optimization problems. However, the existing research on clustering ensemble based on the genetic algorithm model has mainly focused on unsupervised approaches and has been limited by parameters like crossover probability and mutation probability. This paper presents a semi-supervised clustering ensemble based on the genetic algorithm model. This approach utilizes pairwise constraint information to strengthen the crossover process and mutation process, resulting in enhanced overall algorithm performance. To validate the effectiveness of the proposed approach, extensive comparative experiments were conducted on 9 diverse datasets. The results of the experiments demonstrate the superiority of the proposed algorithm in terms of clustering accuracy and robustness. In summary, this paper introduces a novel semi-supervised approach based on the genetic algorithm model. The utilization of pair-wise constraint information enhances the algorithm’s performance, making it a promising solution for real-world clustering problems. |
doi_str_mv | 10.1007/s11042-023-17662-2 |
format | article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_3055265954</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3055265954</sourcerecordid><originalsourceid>FETCH-LOGICAL-c270t-d3b64f22df34c662e18f1d464182a183ddd5442d08fbf02b29de0fe4fed547153</originalsourceid><addsrcrecordid>eNp9kE1LxDAQhoMouK7-AU8Fz9HMJGm6R1k_YcGDeg5tM1m79MukFfz3dq2gJ08zzLzvfDyMnYO4BCHMVQQQCrlAycGkKXI8YAvQRnJjEA7_5MfsJMadEJBqVAt280xNxePYU_ioIrmkrMc4UKjabUJtpKaoKSnyfadrky21NFRlktfbLlTDW5M0naP6lB35vI509hOX7PXu9mX9wDdP94_r6w0v0YiBO1mkyiM6L1U5HUmQeXAqVZBhDpl0zmml0InMF15ggStHwpPyNNUNaLlkF_PcPnTvI8XB7roxtNNKK4XWmOqVVpMKZ1UZuhgDeduHqsnDpwVh97TsTMtOtOw3LYuTSc6m2O9_p_A7-h_XF2T3bPg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>3055265954</pqid></control><display><type>article</type><title>Semi-supervised clustering ensemble based on genetic algorithm model</title><source>Springer Nature</source><creator>Bi, Sheng ; Li, Xiangli</creator><creatorcontrib>Bi, Sheng ; Li, Xiangli</creatorcontrib><description>Clustering ensemble can be regarded as a mathematical optimization problem, and the genetic algorithm has been widely used as a powerful tool for solving such optimization problems. However, the existing research on clustering ensemble based on the genetic algorithm model has mainly focused on unsupervised approaches and has been limited by parameters like crossover probability and mutation probability. This paper presents a semi-supervised clustering ensemble based on the genetic algorithm model. This approach utilizes pairwise constraint information to strengthen the crossover process and mutation process, resulting in enhanced overall algorithm performance. To validate the effectiveness of the proposed approach, extensive comparative experiments were conducted on 9 diverse datasets. The results of the experiments demonstrate the superiority of the proposed algorithm in terms of clustering accuracy and robustness. In summary, this paper introduces a novel semi-supervised approach based on the genetic algorithm model. The utilization of pair-wise constraint information enhances the algorithm’s performance, making it a promising solution for real-world clustering problems.</description><identifier>ISSN: 1573-7721</identifier><identifier>ISSN: 1380-7501</identifier><identifier>EISSN: 1573-7721</identifier><identifier>DOI: 10.1007/s11042-023-17662-2</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Clustering ; Computer Communication Networks ; Computer Science ; Crossovers ; Data Structures and Information Theory ; Genetic algorithms ; Multimedia Information Systems ; Mutation ; Optimization ; Special Purpose and Application-Based Systems ; Track 6: Computer Vision for Multimedia Applications</subject><ispartof>Multimedia tools and applications, 2024-05, Vol.83 (18), p.55851-55865</ispartof><rights>The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2023. 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-c270t-d3b64f22df34c662e18f1d464182a183ddd5442d08fbf02b29de0fe4fed547153</cites><orcidid>0000-0001-8753-2402</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Bi, Sheng</creatorcontrib><creatorcontrib>Li, Xiangli</creatorcontrib><title>Semi-supervised clustering ensemble based on genetic algorithm model</title><title>Multimedia tools and applications</title><addtitle>Multimed Tools Appl</addtitle><description>Clustering ensemble can be regarded as a mathematical optimization problem, and the genetic algorithm has been widely used as a powerful tool for solving such optimization problems. However, the existing research on clustering ensemble based on the genetic algorithm model has mainly focused on unsupervised approaches and has been limited by parameters like crossover probability and mutation probability. This paper presents a semi-supervised clustering ensemble based on the genetic algorithm model. This approach utilizes pairwise constraint information to strengthen the crossover process and mutation process, resulting in enhanced overall algorithm performance. To validate the effectiveness of the proposed approach, extensive comparative experiments were conducted on 9 diverse datasets. The results of the experiments demonstrate the superiority of the proposed algorithm in terms of clustering accuracy and robustness. In summary, this paper introduces a novel semi-supervised approach based on the genetic algorithm model. The utilization of pair-wise constraint information enhances the algorithm’s performance, making it a promising solution for real-world clustering problems.</description><subject>Clustering</subject><subject>Computer Communication Networks</subject><subject>Computer Science</subject><subject>Crossovers</subject><subject>Data Structures and Information Theory</subject><subject>Genetic algorithms</subject><subject>Multimedia Information Systems</subject><subject>Mutation</subject><subject>Optimization</subject><subject>Special Purpose and Application-Based Systems</subject><subject>Track 6: Computer Vision for Multimedia Applications</subject><issn>1573-7721</issn><issn>1380-7501</issn><issn>1573-7721</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><recordid>eNp9kE1LxDAQhoMouK7-AU8Fz9HMJGm6R1k_YcGDeg5tM1m79MukFfz3dq2gJ08zzLzvfDyMnYO4BCHMVQQQCrlAycGkKXI8YAvQRnJjEA7_5MfsJMadEJBqVAt280xNxePYU_ioIrmkrMc4UKjabUJtpKaoKSnyfadrky21NFRlktfbLlTDW5M0naP6lB35vI509hOX7PXu9mX9wDdP94_r6w0v0YiBO1mkyiM6L1U5HUmQeXAqVZBhDpl0zmml0InMF15ggStHwpPyNNUNaLlkF_PcPnTvI8XB7roxtNNKK4XWmOqVVpMKZ1UZuhgDeduHqsnDpwVh97TsTMtOtOw3LYuTSc6m2O9_p_A7-h_XF2T3bPg</recordid><startdate>20240501</startdate><enddate>20240501</enddate><creator>Bi, Sheng</creator><creator>Li, Xiangli</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0001-8753-2402</orcidid></search><sort><creationdate>20240501</creationdate><title>Semi-supervised clustering ensemble based on genetic algorithm model</title><author>Bi, Sheng ; Li, Xiangli</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c270t-d3b64f22df34c662e18f1d464182a183ddd5442d08fbf02b29de0fe4fed547153</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Clustering</topic><topic>Computer Communication Networks</topic><topic>Computer Science</topic><topic>Crossovers</topic><topic>Data Structures and Information Theory</topic><topic>Genetic algorithms</topic><topic>Multimedia Information Systems</topic><topic>Mutation</topic><topic>Optimization</topic><topic>Special Purpose and Application-Based Systems</topic><topic>Track 6: Computer Vision for Multimedia Applications</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bi, Sheng</creatorcontrib><creatorcontrib>Li, Xiangli</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Multimedia tools and applications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Bi, Sheng</au><au>Li, Xiangli</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Semi-supervised clustering ensemble based on genetic algorithm model</atitle><jtitle>Multimedia tools and applications</jtitle><stitle>Multimed Tools Appl</stitle><date>2024-05-01</date><risdate>2024</risdate><volume>83</volume><issue>18</issue><spage>55851</spage><epage>55865</epage><pages>55851-55865</pages><issn>1573-7721</issn><issn>1380-7501</issn><eissn>1573-7721</eissn><abstract>Clustering ensemble can be regarded as a mathematical optimization problem, and the genetic algorithm has been widely used as a powerful tool for solving such optimization problems. However, the existing research on clustering ensemble based on the genetic algorithm model has mainly focused on unsupervised approaches and has been limited by parameters like crossover probability and mutation probability. This paper presents a semi-supervised clustering ensemble based on the genetic algorithm model. This approach utilizes pairwise constraint information to strengthen the crossover process and mutation process, resulting in enhanced overall algorithm performance. To validate the effectiveness of the proposed approach, extensive comparative experiments were conducted on 9 diverse datasets. The results of the experiments demonstrate the superiority of the proposed algorithm in terms of clustering accuracy and robustness. In summary, this paper introduces a novel semi-supervised approach based on the genetic algorithm model. The utilization of pair-wise constraint information enhances the algorithm’s performance, making it a promising solution for real-world clustering problems.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s11042-023-17662-2</doi><tpages>15</tpages><orcidid>https://orcid.org/0000-0001-8753-2402</orcidid></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1573-7721 |
ispartof | Multimedia tools and applications, 2024-05, Vol.83 (18), p.55851-55865 |
issn | 1573-7721 1380-7501 1573-7721 |
language | eng |
recordid | cdi_proquest_journals_3055265954 |
source | Springer Nature |
subjects | Clustering Computer Communication Networks Computer Science Crossovers Data Structures and Information Theory Genetic algorithms Multimedia Information Systems Mutation Optimization Special Purpose and Application-Based Systems Track 6: Computer Vision for Multimedia Applications |
title | Semi-supervised clustering ensemble based on genetic algorithm model |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-30T13%3A21%3A33IST&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=Semi-supervised%20clustering%20ensemble%20based%20on%20genetic%20algorithm%20model&rft.jtitle=Multimedia%20tools%20and%20applications&rft.au=Bi,%20Sheng&rft.date=2024-05-01&rft.volume=83&rft.issue=18&rft.spage=55851&rft.epage=55865&rft.pages=55851-55865&rft.issn=1573-7721&rft.eissn=1573-7721&rft_id=info:doi/10.1007/s11042-023-17662-2&rft_dat=%3Cproquest_cross%3E3055265954%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c270t-d3b64f22df34c662e18f1d464182a183ddd5442d08fbf02b29de0fe4fed547153%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=3055265954&rft_id=info:pmid/&rfr_iscdi=true |