396 search results - page 55 / 80 » Scalability for Clustering Algorithms Revisited |
108
click to vote
KDD
2005
ACM
16 years 7 days ago
2005
ACM
While scalable data mining methods are expected to cope with massive Web data, coping with evolving trends in noisy data in a continuous fashion, and without any unnecessary stopp...
101
click to vote
IPPS
1996
IEEE
15 years 4 months ago
1996
IEEE
A common statistical problem is that of nding the median element in a set of data. This paper presents a fastand portable parallel algorithm for nding the median given a set of el...
KDD
2009
ACM
16 years 11 days ago
2009
ACM
Most of recommender systems try to find items that are most relevant to the older choices of a given user. Here we focus on the "surprise me" query: A user may be bored ...
107
click to vote
MICCAI
2002
Springer
16 years 21 days ago
2002
Springer
Abstract. High performance computing has become a key step to introduce computer tools, like real-time registration, in the medical field. To achieve real-time processing, one usua...
107
click to vote
SDM
2009
SIAM
15 years 9 months ago
2009
SIAM
Subspace clustering and frequent itemset mining via “stepby-step” algorithms that search the subspace/pattern lattice in a top-down or bottom-up fashion do not scale to large ...