Download Now Free registration required
Most known frequent item set mining approaches enumerate candidate item sets, determine their support, and prune candidates that fail to reach the user-specified minimum support. Apart from this scheme, the authors can use intersection approach for identifying frequent item set. But the intersection approach of transaction is the less researched area and need attention and improvement to be applied. To the best of their knowledge, there are only two basic algorithms: a cumulative scheme, which is based on a repository with which new transactions are intersected, and the Carpenter algorithm, which enumerates and intersects candidate transaction sets.
- Format: PDF
- Size: 129.46 KB