• DocumentCode
    2737917
  • Title

    A frequent itemset storing structure

  • Author

    Zuyi, Chen ; Taixiang, Zhao

  • Author_Institution
    Dept. of Found., First Aeronaut. Inst. of Air Force, Xinyang, China
  • fYear
    2011
  • fDate
    21-23 Oct. 2011
  • Firstpage
    680
  • Lastpage
    683
  • Abstract
    Many decision support systems need to support online interactive frequent itemset mining, however, frequent itemset mining is an intensive computation process. This paper proposes an Fp-tree-based structure-BFp-tree to store frequent itemsets. This structure store pre-computed frequent itemsets on a disk to support online mining requests.
  • Keywords
    Internet; data mining; decision support systems; interactive systems; storage management; trees (mathematics); BFp-tree; Fp-tree-based structure; decision support systems; frequent itemset storing structure; online interactive frequent itemset mining; Algorithm design and analysis; Association rules; Generators; Itemsets; BFp-tree; decision support system; frequent item mining;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Image Analysis and Signal Processing (IASP), 2011 International Conference on
  • Conference_Location
    Hubei
  • Print_ISBN
    978-1-61284-879-2
  • Type

    conf

  • DOI
    10.1109/IASP.2011.6109134
  • Filename
    6109134
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2737917