Efficient mining of maximal frequent itemsets from databases on a cluster of workstations
Year of publication: |
2008
|
---|---|
Authors: | Chung, Soon M. ; Luo, Congnan |
Published in: |
Knowledge and information systems : an international journal. - Guildford : Springer-Verl. London, ISSN 0219-1377, ZDB-ID 2036569-X. - Vol. 16.2008, 3, p. 359-391
|
Subject: | Datenbank | Database | Data Mining | Data mining | Algorithmus | Algorithm | Theorie | Theory |
-
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)
-
DSM-FI : an efficient algorithm for mining frequent itemsets in data streams
Li, Hua-fu, (2008)
- More ...
-
A scalable algorithm for mining maximal frequent sequences using a sample
Luo, Congnan, (2008)
- More ...