Loading…

Cost-sensitive multi-kernel ELM based on reduced expectation kernel auto-encoder

ELM (Extreme learning machine) has drawn great attention due its high training speed and outstanding generalization performance. To solve the problem that the long training time of kernel ELM auto-encoder and the difficult setting of the weight of kernel function in the existing multi-kernel models,...

Full description

Saved in:
Bibliographic Details
Published in:PloS one 2025-02, Vol.20 (2), p.e0314851
Main Author: Yixuan, Liang
Format: Article
Language:English
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue 2
container_start_page e0314851
container_title PloS one
container_volume 20
creator Yixuan, Liang
description ELM (Extreme learning machine) has drawn great attention due its high training speed and outstanding generalization performance. To solve the problem that the long training time of kernel ELM auto-encoder and the difficult setting of the weight of kernel function in the existing multi-kernel models, a multi-kernel cost-sensitive ELM method based on expectation kernel auto-encoder is proposed. Firstly, from the view of similarity, the reduced kernel auto-encoder is defined by randomly selecting the reference points from the input data; then, the reduced expectation kernel auto-encoder is designed according to the expectation kernel ELM, and the combination of random mapping and similarity mapping is realized. On this basis, two multi-kernel ELM models are designed, and the output of the classifier is converted into posterior probability. Finally, the cost-sensitive decision is realized based on the minimum risk criterion. The experimental results on the public and realistic datasets verify the effectiveness of the method.
doi_str_mv 10.1371/journal.pone.0314851
format article
fullrecord <record><control><sourceid>proquest_plos_</sourceid><recordid>TN_cdi_plos_journals_3166673705</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3166673705</sourcerecordid><originalsourceid>FETCH-LOGICAL-p1646-d5befe2b7ba6a597f839b3058e095c12be89c6dcbd24beed1bafdb9748f3c43f3</originalsourceid><addsrcrecordid>eNptkU1PwzAMhiMEYmPwDxBU4sKlo2nSpDkhNI0PaQgOcK7y4UJHl5SkneDfU2kFDcTJlv3o9WsboWOcTDHh-GLpOm9lPW2chWlCMM0zvIPGWJA0ZmlCdrfyEToIYZkkGckZ20cjIgRlJOVj9DhzoY0D2FC11RqiVVe3VfwG3kIdzRf3kZIBTORs5MF0uk_howHdyrbqawMnu9bFYLUz4A_RXinrAEdDnKDn6_nT7DZePNzcza4WcYMZZbHJFJSQKq4kk5ngZU6EIkmWQyIyjVMFudDMaGVSqgAMVrI0SnCal0RTUpIJOt3oNrULxXCMUBDMGOOE96tO0OVAdGoFRoNtvayLxlcr6T8LJ6vid8dWr8WLWxcY5ykVOesVzgcF7947CG2xqoKGupYWXLcZxhnhlPbo2R_0f0sn25Z-vHz_g3wB_RaQZw</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>3166673705</pqid></control><display><type>article</type><title>Cost-sensitive multi-kernel ELM based on reduced expectation kernel auto-encoder</title><source>Publicly Available Content Database</source><source>PubMed Central</source><creator>Yixuan, Liang</creator><creatorcontrib>Yixuan, Liang</creatorcontrib><description>ELM (Extreme learning machine) has drawn great attention due its high training speed and outstanding generalization performance. To solve the problem that the long training time of kernel ELM auto-encoder and the difficult setting of the weight of kernel function in the existing multi-kernel models, a multi-kernel cost-sensitive ELM method based on expectation kernel auto-encoder is proposed. Firstly, from the view of similarity, the reduced kernel auto-encoder is defined by randomly selecting the reference points from the input data; then, the reduced expectation kernel auto-encoder is designed according to the expectation kernel ELM, and the combination of random mapping and similarity mapping is realized. On this basis, two multi-kernel ELM models are designed, and the output of the classifier is converted into posterior probability. Finally, the cost-sensitive decision is realized based on the minimum risk criterion. The experimental results on the public and realistic datasets verify the effectiveness of the method.</description><identifier>ISSN: 1932-6203</identifier><identifier>EISSN: 1932-6203</identifier><identifier>DOI: 10.1371/journal.pone.0314851</identifier><identifier>PMID: 39946327</identifier><language>eng</language><publisher>United States: Public Library of Science</publisher><subject>Algorithms ; Approximation ; Biology and Life Sciences ; Classification ; Coders ; Computer and Information Sciences ; Conditional probability ; Costs ; Earth Sciences ; Humans ; Kernel functions ; Machine Learning ; Mapping ; Medicine and Health Sciences ; Neural networks ; Physical Sciences ; Research and Analysis Methods ; Similarity ; Similarity measures ; Social Sciences ; Training</subject><ispartof>PloS one, 2025-02, Vol.20 (2), p.e0314851</ispartof><rights>Copyright: © 2025 Liang Yixuan. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.</rights><rights>2025 Liang Yixuan. This is an open access article distributed under the terms of the Creative Commons Attribution License: http://creativecommons.org/licenses/by/4.0/ (the “License”), which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>2025 Liang Yixuan 2025 Liang Yixuan</rights><rights>2025 Liang Yixuan. This is an open access article distributed under the terms of the Creative Commons Attribution License: http://creativecommons.org/licenses/by/4.0/ (the “License”), which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><orcidid>0009-0002-5532-3061</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.proquest.com/docview/3166673705/fulltextPDF?pq-origsite=primo$$EPDF$$P50$$Gproquest$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/3166673705?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>230,314,723,776,780,881,25731,27901,27902,36989,36990,44566,53766,53768,75096</link.rule.ids><backlink>$$Uhttps://www.ncbi.nlm.nih.gov/pubmed/39946327$$D View this record in MEDLINE/PubMed$$Hfree_for_read</backlink></links><search><creatorcontrib>Yixuan, Liang</creatorcontrib><title>Cost-sensitive multi-kernel ELM based on reduced expectation kernel auto-encoder</title><title>PloS one</title><addtitle>PLoS One</addtitle><description>ELM (Extreme learning machine) has drawn great attention due its high training speed and outstanding generalization performance. To solve the problem that the long training time of kernel ELM auto-encoder and the difficult setting of the weight of kernel function in the existing multi-kernel models, a multi-kernel cost-sensitive ELM method based on expectation kernel auto-encoder is proposed. Firstly, from the view of similarity, the reduced kernel auto-encoder is defined by randomly selecting the reference points from the input data; then, the reduced expectation kernel auto-encoder is designed according to the expectation kernel ELM, and the combination of random mapping and similarity mapping is realized. On this basis, two multi-kernel ELM models are designed, and the output of the classifier is converted into posterior probability. Finally, the cost-sensitive decision is realized based on the minimum risk criterion. The experimental results on the public and realistic datasets verify the effectiveness of the method.</description><subject>Algorithms</subject><subject>Approximation</subject><subject>Biology and Life Sciences</subject><subject>Classification</subject><subject>Coders</subject><subject>Computer and Information Sciences</subject><subject>Conditional probability</subject><subject>Costs</subject><subject>Earth Sciences</subject><subject>Humans</subject><subject>Kernel functions</subject><subject>Machine Learning</subject><subject>Mapping</subject><subject>Medicine and Health Sciences</subject><subject>Neural networks</subject><subject>Physical Sciences</subject><subject>Research and Analysis Methods</subject><subject>Similarity</subject><subject>Similarity measures</subject><subject>Social Sciences</subject><subject>Training</subject><issn>1932-6203</issn><issn>1932-6203</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2025</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNptkU1PwzAMhiMEYmPwDxBU4sKlo2nSpDkhNI0PaQgOcK7y4UJHl5SkneDfU2kFDcTJlv3o9WsboWOcTDHh-GLpOm9lPW2chWlCMM0zvIPGWJA0ZmlCdrfyEToIYZkkGckZ20cjIgRlJOVj9DhzoY0D2FC11RqiVVe3VfwG3kIdzRf3kZIBTORs5MF0uk_howHdyrbqawMnu9bFYLUz4A_RXinrAEdDnKDn6_nT7DZePNzcza4WcYMZZbHJFJSQKq4kk5ngZU6EIkmWQyIyjVMFudDMaGVSqgAMVrI0SnCal0RTUpIJOt3oNrULxXCMUBDMGOOE96tO0OVAdGoFRoNtvayLxlcr6T8LJ6vid8dWr8WLWxcY5ykVOesVzgcF7947CG2xqoKGupYWXLcZxhnhlPbo2R_0f0sn25Z-vHz_g3wB_RaQZw</recordid><startdate>20250201</startdate><enddate>20250201</enddate><creator>Yixuan, Liang</creator><general>Public Library of Science</general><scope>CGR</scope><scope>CUY</scope><scope>CVF</scope><scope>ECM</scope><scope>EIF</scope><scope>NPM</scope><scope>3V.</scope><scope>7QG</scope><scope>7QL</scope><scope>7QO</scope><scope>7RV</scope><scope>7SN</scope><scope>7SS</scope><scope>7T5</scope><scope>7TG</scope><scope>7TM</scope><scope>7U9</scope><scope>7X2</scope><scope>7X7</scope><scope>7XB</scope><scope>88E</scope><scope>8AO</scope><scope>8C1</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FH</scope><scope>8FI</scope><scope>8FJ</scope><scope>8FK</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AEUYN</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>ATCPS</scope><scope>AZQEC</scope><scope>BBNVY</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>BHPHI</scope><scope>C1K</scope><scope>CCPQU</scope><scope>D1I</scope><scope>DWQXO</scope><scope>FR3</scope><scope>FYUFA</scope><scope>GHDGH</scope><scope>GNUQQ</scope><scope>H94</scope><scope>HCIFZ</scope><scope>K9.</scope><scope>KB.</scope><scope>KB0</scope><scope>KL.</scope><scope>L6V</scope><scope>LK8</scope><scope>M0K</scope><scope>M0S</scope><scope>M1P</scope><scope>M7N</scope><scope>M7P</scope><scope>M7S</scope><scope>NAPCQ</scope><scope>P5Z</scope><scope>P62</scope><scope>P64</scope><scope>PATMY</scope><scope>PDBOC</scope><scope>PHGZM</scope><scope>PHGZT</scope><scope>PIMPY</scope><scope>PJZUB</scope><scope>PKEHL</scope><scope>PPXIY</scope><scope>PQEST</scope><scope>PQGLB</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>PYCSY</scope><scope>RC3</scope><scope>7X8</scope><scope>5PM</scope><orcidid>https://orcid.org/0009-0002-5532-3061</orcidid></search><sort><creationdate>20250201</creationdate><title>Cost-sensitive multi-kernel ELM based on reduced expectation kernel auto-encoder</title><author>Yixuan, Liang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p1646-d5befe2b7ba6a597f839b3058e095c12be89c6dcbd24beed1bafdb9748f3c43f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2025</creationdate><topic>Algorithms</topic><topic>Approximation</topic><topic>Biology and Life Sciences</topic><topic>Classification</topic><topic>Coders</topic><topic>Computer and Information Sciences</topic><topic>Conditional probability</topic><topic>Costs</topic><topic>Earth Sciences</topic><topic>Humans</topic><topic>Kernel functions</topic><topic>Machine Learning</topic><topic>Mapping</topic><topic>Medicine and Health Sciences</topic><topic>Neural networks</topic><topic>Physical Sciences</topic><topic>Research and Analysis Methods</topic><topic>Similarity</topic><topic>Similarity measures</topic><topic>Social Sciences</topic><topic>Training</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yixuan, Liang</creatorcontrib><collection>Medline</collection><collection>MEDLINE</collection><collection>MEDLINE (Ovid)</collection><collection>MEDLINE</collection><collection>MEDLINE</collection><collection>PubMed</collection><collection>ProQuest Central (Corporate)</collection><collection>Animal Behavior Abstracts</collection><collection>Bacteriology Abstracts (Microbiology B)</collection><collection>Biotechnology Research Abstracts</collection><collection>Nursing &amp; Allied Health Database</collection><collection>Ecology Abstracts</collection><collection>Entomology Abstracts (Full archive)</collection><collection>Immunology Abstracts</collection><collection>Meteorological &amp; Geoastrophysical Abstracts</collection><collection>Nucleic Acids Abstracts</collection><collection>Virology and AIDS Abstracts</collection><collection>Agricultural Science Collection</collection><collection>Health &amp; Medical Collection</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Medical Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Public Health Database</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Natural Science Collection</collection><collection>Hospital Premium Collection</collection><collection>Hospital Premium Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest One Sustainability</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>Agricultural &amp; Environmental Science Collection</collection><collection>ProQuest Central Essentials</collection><collection>Biological Science Collection</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>Natural Science Collection</collection><collection>Environmental Sciences and Pollution Management</collection><collection>ProQuest One Community College</collection><collection>ProQuest Materials Science Collection</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>Health Research Premium Collection</collection><collection>Health Research Premium Collection (Alumni)</collection><collection>ProQuest Central Student</collection><collection>AIDS and Cancer Research Abstracts</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Health &amp; Medical Complete (Alumni)</collection><collection>Materials Science Database</collection><collection>Nursing &amp; Allied Health Database (Alumni Edition)</collection><collection>Meteorological &amp; Geoastrophysical Abstracts - Academic</collection><collection>ProQuest Engineering Collection</collection><collection>ProQuest Biological Science Collection</collection><collection>Agricultural Science Database</collection><collection>Health &amp; Medical Collection (Alumni Edition)</collection><collection>Medical Database</collection><collection>Algology Mycology and Protozoology Abstracts (Microbiology C)</collection><collection>Biological Science Database</collection><collection>Engineering Database</collection><collection>Nursing &amp; Allied Health Premium</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>Biotechnology and BioEngineering Abstracts</collection><collection>Environmental Science Database</collection><collection>Materials Science Collection</collection><collection>ProQuest Central (New)</collection><collection>ProQuest One Academic (New)</collection><collection>Publicly Available Content Database</collection><collection>ProQuest Health &amp; Medical Research Collection</collection><collection>ProQuest One Academic Middle East (New)</collection><collection>ProQuest One Health &amp; Nursing</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Applied &amp; Life Sciences</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>Environmental Science Collection</collection><collection>Genetics Abstracts</collection><collection>MEDLINE - Academic</collection><collection>PubMed Central (Full Participant titles)</collection><jtitle>PloS one</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Yixuan, Liang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Cost-sensitive multi-kernel ELM based on reduced expectation kernel auto-encoder</atitle><jtitle>PloS one</jtitle><addtitle>PLoS One</addtitle><date>2025-02-01</date><risdate>2025</risdate><volume>20</volume><issue>2</issue><spage>e0314851</spage><pages>e0314851-</pages><issn>1932-6203</issn><eissn>1932-6203</eissn><abstract>ELM (Extreme learning machine) has drawn great attention due its high training speed and outstanding generalization performance. To solve the problem that the long training time of kernel ELM auto-encoder and the difficult setting of the weight of kernel function in the existing multi-kernel models, a multi-kernel cost-sensitive ELM method based on expectation kernel auto-encoder is proposed. Firstly, from the view of similarity, the reduced kernel auto-encoder is defined by randomly selecting the reference points from the input data; then, the reduced expectation kernel auto-encoder is designed according to the expectation kernel ELM, and the combination of random mapping and similarity mapping is realized. On this basis, two multi-kernel ELM models are designed, and the output of the classifier is converted into posterior probability. Finally, the cost-sensitive decision is realized based on the minimum risk criterion. The experimental results on the public and realistic datasets verify the effectiveness of the method.</abstract><cop>United States</cop><pub>Public Library of Science</pub><pmid>39946327</pmid><doi>10.1371/journal.pone.0314851</doi><orcidid>https://orcid.org/0009-0002-5532-3061</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1932-6203
ispartof PloS one, 2025-02, Vol.20 (2), p.e0314851
issn 1932-6203
1932-6203
language eng
recordid cdi_plos_journals_3166673705
source Publicly Available Content Database; PubMed Central
subjects Algorithms
Approximation
Biology and Life Sciences
Classification
Coders
Computer and Information Sciences
Conditional probability
Costs
Earth Sciences
Humans
Kernel functions
Machine Learning
Mapping
Medicine and Health Sciences
Neural networks
Physical Sciences
Research and Analysis Methods
Similarity
Similarity measures
Social Sciences
Training
title Cost-sensitive multi-kernel ELM based on reduced expectation kernel auto-encoder
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-23T04%3A43%3A34IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_plos_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Cost-sensitive%20multi-kernel%20ELM%20based%20on%20reduced%20expectation%20kernel%20auto-encoder&rft.jtitle=PloS%20one&rft.au=Yixuan,%20Liang&rft.date=2025-02-01&rft.volume=20&rft.issue=2&rft.spage=e0314851&rft.pages=e0314851-&rft.issn=1932-6203&rft.eissn=1932-6203&rft_id=info:doi/10.1371/journal.pone.0314851&rft_dat=%3Cproquest_plos_%3E3166673705%3C/proquest_plos_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-p1646-d5befe2b7ba6a597f839b3058e095c12be89c6dcbd24beed1bafdb9748f3c43f3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=3166673705&rft_id=info:pmid/39946327&rfr_iscdi=true