English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 18057/20255 (89%)
造訪人次 : 1486514      線上人數 : 708
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: https://ir.cnu.edu.tw/handle/310902800/26974


    標題: A time-efficient pattern reduction algorithm for k-means clustering
    作者: Chiang, Ming-Chao
    Tsai, Chun-Wei
    Yang, Chu-Sing
    貢獻者: 應用空間資訊系
    關鍵字: Data clustering
    k-means
    Pattern reduction
    日期: 2011-02
    上傳時間: 2013-10-14 14:57:44 (UTC+8)
    出版者: Elsevier
    摘要: This paper presents an efficient algorithm, called pattern reduction (PR), for reducing the computation time of k-means and k-means-based clustering algorithms. The proposed algorithm works by compressing and removing at each iteration patterns that are unlikely to change their membership thereafter. Not only is the proposed algorithm simple and easy to implement, but it can also be applied to many other iterative clustering algorithms such as kernel-based and population-based clustering algorithms. Our experiments—from 2 to 1000 dimensions and 150 to 10,000,000 patterns—indicate that with a small loss of quality, the proposed algorithm can significantly reduce the computation time of all state-of-the-art clustering algorithms evaluated in this paper, especially for large and high-dimensional data sets.
    關聯: Information Sciences , 181(4), pp.716-731
    顯示於類別:[應用空間資訊系(所)] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML2364檢視/開啟


    在CNU IR中所有的資料項目都受到原著作權保護.

    TAIR相關文章

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