skip to main content
資源種類 顯示結果: 顯示結果: 查詢種類 索引

應用獨立率於切割式叢集法之研究

黃乙展; HUANG, YI-CHAN 李建億; Chien-I Lee; 教師在職進修資訊碩士學位班 2002

線上取得

  • 題名:
    應用獨立率於切割式叢集法之研究
  • 著者: 黃乙展; HUANG, YI-CHAN
  • 李建億; Chien-I Lee; 教師在職進修資訊碩士學位班
  • 主題: 獨立率; 切割式叢集法; 資料探勘; isolation ratio; partition clustering; data mining
  • 描述: 所謂切割式叢集法先給予一組初始值,再使用循環式重新配置,讓成員能在各群中互相轉移,以達到區域或整體最佳解。當使用切割式叢集法處理資料的過程中,常常會發現某一群的成員,在演算法未收斂前就不再更動。此時若我們此部份適時加以剔除,將可減少計算次數,節省運算時間。因此本論文將利用獨立率的機制來找出這些不再變動的部分,並加以剔除,如此不僅減少所有成員與各質心交互運算的次數,更加快收斂的速度,但必須花費部分時間去計算各中心間的關係。而所謂獨立率是指每一群的中心兩兩比較的距離,再除以各自的標準差。從實驗分析,在不同測試資料集的表現上,本論文所提出運用獨立率的演算法,均比傳統的切割式叢集法,節省計算時間並降低時間複雜度。
    Partition clustering methods are given a set of initial centers, it uses an iterative realocation technique that attempts to improve the partitioning by moving objects from one group to another and to achieve global optimality. There is a phenomenon in using partition clustering method to deal with data, the member in someone cluster will no change before the whole iterative stop. This time if we can skin to compute the partition that will save much time. Therefore, in this thesis, we modify the traditional partition clustering methods by applying the isolation ratio, where the isolation ratio is the distance between two clusters, divided by its own standard deviation. Our method is to use the isolation ratio to find the unmove parts and skip them, which can reduces the number of data to calculate with each center point, so it can save much of this time, but some computational time must be spent to calculate the relation of the distance between each center point. From the simulation results by testing some datasets, our method is faster than traditional partition clustering methods.
    碩士
  • 建立日期: 2002
  • 格式: 121 bytes
    text/html
  • 語言: 中文
  • 識別號: http://nutnr.lib.nutn.edu.tw/handle/987654321/4936
  • 資源來源: NUTN IR

正在檢索遠程資料庫,請稍等