Sciweavers

647 search results - page 70 / 130
» Unsupervised possibilistic clustering
Sort
View
KDD
2002
ACM
155views Data Mining» more  KDD 2002»
14 years 8 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
KDD
2001
ACM
166views Data Mining» more  KDD 2001»
14 years 8 months ago
Generalized clustering, supervised learning, and data assignment
Clustering algorithms have become increasingly important in handling and analyzing data. Considerable work has been done in devising effective but increasingly specific clustering...
Annaka Kalton, Pat Langley, Kiri Wagstaff, Jungsoo...
ICPR
2008
IEEE
14 years 2 months ago
A clustering algorithm combine the FCM algorithm with supervised learning normal mixture model
In this paper we propose a new clustering algorithm which combines the FCM clustering algorithm with the supervised learning normal mixture model; we call the algorithm as the FCM...
Wei Wang, Chunheng Wang, Xia Cui, Ai Wang
ICPR
2008
IEEE
14 years 2 months ago
A uniformity criterion and algorithm for data clustering
We propose a novel multivariate uniformity criterion for testing uniformity of point density in an arbitrary dimensional point pattern . An unsupervised, nonparametric data cluste...
Sanketh Shetty, Narendra Ahuja
ECML
2007
Springer
14 years 2 months ago
Spectral Clustering and Embedding with Hidden Markov Models
Abstract. Clustering has recently enjoyed progress via spectral methods which group data using only pairwise affinities and avoid parametric assumptions. While spectral clustering ...
Tony Jebara, Yingbo Song, Kapil Thadani