English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 54059/88894 (61%)
造访人次 : 10549765      在线人数 : 13
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻

    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/37160

    题名: Robust Clustering based on Winner-Population Markov Chain
    作者: Yang, Fu-wen;Lin, Hwei-jen;Wang, Patrick, S. P.;Wu, Hung-hsuan
    贡献者: 淡江大學資訊工程學系
    日期: 2006-08-20
    上传时间: 2010-01-11 12:30:56 (UTC+8)
    摘要: In this paper, we propose an unsupervised genetic clustering algorithm, which produces a new chromosome without any conventional genetic operators, and instead according to the gene reproducing probabilities determined by Markov chain modeling. Selection of cluster centers from the dataset enables construction of a look-up table that saves the distances between all pairs of data points. The experimental results show that the proposed algorithm not only solves the premature problem to provide a more stable clustering performance in terms of number of clusters and clustering results, but also improves the time efficiency
    關聯: Proceedings of the 18th International Conference on Pattern Recognition (ICPR2006), pp.589-592
    DOI: 10.1109/ICPR.2006.1002
    显示于类别:[資訊工程學系暨研究所] 會議論文


    档案 描述 大小格式浏览次数
    Robust Clustering based on Winner-Population Markov Chain.pdf135KbAdobe PDF175检视/开启



    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回馈