• Complex
  • Title
  • Keyword
  • Abstract
  • Scholars
  • Journal
  • ISSN
  • Conference
搜索

Author:

Liu Boyang (Liu Boyang.) (Scholars:刘波扬) | Gui Zhiming (Gui Zhiming.)

Indexed by:

CPCI-S

Abstract:

In RBF neural networks, the basis functions of hidden layers are often clustered by K-means algorithm. However, due to the K-means algorithm's dependence on the initial cluster center, it is too sensitive to noisy data. This paper proposes an RBF neural network based on K-nearest neighbors optimized clustering algorithm by fast search and finding the density peaks of a dataset(KNN-DPC). First, the optimized KNN-DPC algorithm is used to cluster data with too many noisy points, then the basis function center of RBF neural network is obtained, finally, the RBF neural network is constructed. The accuracy of this algorithm is verified by simulation experiments, and the results show that the algorithm is effective and practical.

Keyword:

fast search and finding the density peaks of a dataset KNN-DPC algorithm RBF neural network Noise data sensitivity

Author Community:

  • [ 1 ] [Liu Boyang]Beijing Univ Technol, Fac Informat Technol, Coll Comp Sci, Beijing, Peoples R China
  • [ 2 ] [Gui Zhiming]Beijing Univ Technol, Fac Informat Technol, Coll Comp Sci, Beijing, Peoples R China

Reprint Author's Address:

  • 刘波扬

    [Liu Boyang]Beijing Univ Technol, Fac Informat Technol, Coll Comp Sci, Beijing, Peoples R China

Show more details

Related Keywords:

Related Article:

Source :

PROCEEDINGS OF 2018 INTERNATIONAL CONFERENCE ON INFORMATION SYSTEMS AND COMPUTER AIDED EDUCATION (ICISCAE 2018)

Year: 2018

Page: 108-111

Language: English

Cited Count:

WoS CC Cited Count: 0

SCOPUS Cited Count:

ESI Highly Cited Papers on the List: 0 Unfold All

WanFang Cited Count:

Chinese Cited Count:

30 Days PV: 13

Online/Total:884/10564001
Address:BJUT Library(100 Pingleyuan,Chaoyang District,Beijing 100124, China Post Code:100124) Contact Us:010-67392185
Copyright:BJUT Library Technical Support:Beijing Aegean Software Co., Ltd.