679 search results - page 51 / 136 » Scaling Clustering Algorithms to Large Databases |
110
click to vote
ICTAI
2003
IEEE
15 years 7 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...
148
click to vote
KDD
2012
ACM
13 years 4 months ago
2012
ACM
Most time series data mining algorithms use similarity search as a core subroutine, and thus the time taken for similarity search is the bottleneck for virtually all time series d...
138
click to vote
SIGMOD
2004
ACM
16 years 1 months ago
2004
ACM
Mining informative patterns from very large, dynamically changing databases poses numerous interesting challenges. Data summarizations (e.g., data bubbles) have been proposed to c...
121
click to vote
DAWAK
1999
Springer
15 years 6 months ago
1999
Springer
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient quer...
125
click to vote
JIIS
2000
15 years 1 months ago
2000
Abstract. Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on effi...