A Parallel Implementation of the Gustafson-Kessel Clustering Algorithm with CUDA

• SEO Jeong Bong

  School of Computer Science and Engineering, Chung-Ang University

• KIM Dae-Won

  School of Computer Science and Engineering, Chung-Ang University

抄録

Despite the benefits of the Gustafson-Kessel (GK) clustering algorithm, it becomes computationally inefficient when applied to high-dimensional data. In this letter, a parallel implementation of the GK algorithm on the GPU with CUDA is proposed. Using an optimized matrix multiplication algorithm with fast access to shared memory, the CUDA version achieved a maximum 240-fold speedup over the single-CPU version.

収録刊行物

• IEICE Transactions on Information and Systems

  IEICE Transactions on Information and Systems E95.D (4), 1162-1165, 2012

  一般社団法人 電子情報通信学会

キーワード

• clustering
• Gustafson-Kessel
• CUDA
• GPU

詳細情報

• CRID: 1390001204377417088
• NII論文ID: 10030942342
• NII書誌ID: AA10826272
• DOI: 10.1587/transinf.e95.d.1162
• BIBCODE: 2012IEITI..95.1162S
• ISSN: 17451361
• ISSN: 09168532
• Web Site: https://www.jstage.jst.go.jp/article/transinf/E95.D/4/E95.D_4_1162/_pdf
• 本文言語コード: en
• データソース種別:
  • JaLC
  • Crossref
  • CiNii Articles
• 抄録ライセンスフラグ: 使用不可