An Robust RPCL Algorithm and Its Application in Clustering of Visual Features

  • Authors:
  • Zeng-Shun Zhao;Zeng-Guang Hou;Min Tan;An-Min Zou

  • Affiliations:
  • Key Laboratory of Complex Systems and Intelligence Science, Institute of Automation, The Chinese Academy of Sciences, P.O. Box 2728, Beijing 100080, China;Key Laboratory of Complex Systems and Intelligence Science, Institute of Automation, The Chinese Academy of Sciences, P.O. Box 2728, Beijing 100080, China;Key Laboratory of Complex Systems and Intelligence Science, Institute of Automation, The Chinese Academy of Sciences, P.O. Box 2728, Beijing 100080, China;Key Laboratory of Complex Systems and Intelligence Science, Institute of Automation, The Chinese Academy of Sciences, P.O. Box 2728, Beijing 100080, China

  • Venue:
  • ISNN '07 Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Clustering in the neural-network literature is generally based on the competitive learning paradigm[4]. This paper presents a new clustering algorithm which is against initialization while meantime can find the natural prototypes in the input data, especially it could partly handle problems that Rival Penalized Competitive Learning (RPCL) algorithm have. Simulation results on synthesized data sets show that proposed method is effective and robust. Application of the proposed robust RPCL algorithm in indexing of visual features is discussed.