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

An RBF Neural Network Clustering Algorithm Based on K-Nearest Neighbor

Author

Listed:
  • Jitao Li
  • Chugui Xu
  • Yongquan Liang
  • Gengkun Wu
  • Zhao Liang
  • Wei Liu

Abstract

Neural network is a supervised classification algorithm which can deal with high complexity and nonlinear data analysis. Supervised algorithm needs some known labels in the training process, and then corrects parameters through backpropagation method. However, due to the lack of marked labels, existing literature mostly uses Auto-Encoder to reduce the dimension of data when facing of clustering problems. This paper proposes an RBF (Radial Basis Function) neural network clustering algorithm based on K-nearest neighbors theory, which first uses K-means algorithm for preclassification, and then constructs self-supervised labels based on K-nearest neighbors theory for backpropagation. The algorithm in this paper belongs to a self-supervised neural network clustering algorithm, and it also makes the neural network truly have the ability of self-decision-making and self-optimization. From the experimental results of the artificial data sets and the UCI data sets, it can be proved that the proposed algorithm has excellent adaptability and robustness.

Suggested Citation

  • Jitao Li & Chugui Xu & Yongquan Liang & Gengkun Wu & Zhao Liang & Wei Liu, 2022. "An RBF Neural Network Clustering Algorithm Based on K-Nearest Neighbor," Mathematical Problems in Engineering, Hindawi, vol. 2022, pages 1-9, August.
  • Handle: RePEc:hin:jnlmpe:1083961
    DOI: 10.1155/2022/1083961
    as

    Download full text from publisher

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

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

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