Thu, 21 Aug 2008 07:21:16 BST CiteULike: zeimpekis Dhillon http://www.citeulike.org/user/zeimpekis/author/Dhillon CiteULike.org en-gb Copyright © 2004-2008 citeulike.org http://www.citeulike.org/user/zeimpekis/article/478824 <i>Machine Learning, Vol. 42, No. 1. (2001), pp. 143-175.</i><br /><br />Unstructured text documents are becoming increasingly common and available; mining such data sets represents a major contemporary challenge. Using words as features, text documents are often represented as high-dimensional and sparse vectors--a few thousand dimensions and a sparsity of 95 to 99% is typical. In this paper, we study a certain spherical k-means algorithm for clustering such document vectors. The algorithm outputs k disjoint clusters each with a concept vector that is the centroid... Concept decompositions for large sparse text data using clustering IS Dhillon DS Modha Machine Learning, Vol. 42, No. 1. (2001), pp. 143-175. 2006-01-24T16:09:42-00:00 2001 Machine Learning 42 1 143 175 concept decomposition k-means spherical