60 search results - page 3 / 12 » Density geodesics for similarity clustering |
CIKM
2006
Springer
13 years 7 months ago
2006
Springer
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
SDM
2003
SIAM
13 years 7 months ago
2003
SIAM
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
SYNASC
2005
IEEE
13 years 11 months ago
2005
IEEE
The aim of this work is to analyze the applicability of crowding differential evolution to unsupervised clustering. The basic idea of this approach, interpreting the clustering pr...
SODA
2008
ACM
13 years 7 months ago
2008
ACM
We introduce a new feature size for bounded domains in the plane endowed with an intrinsic metric. Given a point x in a domain X, the homotopy feature size of X at x measures half...
GFKL
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. A method for measuring the density of data sets that contain an unknown number of clusters of unknown sizes is proposed. This method, called Pareto Density Estimation (PD...