IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/6936335.html
   My bibliography  Save this article

An Accurate Method of Determining Attribute Weights in Distance-Based Classification Algorithms

Author

Listed:
  • Fengtao Liu
  • Jialei Wang
  • Xuefeng Shao

Abstract

Weight determination aims to determine the importance of different attributes; determining accurate weights can significantly improve the accuracy of classification and clustering. This paper proposes an accurate method for attribute weight determination. The method uses the distance from the sample point of each class to the class center point. It can minimize the weights and determines the attribute weights of the constraints through the objective function. In this paper, the attribute weights obtained by the exact solution are applied to the K-means clustering algorithm; three classic machine learning data sets, the iris data set, the wine data set, and the wheat seed data set, are clustered. Using the normalized mutual information as the evaluation index, a confusion matrix was established. Finally, the clustering results are visualized and compared with other methods to verify the effectiveness of the proposed method. The results show that this method improves the normalized mutual information by 0.11 and 0.08, respectively, compared with the unweighted and entropy weighted methods for iris clustering results. Furthermore, the performance on the wine data set is improved by 0.1, and the performance on the wheat seed data set is improved by 0.15 and 0.05.

Suggested Citation

  • Fengtao Liu & Jialei Wang & Xuefeng Shao, 2022. "An Accurate Method of Determining Attribute Weights in Distance-Based Classification Algorithms," Mathematical Problems in Engineering, Hindawi, vol. 2022, pages 1-15, May.
  • Handle: RePEc:hin:jnlmpe:6936335
    DOI: 10.1155/2022/6936335
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/mpe/2022/6936335.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/mpe/2022/6936335.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2022/6936335?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:jnlmpe:6936335. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.