中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/29095
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 80990/80990 (100%)
造訪人次 : 42700898      線上人數 : 1439
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋


    請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/29095


    題名: A swarm-inspired projection algorithm
    作者: Su,MC;Su,SY;Zhao,YX
    貢獻者: 資訊工程研究所
    關鍵詞: NEURAL-NETWORKS;FUZZY;STIGMERGY
    日期: 2009
    上傳時間: 2010-06-29 20:13:37 (UTC+8)
    出版者: 中央大學
    摘要: In this paper a new data projection algorithm which was inspired by the foraging behaviors of doves is proposed. We name the new data projection the swarm-inspired projection (SIP) algorithm. The algorithm allows us to visually estimate the number of clusters existing in a data set. Based on the projection result, we may then partition the data set into the corresponding number of clusters. The SIP algorithm regards each data pattern in a data set as a piece of crumb which will be sequentially tossed to a flock of doves on the ground. The doves will adjust their physical positions to compete for crumbs. Gradually, the flock of doves will be divided into several groups according to the distributions of the crumbs. The formed groups will naturally correspond to the underlying data structures in the data set. By viewing the scatter plot of the final positions of the doves we can estimate the number of clusters existing in the data set. Several data sets were used to demonstrate the effectiveness of the proposed SIP algorithm. (C) 2009 Elsevier Ltd. All rights reserved.
    關聯: PATTERN RECOGNITION
    顯示於類別:[資訊工程研究所] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML731檢視/開啟


    在NCUIR中所有的資料項目都受到原著作權保護.

    社群 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 ©   - 隱私權政策聲明