본문 바로가기
  • Home

Selection of Cluster Hierarchy Depth and Initial Centroids in Hierarchical Clustering using K-Means Algorithm

  • Journal of the Korean Society for Information Management
  • Abbr : JKOSIM
  • 2004, 21(4), pp.173~186
  • DOI : 10.3743/KOSIM.2004.21.4.173
  • Publisher : 한국정보관리학회
  • Research Area : Interdisciplinary Studies > Library and Information Science
  • Received : November 17, 2004
  • Accepted : December 18, 2004
  • Published : December 30, 2004

Shin-Won Lee 1 An Dong Un 2 Chung Seong Jong 2

1중원대학교
2전북대학교

Accredited

ABSTRACT

Fast and high-quality document clustering algorithms play an important role in providing data exploration by organizing large amounts of information into a small number of meaningful clusters. Many papers have shown that the hierarchical clustering method takes good-performance, but is limited because of its quadratic time complexity. In contrast, with a large number of variables, K-means has a time complexity that is linear in the number of documents, but is thought to produce inferior clusters. In this paper, Condor system using K-Means algorithm Compares with regular method that the initial centroids have been established in advance, our method performance has been improved a lot.

Journal Copyright Policy

BY-NC-ND 아이콘

This license enables reusers to copy and distribute the material in any medium or format in unadapted form only, for noncommercial purposes only, and only if attribution is given to the creator.

Citation status

* References for papers published after 2025 are currently being built.