1413 search results - page 194 / 283 » Mining Multiple Large Databases |
136
Voted
KDD
2008
ACM
16 years 2 months ago
2008
ACM
This paper presents a new algorithm for sequence prediction over long categorical event streams. The input to the algorithm is a set of target event types whose occurrences we wis...
134
click to vote
KDD
2007
ACM
16 years 2 months ago
2007
ACM
In some applications such as filling in a customer information form on the web, some missing values may not be explicitly represented as such, but instead appear as potentially va...
115
click to vote
KAIS
2008
15 years 1 months ago
2008
A complete set of frequent itemsets can get undesirably large due to redundancy when the minimum support threshold is low or when the database is dense. Several concise representat...
120
click to vote
EDBT
2004
ACM
16 years 2 months ago
2004
ACM
Due to the large difference between seek time and transfer time in current disk technology, it is advantageous to perform large I/O using a single sequential access rather than mu...
155
Voted
ICDE
2012
IEEE
13 years 4 months ago
2012
IEEE
—Many companies now routinely run massive data analysis jobs – expressed in some scripting language – on large clusters of low-end servers. Many analysis scripts are complex ...