English  |  正體中文  |  简体中文  |  Items with full text/Total items : 69561/69561 (100%)
Visitors : 23072372      Online Users : 369
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/51486


    Title: IMPROVING RIVAL PENALIZED COMPETITIVE LEARNING USING DENSITY-EVALUATED MECHANISM
    Authors: Chang,YJ;Yang,SS;Ho,CL
    Contributors: 通訊工程學系
    Date: 2010
    Issue Date: 2012-03-27 18:54:11 (UTC+8)
    Publisher: 國立中央大學
    Abstract: Rival penalized competitive learning (RPCL) and its variants have provided attractive ways to perform clustering without knowing the exact cluster number. However, they are always accompanied by problems of falling in local optima and slow learning speed. Thus we investigate the RPCL and propose a mechanism to directly prune the RPCL's structure by evaluating the data density of each unit. We call the new strategy density-evaluated RPCL (DERPCL). The communication channel state is estimated by the DERPCL in the simulations, and comprehensive comparisons are made with other RPCLs. Results show that the DERPCL is superior in terms of convergence accuracy and speed.
    Relation: JOURNAL OF THE CHINESE INSTITUTE OF ENGINEERS
    Appears in Collections:[通訊工程學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML345View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明