148 search results - page 14 / 30 » Mining top-K frequent itemsets from data streams |
ICDE
2001
IEEE
14 years 10 months ago
2001
IEEE
We present a new algorithm for mining maximal frequent itemsets from a transactional database. Our algorithm is especially efficient when the itemsets in the database are very lon...
ICDE
2000
IEEE
14 years 10 months ago
2000
IEEE
Despite the overwhelming amounts of multimedia data recently generated and the significance of such data, very few people have systematically investigated multimedia data mining. ...
MLDM
2009
Springer
14 years 3 months ago
2009
Springer
We face the problem of novelty detection from stream data, that is, the identification of new or unknown situations in an ordered sequence of objects which arrive on-line, at cons...
CINQ
2004
Springer
14 years 9 days ago
2004
Springer
Inductive databases (IDBs) have been proposed to afford the problem of knowledge discovery from huge databases. With an IDB the user/analyst performs a set of very different operat...
ADMA
2005
Springer
13 years 10 months ago
2005
Springer
Efficient discovery of frequent patterns from large databases is an active research area in data mining with broad applications in industry and deep implications in many areas of d...