Sciweavers

SIGKDD
2000
95views more  SIGKDD 2000»
14 years 6 days ago
Scalability for Clustering Algorithms Revisited
This paper presents a simple new algorithm that performs k-means clustering in one scan of a dataset, while using a bu er for points from the dataset of xed size. Experiments show...
Fredrik Farnstrom, James Lewis, Charles Elkan
TKDE
2008
162views more  TKDE 2008»
14 years 10 days ago
Continuous k-Means Monitoring over Moving Objects
Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. S...
Zhenjie Zhang, Yin Yang, Anthony K. H. Tung, Dimit...
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
14 years 10 days ago
How Fast Is the k-Means Method?
We present polynomial upper and lower bounds on the number of iterations performed by the k-means method (a.k.a. Lloyd's method) for k-means clustering. Our upper bounds are ...
Sariel Har-Peled, Bardia Sadri
IJBRA
2007
116views more  IJBRA 2007»
14 years 11 days ago
Biomedical ontology improves biomedical literature clustering performance: a comparison study
: Document clustering has been used for better document retrieval and text mining. In this paper, we investigate if a biomedical ontology improves biomedical literature clustering ...
Illhoi Yoo, Xiaohua Hu, Il-Yeol Song
PAMI
2006
134views more  PAMI 2006»
14 years 11 days ago
A Genetic Algorithm Using Hyper-Quadtrees for Low-Dimensional K-means Clustering
The k-means algorithm is widely used for clustering because of its computational efficiency. Given n points in d-dimensional space and the number of desired clusters k, k-means see...
Michael Laszlo, Sumitra Mukherjee
PR
2008
88views more  PR 2008»
14 years 11 days ago
Modified global k
Clustering in gene expression data sets is a challenging problem. Different algorithms for clustering of genes have been proposed. However due to the large number of genes only a ...
Adil M. Bagirov
IDA
2007
Springer
14 years 11 days ago
In search of deterministic methods for initializing K-means and Gaussian mixture clustering
The performance of K-means and Gaussian mixture model (GMM) clustering depends on the initial guess of partitions. Typically, clus∗ corresponding author 1
Ting Su, Jennifer G. Dy
KAIS
2006
126views more  KAIS 2006»
14 years 12 days ago
Fast and exact out-of-core and distributed k-means clustering
Clustering has been one of the most widely studied topics in data mining and k-means clustering has been one of the popular clustering algorithms. K-means requires several passes ...
Ruoming Jin, Anjan Goswami, Gagan Agrawal
CORR
2008
Springer
158views Education» more  CORR 2008»
14 years 16 days ago
Improved Smoothed Analysis of the k-Means Method
The k-means method is a widely used clustering algorithm. One of its distinguished features is its speed in practice. Its worst-case running-time, however, is exponential, leaving...
Bodo Manthey, Heiko Röglin
BMCBI
2008
160views more  BMCBI 2008»
14 years 17 days ago
A comparison of four clustering methods for brain expression microarray data
Background: DNA microarrays, which determine the expression levels of tens of thousands of genes from a sample, are an important research tool. However, the volume of data they pr...
Alexander L. Richards, Peter Holmans, Michael C. O...