Sciweavers

466 search results - page 1 / 94
» RAIN: data clustering using randomized interactions between ...
Sort
View
ICMLA
2004
13 years 7 months ago
RAIN: data clustering using randomized interactions between data points
Abstract-- This paper introduces a generalization of the Gravitational Clustering Algorithm proposed by Gomez et all in [1]. First, it is extended in such a way that not only the G...
Jonatan Gómez, Olfa Nasraoui, Elizabeth Leo...
ICML
2006
IEEE
14 years 6 months ago
A new approach to data driven clustering
We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...
Arik Azran, Zoubin Ghahramani
EUSFLAT
2007
180views Fuzzy Logic» more  EUSFLAT 2007»
13 years 7 months ago
On Cluster Analysis Based on Fuzzy Relations Between Spatial Data
Methods like DBSCAN are widely used in the analysis of spatial data. These methods are based on the neighborhood relations which use distance between points. However, these neighb...
Efendi N. Nasibov, Gözde Ulutagay
KDD
2002
ACM
155views Data Mining» more  KDD 2002»
14 years 6 months ago
SyMP: an efficient clustering approach to identify clusters of arbitrary shapes in large data sets
We propose a new clustering algorithm, called SyMP, which is based on synchronization of pulse-coupled oscillators. SyMP represents each data point by an Integrate-and-Fire oscill...
Hichem Frigui
COLT
2004
Springer
13 years 11 months ago
On the Convergence of Spectral Clustering on Random Samples: The Normalized Case
Given a set of n randomly drawn sample points, spectral clustering in its simplest form uses the second eigenvector of the graph Laplacian matrix, constructed on the similarity gra...
Ulrike von Luxburg, Olivier Bousquet, Mikhail Belk...