Improving interpolation-based oversampling for imbalanced data learning

The class imbalance problem in machine learning contains a skewed distribution of samples among different classes, resulting in a learning bias toward the majority class. Interpolation-based oversampling techniques solve this problem by yielding the synthetic minority samples to correct the imbalanc...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Knowledge-based systems 2020-01, Vol.187, p.104826, Article 104826
Hauptverfasser: Zhu, Tuanfei, Lin, Yaping, Liu, Yonghe
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page 104826
container_title Knowledge-based systems
container_volume 187
creator Zhu, Tuanfei
Lin, Yaping
Liu, Yonghe
description The class imbalance problem in machine learning contains a skewed distribution of samples among different classes, resulting in a learning bias toward the majority class. Interpolation-based oversampling techniques solve this problem by yielding the synthetic minority samples to correct the imbalanced class distribution, which has become one of the most popular types of solutions. However, several non-negligible drawbacks exist in them. This study identifies that the flaws of the over constraint, low-efficiency expansion, and over generalization can occur when interpolating the synthetic samples for the inland minority samples (resided in the interior of dense regions of minority class), borderline minority samples (settled in the border of dense regions), and trapped minority samples (located in the sparse regions), respectively. To overcome these flaws, a Position characteristic-Aware Interpolation Oversampling algorithm (PAIO) is proposed. PAIO first leverages a neighborhood-based clustering algorithm to divide the minority samples into three types of samples with different position characteristics (i.e., the inland minority, borderline minority, and trapped minority samples). It then carries out ad hoc interpolation oversampling for these three different types of minority samples, so that the deficiencies can be addressed correspondingly. Moreover, another drawback in interpolation-base oversampling algorithms is the groundless populating for the categorical attributes of synthetic samples. To solve this problem, we develop a Generalized Interpolation Creation way (GIC) to fill the categorical attributes. Extensive experiments on a number of real-world datasets demonstrate that the effectiveness of the proposed PAIO and GIC. •Presents a position characteristic-aware interpolation oversampling algorithm.•Overcomes the over constraint, low-efficiency expansion, and over generalization.•The interpolation creation way is generalized into filling the categorical attributes.•Superior performance than the state of the art in terms of various assessment metrics.
doi_str_mv 10.1016/j.knosys.2019.06.034
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2330585809</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0950705119303016</els_id><sourcerecordid>2330585809</sourcerecordid><originalsourceid>FETCH-LOGICAL-c334t-b7d36feda8df17dd40d14721b87e901ab5d3062f41ad497852052482f7c6453b3</originalsourceid><addsrcrecordid>eNp9kE1LxDAQhoMouK7-Aw8Fz62Trya9CLLourDgRc8hbVJJbZs16S7svzelnj3N4f2YmQehewwFBlw-dsX36OM5FgRwVUBZAGUXaIWlILlgUF2iFVQccgEcX6ObGDsAIATLFdruhkPwJzd-ZW6cbDj4Xk_Oj3mtozWZP9kQ9XDoZ0PrQ-aGWvd6bJJm9KSz3uowJvEWXbW6j_bub67R5-vLx-Yt379vd5vnfd5Qyqa8FoaWrTVamhYLYxgYzATBtRS2AqxrbiiUpGVYG1YJyQlwwiRpRVMyTmu6Rg9Lb7r652jjpDp_DGNaqQilwCWXUCUXW1xN8DEG26pDcIMOZ4VBzchUpxZkakamoFQJWYo9LTGbPjg5G1RsnJ2fdcE2kzLe_V_wC0eYdzc</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2330585809</pqid></control><display><type>article</type><title>Improving interpolation-based oversampling for imbalanced data learning</title><source>Elsevier ScienceDirect Journals Complete - AutoHoldings</source><creator>Zhu, Tuanfei ; Lin, Yaping ; Liu, Yonghe</creator><creatorcontrib>Zhu, Tuanfei ; Lin, Yaping ; Liu, Yonghe</creatorcontrib><description>The class imbalance problem in machine learning contains a skewed distribution of samples among different classes, resulting in a learning bias toward the majority class. Interpolation-based oversampling techniques solve this problem by yielding the synthetic minority samples to correct the imbalanced class distribution, which has become one of the most popular types of solutions. However, several non-negligible drawbacks exist in them. This study identifies that the flaws of the over constraint, low-efficiency expansion, and over generalization can occur when interpolating the synthetic samples for the inland minority samples (resided in the interior of dense regions of minority class), borderline minority samples (settled in the border of dense regions), and trapped minority samples (located in the sparse regions), respectively. To overcome these flaws, a Position characteristic-Aware Interpolation Oversampling algorithm (PAIO) is proposed. PAIO first leverages a neighborhood-based clustering algorithm to divide the minority samples into three types of samples with different position characteristics (i.e., the inland minority, borderline minority, and trapped minority samples). It then carries out ad hoc interpolation oversampling for these three different types of minority samples, so that the deficiencies can be addressed correspondingly. Moreover, another drawback in interpolation-base oversampling algorithms is the groundless populating for the categorical attributes of synthetic samples. To solve this problem, we develop a Generalized Interpolation Creation way (GIC) to fill the categorical attributes. Extensive experiments on a number of real-world datasets demonstrate that the effectiveness of the proposed PAIO and GIC. •Presents a position characteristic-aware interpolation oversampling algorithm.•Overcomes the over constraint, low-efficiency expansion, and over generalization.•The interpolation creation way is generalized into filling the categorical attributes.•Superior performance than the state of the art in terms of various assessment metrics.</description><identifier>ISSN: 0950-7051</identifier><identifier>EISSN: 1872-7409</identifier><identifier>DOI: 10.1016/j.knosys.2019.06.034</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Algorithms ; Class imbalance ; Clustering ; Imbalanced data ; Interpolation ; Machine learning ; Oversampling ; Skewed distributions</subject><ispartof>Knowledge-based systems, 2020-01, Vol.187, p.104826, Article 104826</ispartof><rights>2019 Elsevier B.V.</rights><rights>Copyright Elsevier Science Ltd. Jan 2020</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c334t-b7d36feda8df17dd40d14721b87e901ab5d3062f41ad497852052482f7c6453b3</citedby><cites>FETCH-LOGICAL-c334t-b7d36feda8df17dd40d14721b87e901ab5d3062f41ad497852052482f7c6453b3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.knosys.2019.06.034$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3549,27923,27924,45994</link.rule.ids></links><search><creatorcontrib>Zhu, Tuanfei</creatorcontrib><creatorcontrib>Lin, Yaping</creatorcontrib><creatorcontrib>Liu, Yonghe</creatorcontrib><title>Improving interpolation-based oversampling for imbalanced data learning</title><title>Knowledge-based systems</title><description>The class imbalance problem in machine learning contains a skewed distribution of samples among different classes, resulting in a learning bias toward the majority class. Interpolation-based oversampling techniques solve this problem by yielding the synthetic minority samples to correct the imbalanced class distribution, which has become one of the most popular types of solutions. However, several non-negligible drawbacks exist in them. This study identifies that the flaws of the over constraint, low-efficiency expansion, and over generalization can occur when interpolating the synthetic samples for the inland minority samples (resided in the interior of dense regions of minority class), borderline minority samples (settled in the border of dense regions), and trapped minority samples (located in the sparse regions), respectively. To overcome these flaws, a Position characteristic-Aware Interpolation Oversampling algorithm (PAIO) is proposed. PAIO first leverages a neighborhood-based clustering algorithm to divide the minority samples into three types of samples with different position characteristics (i.e., the inland minority, borderline minority, and trapped minority samples). It then carries out ad hoc interpolation oversampling for these three different types of minority samples, so that the deficiencies can be addressed correspondingly. Moreover, another drawback in interpolation-base oversampling algorithms is the groundless populating for the categorical attributes of synthetic samples. To solve this problem, we develop a Generalized Interpolation Creation way (GIC) to fill the categorical attributes. Extensive experiments on a number of real-world datasets demonstrate that the effectiveness of the proposed PAIO and GIC. •Presents a position characteristic-aware interpolation oversampling algorithm.•Overcomes the over constraint, low-efficiency expansion, and over generalization.•The interpolation creation way is generalized into filling the categorical attributes.•Superior performance than the state of the art in terms of various assessment metrics.</description><subject>Algorithms</subject><subject>Class imbalance</subject><subject>Clustering</subject><subject>Imbalanced data</subject><subject>Interpolation</subject><subject>Machine learning</subject><subject>Oversampling</subject><subject>Skewed distributions</subject><issn>0950-7051</issn><issn>1872-7409</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><recordid>eNp9kE1LxDAQhoMouK7-Aw8Fz62Trya9CLLourDgRc8hbVJJbZs16S7svzelnj3N4f2YmQehewwFBlw-dsX36OM5FgRwVUBZAGUXaIWlILlgUF2iFVQccgEcX6ObGDsAIATLFdruhkPwJzd-ZW6cbDj4Xk_Oj3mtozWZP9kQ9XDoZ0PrQ-aGWvd6bJJm9KSz3uowJvEWXbW6j_bub67R5-vLx-Yt379vd5vnfd5Qyqa8FoaWrTVamhYLYxgYzATBtRS2AqxrbiiUpGVYG1YJyQlwwiRpRVMyTmu6Rg9Lb7r652jjpDp_DGNaqQilwCWXUCUXW1xN8DEG26pDcIMOZ4VBzchUpxZkakamoFQJWYo9LTGbPjg5G1RsnJ2fdcE2kzLe_V_wC0eYdzc</recordid><startdate>202001</startdate><enddate>202001</enddate><creator>Zhu, Tuanfei</creator><creator>Lin, Yaping</creator><creator>Liu, Yonghe</creator><general>Elsevier B.V</general><general>Elsevier Science Ltd</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>E3H</scope><scope>F2A</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>202001</creationdate><title>Improving interpolation-based oversampling for imbalanced data learning</title><author>Zhu, Tuanfei ; Lin, Yaping ; Liu, Yonghe</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c334t-b7d36feda8df17dd40d14721b87e901ab5d3062f41ad497852052482f7c6453b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Algorithms</topic><topic>Class imbalance</topic><topic>Clustering</topic><topic>Imbalanced data</topic><topic>Interpolation</topic><topic>Machine learning</topic><topic>Oversampling</topic><topic>Skewed distributions</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zhu, Tuanfei</creatorcontrib><creatorcontrib>Lin, Yaping</creatorcontrib><creatorcontrib>Liu, Yonghe</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>Library &amp; Information Sciences Abstracts (LISA)</collection><collection>Library &amp; Information Science Abstracts (LISA)</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>Knowledge-based systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zhu, Tuanfei</au><au>Lin, Yaping</au><au>Liu, Yonghe</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Improving interpolation-based oversampling for imbalanced data learning</atitle><jtitle>Knowledge-based systems</jtitle><date>2020-01</date><risdate>2020</risdate><volume>187</volume><spage>104826</spage><pages>104826-</pages><artnum>104826</artnum><issn>0950-7051</issn><eissn>1872-7409</eissn><abstract>The class imbalance problem in machine learning contains a skewed distribution of samples among different classes, resulting in a learning bias toward the majority class. Interpolation-based oversampling techniques solve this problem by yielding the synthetic minority samples to correct the imbalanced class distribution, which has become one of the most popular types of solutions. However, several non-negligible drawbacks exist in them. This study identifies that the flaws of the over constraint, low-efficiency expansion, and over generalization can occur when interpolating the synthetic samples for the inland minority samples (resided in the interior of dense regions of minority class), borderline minority samples (settled in the border of dense regions), and trapped minority samples (located in the sparse regions), respectively. To overcome these flaws, a Position characteristic-Aware Interpolation Oversampling algorithm (PAIO) is proposed. PAIO first leverages a neighborhood-based clustering algorithm to divide the minority samples into three types of samples with different position characteristics (i.e., the inland minority, borderline minority, and trapped minority samples). It then carries out ad hoc interpolation oversampling for these three different types of minority samples, so that the deficiencies can be addressed correspondingly. Moreover, another drawback in interpolation-base oversampling algorithms is the groundless populating for the categorical attributes of synthetic samples. To solve this problem, we develop a Generalized Interpolation Creation way (GIC) to fill the categorical attributes. Extensive experiments on a number of real-world datasets demonstrate that the effectiveness of the proposed PAIO and GIC. •Presents a position characteristic-aware interpolation oversampling algorithm.•Overcomes the over constraint, low-efficiency expansion, and over generalization.•The interpolation creation way is generalized into filling the categorical attributes.•Superior performance than the state of the art in terms of various assessment metrics.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.knosys.2019.06.034</doi></addata></record>
fulltext fulltext
identifier ISSN: 0950-7051
ispartof Knowledge-based systems, 2020-01, Vol.187, p.104826, Article 104826
issn 0950-7051
1872-7409
language eng
recordid cdi_proquest_journals_2330585809
source Elsevier ScienceDirect Journals Complete - AutoHoldings
subjects Algorithms
Class imbalance
Clustering
Imbalanced data
Interpolation
Machine learning
Oversampling
Skewed distributions
title Improving interpolation-based oversampling for imbalanced data learning
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T08%3A34%3A43IST&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=Improving%20interpolation-based%20oversampling%20for%20imbalanced%20data%20learning&rft.jtitle=Knowledge-based%20systems&rft.au=Zhu,%20Tuanfei&rft.date=2020-01&rft.volume=187&rft.spage=104826&rft.pages=104826-&rft.artnum=104826&rft.issn=0950-7051&rft.eissn=1872-7409&rft_id=info:doi/10.1016/j.knosys.2019.06.034&rft_dat=%3Cproquest_cross%3E2330585809%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2330585809&rft_id=info:pmid/&rft_els_id=S0950705119303016&rfr_iscdi=true