960 search results - page 33 / 192 » CURE: An Efficient Clustering Algorithm for Large Databases |
141
click to vote
ICDM
2009
IEEE
15 years 10 months ago
2009
IEEE
This paper offers a local distributed algorithm for expectation maximization in large peer-to-peer environments. The algorithm can be used for a variety of well-known data mining...
230
Voted
ICDE
2007
IEEE
16 years 5 months ago
2007
IEEE
Traditional similarity or distance measurements usually become meaningless when the dimensions of the datasets increase, which has detrimental effects on clustering performance. I...
140
Voted
SIGMOD
1998
ACM
15 years 7 months ago
1998
ACM
Data mining applications place special requirements on clustering algorithms including: the ability to nd clusters embedded in subspaces of high dimensional data, scalability, end...
155
Voted
EUROPAR
2004
Springer
15 years 7 months ago
2004
Springer
Hierarchical agglomerative clustering (HAC) is a common clustering method that outputs a dendrogram showing all N levels of agglomerations where N is the number of objects in the d...
123
Voted
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
In this paper we explore the use of shapes of noses for
performing partial human biometrics. The basic idea is to
represent nasal surfaces using indexed collections of isocurves,...