IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i10p1434-d1389898.html
   My bibliography  Save this article

Optimizing Attribute Reduction in Multi-Granularity Data through a Hybrid Supervised–Unsupervised Model

Author

Listed:
  • Zeyuan Fan

    (School of Computer Science, Jiangsu University of Science and Technology, Zhenjiang 212100, China)

  • Jianjun Chen

    (School of Computer Science, Jiangsu University of Science and Technology, Zhenjiang 212100, China)

  • Hongyang Cui

    (School of Computer Science, Jiangsu University of Science and Technology, Zhenjiang 212100, China)

  • Jingjing Song

    (School of Computer Science, Jiangsu University of Science and Technology, Zhenjiang 212100, China)

  • Taihua Xu

    (School of Computer Science, Jiangsu University of Science and Technology, Zhenjiang 212100, China)

Abstract

Attribute reduction is a core technique in the rough set domain and an important step in data preprocessing. Researchers have proposed numerous innovative methods to enhance the capability of attribute reduction, such as the emergence of multi-granularity rough set models, which can effectively process distributed and multi-granularity data. However, these innovative methods still have numerous shortcomings, such as addressing complex constraints and conducting multi-angle effectiveness evaluations. Based on the multi-granularity model, this study proposes a new method of attribute reduction, namely using multi-granularity neighborhood information gain ratio as the measurement criterion. This method combines both supervised and unsupervised perspectives, and by integrating multi-granularity technology with neighborhood rough set theory, constructs a model that can adapt to multi-level data features. This novel method stands out by addressing complex constraints and facilitating multi-perspective effectiveness evaluations. It has several advantages: (1) it combines supervised and unsupervised learning methods, allowing for nuanced data interpretation and enhanced attribute selection; (2) by incorporating multi-granularity structures, the algorithm can analyze data at various levels of granularity. This allows for a more detailed understanding of data characteristics at each level, which can be crucial for complex datasets; and (3) by using neighborhood relations instead of indiscernibility relations, the method effectively handles uncertain and fuzzy data, making it suitable for real-world datasets that often contain imprecise or incomplete information. It not only selects the optimal granularity level or attribute set based on specific requirements, but also demonstrates its versatility and robustness through extensive experiments on 15 UCI datasets. Comparative analyses against six established attribute reduction algorithms confirms the superior reliability and consistency of our proposed method. This research not only enhances the understanding of attribute reduction mechanisms, but also sets a new benchmark for future explorations in the field.

Suggested Citation

  • Zeyuan Fan & Jianjun Chen & Hongyang Cui & Jingjing Song & Taihua Xu, 2024. "Optimizing Attribute Reduction in Multi-Granularity Data through a Hybrid Supervised–Unsupervised Model," Mathematics, MDPI, vol. 12(10), pages 1-18, May.
  • Handle: RePEc:gam:jmathe:v:12:y:2024:i:10:p:1434-:d:1389898
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/10/1434/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/12/10/1434/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Zhenyu Yin & Yan Fan & Pingxin Wang & Jianjun Chen, 2023. "Parallel Selector for Feature Reduction," Mathematics, MDPI, vol. 11(9), pages 1-33, 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.

      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:gam:jmathe:v:12:y:2024:i:10:p:1434-:d:1389898. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.