IDEAS home Printed from https://ideas.repec.org/a/spr/jclass/v41y2024i2d10.1007_s00357-024-09474-2.html
   My bibliography  Save this article

SNN-PDM: An Improved Probability Density Machine Algorithm Based on Shared Nearest Neighbors Clustering Technique

Author

Listed:
  • Shiqi Wu

    (Jiangsu University of Science and Technology)

  • Hualong Yu

    (Jiangsu University of Science and Technology)

  • Yan Gu

    (Jiangsu University of Science and Technology)

  • Changbin Shao

    (Jiangsu University of Science and Technology)

  • Shang Gao

    (Jiangsu University of Science and Technology)

Abstract

Probability density machine (PDM) is a novel algorithm which was proposed recently for addressing class imbalance learning (CIL) problem. PDM can capture priori data distribution information well and present robust performance in various CIL applications. However, we also note that the PDM is sensitive to CIL data with varying density and/or small disjunctions which means there are two or multiple obvious sub-clusters within the same class, as on this kind of data, the estimation of conditional probability might be extremely inaccurate. To address this problem, we introduce the shared nearest neighbors (SNN) clustering technique into PDM procedure and propose a novel SNN-PDM algorithm. Specifically, the SNN can adapt varying density and capture small disjunctions existing in data distribution well. We evaluate the proposed algorithm on a large amount of CIL datasets, and the results show that the proposed SNN-PDM algorithm outperforms the PDM and several previous methods. Meanwhile, in comparison with PDM, the SNN-PDM has less time consumption.

Suggested Citation

  • Shiqi Wu & Hualong Yu & Yan Gu & Changbin Shao & Shang Gao, 2024. "SNN-PDM: An Improved Probability Density Machine Algorithm Based on Shared Nearest Neighbors Clustering Technique," Journal of Classification, Springer;The Classification Society, vol. 41(2), pages 289-312, July.
    • Handle: RePEc:spr:jclass:v:41:y:2024:i:2:d:10.1007_s00357-024-09474-2
    DOI: 10.1007/s00357-024-09474-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00357-024-09474-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00357-024-09474-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Haydemar Núñez & Luis Gonzalez-Abril & Cecilio Angulo, 2017. "Improving SVM Classification on Imbalanced Datasets by Introducing a New Bias," Journal of Classification, Springer;The Classification Society, vol. 34(3), pages 427-443, October.
    2. Gilseung Ahn & You-Jin Park & Sun Hur, 2021. "A Membership Probability–Based Undersampling Algorithm for Imbalanced Data," Journal of Classification, Springer;The Classification Society, vol. 38(1), pages 2-15, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Douglas L. Steinley, 2019. "Editorial: Journal of Classification Vol. 36-3," Journal of Classification, Springer;The Classification Society, vol. 36(3), pages 393-396, October.
    2. Liu, Xin & Yi, Grace Y. & Bauman, Glenn & He, Wenqing, 2021. "Ensembling Imbalanced-Spatial-Structured Support Vector Machine," Econometrics and Statistics, Elsevier, vol. 17(C), pages 145-155.
    3. Douglas L. Steinley, 2018. "Editorial," Journal of Classification, Springer;The Classification Society, vol. 35(1), pages 1-4, April.
    4. Marco Vriens & Nathan Bosch & Chad Vidden & Jason Talwar, 2022. "Prediction and profitability in market segmentation typing tools," Journal of Marketing Analytics, Palgrave Macmillan, vol. 10(4), pages 360-389, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jclass:v:41:y:2024:i:2:d:10.1007_s00357-024-09474-2. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.