555 search results - page 62 / 111 » An Empirical Study on Web Mining of Parallel Data |
MASCOTS
2004
15 years 1 months ago
2004
This study introduces a new analytic queuing model, the N-Burst/G/1 model with heavy-tailed service-time distribution, which captures many of the issues that affect Web servers as...
KDD
1999
ACM
15 years 4 months ago
1999
ACM
We propose to use AdaBoost to efficiently learn classifiers over very large and possibly distributed data sets that cannot fit into main memory, as well as on-line learning wher...
111
click to vote
JIIS
2008
14 years 12 months ago
2008
In this paper, we study the incremental update of Frequent Closed Itemsets (FCIs) over a sliding window in a high-speed data stream. We propose the notion of semi-FCIs, which is to...
104
click to vote
ISPASS
2009
IEEE
15 years 6 months ago
2009
IEEE
Until recently, parallel programming has largely focused on the exploitation of data-parallelism in dense matrix programs. However, many important application domains, including m...
106
click to vote
IEEEHPCS
2010
14 years 10 months ago
2010
The problem of closed frequent itemset discovery is a fundamental problem of data mining, having applications in numerous domains. It is thus very important to have efficient par...