125 search results - page 9 / 25 » A Fast Parallel Clustering Algorithm for Large Spatial Datab... |
ICTAI
2003
IEEE
14 years 27 days 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...
ICDE
2012
IEEE
11 years 10 months ago
2012
IEEE
—Dimensionality reduction is essential in text mining since the dimensionality of text documents could easily reach several tens of thousands. Most recent efforts on dimensionali...
WSCG
2001
13 years 9 months ago
2001
We present strategies for parallelising ray tracing based on 5D adaptive subdivision. Our goals are to obtain good speed-up and to efficiently balance the load between the process...
KDD
2001
ACM
14 years 8 months ago
2001
ACM
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
KAIS
2006
13 years 7 months ago
2006
Clustering has been one of the most widely studied topics in data mining and k-means clustering has been one of the popular clustering algorithms. K-means requires several passes ...