English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 61766/94641 (65%)
造訪人次 : 1634850      線上人數 : 18
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/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 PDF248檢視/開啟



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