淡江大學機構典藏:Item 987654321/45281
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 62819/95882 (66%)
造訪人次 : 3998842      線上人數 : 415
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/45281


    題名: An Efficient GA-Based Clustering Technique
    作者: 林慧珍;Lin, Hwei-jen;Yang, Fu-wen;Kao, Yang-ta
    貢獻者: 淡江大學資訊工程學系
    關鍵詞: Unsupervised Clustering;Genetic Algorithms;Reproduction;Crossover;Mutation;Fitness;Cluster Validity
    日期: 2005-06-01
    上傳時間: 2010-03-26 18:55:24 (UTC+8)
    出版者: 淡江大學
    摘要: In this paper, we propose a GA-based unsupervised clustering technique that selects cluster centers directly from the data set, allowing it to speed up the fitness evaluation by constructing a look-up table in advance, saving the distances between all pairs of data points, and by using binary representation rather than string representation to encode a variable number of cluster centers. More effective versions of operators for reproduction, crossover, and mutation are introduced. Finally, the Davies-Bouldin index is employed to measure the validity of clusters. The development of our algorithm has demonstrated an ability to properly cluster a variety of data sets. The experimental results show that the proposed algorithm provides a more stable clustering performance in terms of number of clusters and clustering results. This results in considerable less computational time required, when compared to other GA-based clustering algorithms.
    關聯: 淡江理工學刊=Tamkang journal of science and engineering 8(2), pp.113-122
    DOI: 10.6180/jase.2005.8.2.04
    顯示於類別:[資訊工程學系暨研究所] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    0KbUnknown251檢視/開啟
    1560-6686_8-2-4.pdf1192KbAdobe PDF459檢視/開啟

    在機構典藏中所有的資料項目都受到原著作權保護.

    TAIR相關文章

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