TDP
2010
12 years 11 months ago
2010
The ability to store vast quantities of data and the emergence of high speed networking have led to intense interest in distributed data mining. However, privacy concerns, as well ...
PR
2007
13 years 4 months ago
2007
Given a data set, a dynamical procedure is applied to the data points in order to shrink and separate, possibly overlapping clusters. Namely, Newton’s equations of motion are em...
TKDE
2008
13 years 4 months ago
2008
Clustering is inherently a difficult task and is made even more difficult when the selection of relevant features is also an issue. In this paper, we propose an approach for simult...
CLASSIFICATION
2008
13 years 4 months ago
2008
: We present a new iterative method for probabilistic clustering of data. Given clusters, their centers and the distances of data points from these centers, the probability of clus...
SEDE
2008
13 years 6 months ago
2008
: In this paper, we present reliable algorithms for fuzzy k-means and C-means that could improve MRI segmentation. Since the k-means or FCM method aims to minimize the sum of squar...
PAKDD
2005
ACM
13 years 10 months ago
2005
ACM
Density-based clustering has the advantages for (i) allowing arbitrary shape of cluster and (ii) not requiring the number of clusters as input. However, when clusters touch each o...