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

• Author(s):

  Bhumi Patel | Mr. Ishan K Rajani

• Keywords:

  Lattice,Efficient,Item Sets,ScallingNextClosure

• 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

---

Other Details

• Paper id:

  IJSARTV3I515321

• Published in:

  Volume: 3 Issue: 5 May 2017

• Publication Date:

  2017-05-22

Download Article