960 search results - page 56 / 192 » CURE: An Efficient Clustering Algorithm for Large Databases |
134
Voted
SDM
2004
SIAM
15 years 5 months ago
2004
SIAM
A wide variety of distortion functions, such as squared Euclidean distance, Mahalanobis distance, Itakura-Saito distance and relative entropy, have been used for clustering. In th...
135
click to vote
SSPR
1998
Springer
15 years 8 months ago
1998
Springer
: We present a practical approach to nonparametric cluster analysis of large data sets. The number of clusters and the cluster centres are automatically derived by mode seeking wit...
157
Voted
CCS
2008
ACM
15 years 5 months ago
2008
ACM
We propose an approach for the selective enforcement of access control restrictions in, possibly distributed, large data collections based on two basic concepts: i) flexible autho...
128
Voted
KDD
2004
ACM
16 years 4 months ago
2004
ACM
Traditional clustering is a descriptive task that seeks to identify homogeneous groups of objects based on the values of their attributes. While domain knowledge is always the bes...
129
Voted
ICTAI
2003
IEEE
15 years 9 months ago
2003
IEEE
In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...