1768 search results - page 194 / 354 » Mining Very Large Databases |
130
Voted
DAWAK
2005
Springer
15 years 9 months ago
2005
Springer
The queries defined on data warehouses are complex and use several join operations that induce an expensive computational cost. This cost becomes even more prohibitive when querie...
125
click to vote
KDD
2010
ACM
15 years 7 months ago
2010
ACM
Compressing social networks can substantially facilitate mining and advanced analysis of large social networks. Preferably, social networks should be compressed in a way that they...
125
Voted
FIMI
2003
15 years 5 months ago
2003
The efficiency of frequent itemset mining algorithms is determined mainly by three factors: the way candidates are generated, the data structure that is used and the implementati...
125
click to vote
CIKM
2010
Springer
15 years 2 months ago
2010
Springer
Bursty features in text streams are very useful in many text mining applications. Most existing studies detect bursty features based purely on term frequency changes without takin...
115
Voted
KDD
2001
ACM
16 years 4 months ago
2001
ACM
This paper considers the framework of the so-called "market basket problem", in which a database of transactions is mined for the occurrence of unusually frequent item s...