CORR
2010
Springer
13 years 9 months ago
2010
Springer
This paper discusses the topic of dimensionality reduction for k-means clustering. We prove that any set of n points in d dimensions (rows in a matrix A ∈ Rn×d ) can be project...
COMGEO
2004
ACM
13 years 10 months ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
DICTA
2007
14 years 8 days ago
2007
Texture analysis of the liver for the diagnosis of cirrhosis is usually region-of-interest (ROI) based. Integrity of the label of ROI data may be a problem due to sampling. This p...
DBISP2P
2008
Springer
14 years 18 days ago
2008
Springer
K-Means clustering is widely used in information retrieval and data mining. Distributed K-Means variants have already been proposed, but none of the past algorithms scales to large...
COLT
2008
Springer
14 years 18 days ago
2008
Springer
Clustering Stability methods are a family of widely used model selection techniques applied in data clustering. Their unifying theme is that an appropriate model should result in ...
CLEF
2008
Springer
14 years 18 days ago
2008
Springer
This paper presents the first participation of the University of Ottawa group in the Photo Retrieval task at Image CLEF 2008. Our system uses Lucene for text indexing and LIRE for ...
COMPGEOM
2005
ACM
14 years 23 days ago
2005
ACM
In this paper, we show that there exists a (k, ε)-coreset for k-median and k-means clustering of n points in IRd , which is of size independent of n. In particular, we construct ...
FLAIRS
2008
14 years 1 months ago
2008
This paper presents a strategy for shape-based image retrieval in which moment invariants form a feature vector to describe the shape of an object. Fuzzy k-means clustering is use...
IWCMC
2010
ACM
14 years 3 months ago
2010
ACM
—Analysis and modeling of wireless networks greatly depend on understanding the structure of underlying mobile nodes. In this paper we present two clustering algorithms to determ...
ISAAC
2005
Springer
14 years 4 months ago
2005
Springer
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...