DSM-FI : an efficient algorithm for mining frequent itemsets in data streams
Hua-Fu Li; Man-Kwan Shan; Suh-Yin Lee
Year of publication: |
2008
|
---|---|
Authors: | Li, Hua-fu ; Shan, Man-kwan ; Lee, Suh-yin |
Published in: |
Knowledge and information systems : an international journal. - Guildford : Springer-Verl. London, ISSN 0219-1377, ZDB-ID 2036569-X. - Vol. 17.2008, 1, p. 79-97
|
Subject: | Data Mining | Data mining | Datenbank | Database | Algorithmus | Algorithm | Theorie | Theory |
Saved in:
Saved in favorites
Similar items by subject
-
Efficient mining of maximal frequent itemsets from databases on a cluster of workstations
Chung, Soon M., (2008)
-
A scalable algorithm for mining maximal frequent sequences using a sample
Luo, Congnan, (2008)
-
A new concise representation of frequent itemsets using generators and a positive border
Liu, Guimei, (2008)
- More ...
Similar items by person