中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/29095
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 80990/80990 (100%)
造访人次 : 42686537      在线人数 : 1402
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: 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 ©   - 隱私權政策聲明