Impact Factor: 7.883
Submit Paper
Volume 3, Issue 5 (May 2017)

Lattice Structure With Charm-l To Improve Efficiency Of Generating Frequently Closed Item Sets

Impact Factor
7.883
Call For Paper
Volume 12 Issue 07

July 2026

Download Paper Format
Copyright Form
Share on:

Author(s)

Bhumi Patel Mr. Ishan K Rajani

Abstract

Efficient Algorithms For Mining Frequent Item-sets Are Crucial For Mining Association Rules As Well As For Many Other Data Mining Tasks. Many Algorithms Are Available For Frequent Mining Like Apriori, Fp-Growth, CountTableFI, BinaryCounTableFI,etc. Propos


Keywords

Lattice Efficient Item Sets ScallingNextClosure

Paper ID

IJSARTV3I515321

Publication Date

May 22, 2017

Research Area

Computer Engineering

Submit Your Paper to IJSART

Join the global research community with IJSART. Submit your paper, share your work, and gain worldwide recognition!