Corpus ID: 124599590

Mining of maximum frequent itemsets and frequent closed itemsets based on frequent itemsets

@article{Feng2008MiningOM,
  title={Mining of maximum frequent itemsets and frequent closed itemsets based on frequent itemsets},
  author={X. Feng},
  journal={Computer Engineering and Applications},
  year={2008}
}
  • X. Feng
  • Published 2008
  • Computer Science
  • Computer Engineering and Applications
    • In this paper,a new kind of algorithms BFI-DMFI(Mining Maximum Frequent Itemsets) and BFI-DCFI(Mining Frequent Closed Itemsets) is proposed.In BFI-DMFI,we can confirm whether a frequent itemsets is also a maximum frequent itemsets through detecting whether exiting their superset itemsets in frequent itemsets.In BFI-DCFI,in order to generate frequent closed itemsets,we can make use of mining maximum frequent itemsets from frequent itemsets which have equal support.This kind of algorithms… CONTINUE READING
    2 Citations

    Topics from this paper

    Explore Further: Topics Discussed in This Paper

      2 Citations
      Citation Type

      Citation Type

      A fast algorithm for discovering maximum frequent itemsets
      • Y. Kai, M. Yuan
      • Computer Science
      • 2011 IEEE 3rd International Conference on Communication Software and Networks
      • 2011
      • 4
      Research on Algorithm for Mining Frequent Closed Itemsets over Data Stream
      • W. Yan, L. Sheng, Wang Xiu-xia
      • Computer Science
      • 2010 International Conference on Artificial Intelligence and Computational Intelligence
      • 2010