14 search results - page 1 / 3 » Iterative Clustering of High Dimensional Text Data Augmented... |
ICDM
2002
IEEE
13 years 10 months ago
2002
IEEE
The k-means algorithm with cosine similarity, also known as the spherical k-means algorithm, is a popular method for clustering document collections. However, spherical k-means ca...
ICDE
2008
IEEE
14 years 6 months ago
2008
IEEE
Finding latent patterns in high dimensional data is an important research problem with numerous applications. Existing approaches can be summarized into 3 categories: feature selec...
DEXA
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...
KDD
2008
ACM
14 years 5 months ago
2008
ACM
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
ICDM
2006
IEEE
13 years 11 months ago
2006
IEEE
The k-means algorithm is a popular clustering method used in many different fields of computer science, such as data mining, machine learning and information retrieval. However, ...