Efficiently mining frequent patterns from dense datasets using a cluster of computers
Efficient mining of frequent patterns from large databases has been an active area of research since it is the most expensive step in association rules mining. In this paper, we present an algorithm for finding complete frequent patterns from very large dense datasets in a cluster environment. The d...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Book Chapter |
| Published: |
Springer
2003
|
| Online Access: | http://hdl.handle.net/20.500.11937/17116 |