Fast algorithm for mining minimal generators of frequent closed itemsets and their applications

@article{Vo2009FastAF,
  title={Fast algorithm for mining minimal generators of frequent closed itemsets and their applications},
  author={Bay Vo and Bac H. Le},
  journal={2009 International Conference on Computers & Industrial Engineering},
  year={2009},
  pages={1407-1411}
}
  • Bay Vo, Bac H. Le
  • Published 2009 in
    2009 International Conference on Computers…
The number of frequent closed itemsets (FCIs) are usually fewer than numbers of frequent itemsets. However, it is necessary to find Minimal Generators (mGs) for mining association rule from them. The finding mGs approaches based on generating candidate lose timeliness when the number of frequent closed itemsets are large. In this paper, we present MG-CHARM, an efficient algorithm for finding all mGs of frequent closed itemsets. Based on the mGs properties mentioned in section 2.4, we develop an… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-7 of 7 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Zaki: Mining Non-Redundant Association Rules, Data

Mining and Knowledge Discovery, • 2004
View 7 Excerpts
Highly Influenced

Efficient algorithms for mining closed itemsets and their lattice structure

IEEE Transactions on Knowledge and Data Engineering • 2005
View 3 Excerpts
Highly Influenced

L

Y. Bastide, N. Pasquier, R. Taouil, G. Stumme
Lakhal: Mining Minimal Non-Redundant Association Rules using Closed Frequent Itemssets. In: 1 International Conference on Computational Logic, pp. 972 - 986 • 2000
View 5 Excerpts
Highly Influenced

E

S. B. Yahia, T. Hamrouni
M. Nguifo: Frequent Closed Itemset based Algorithms: A thorough Structural and Analytical Survey. In: ACM SIGKDD Explorations Newsletter 8 (1), pp. 93 - 104 • 2006
View 1 Excerpt

Nguifo : Frequent Closed Itemset based Algorithms : A thorough Structural and Analytical Survey

S. B. Yahia, T. Hamrouni, M. E.
ACM SIGKDD Explorations Newsletter • 2006

B

M. J. Zaki
Phoophakdee: MIRAGE: A Framework for Mining, Exploring, and Visualizing Minimal Association Rules. In: Technical Report 03-4, Computer Science Dept., Rensselaer Polytechnic Inst., July • 2003

Gouda : Fast Vertical Mining Using Diffsets

K.
Proc . Ninth ACM SIGKDD Int ' l Conf . Knowledge Discovery and Data Mining • 2003

K

M. J. Zaki
Gouda: Fast Vertical Mining Using Diffsets. In: Proc. Ninth ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining, pp. 326 - 335 • 2003

Phoophakdee : MIRAGE : A Framework for Mining , Exploring , and Visualizing Minimal Association Rules

M. J. Zaki, B.
2003

Similar Papers

Loading similar papers…