• DocumentCode
    3261193
  • Title

    A New Algorithm for Maintaining Closed Frequent Itemsets in Data Streams by Incremental Updates

  • Author

    Li, Hua-Fu ; Ho, Chin-Chuan ; Kuo, Fang-Fei ; Lee, Suh-Yin

  • Author_Institution
    Dept. of Comput. Sci., National Chiao Tung Univ., Hsinchu
  • fYear
    2006
  • fDate
    Dec. 2006
  • Firstpage
    672
  • Lastpage
    676
  • Abstract
    Online mining of closed frequent itemsets over streaming data is one of the most important issues in mining data streams. In this paper, we propose an efficient one-pass algorithm, NewMoment to maintain the set of closed frequent itemsets in data streams with a transaction-sensitive sliding window. An effective bit-sequence representation of items is used in the proposed algorithm to reduce the time and memory needed to slide the windows. Experiments show that the proposed algorithm not only attain highly accurate mining results, but also run significant faster and consume less memory than existing algorithm Moment for mining closed frequent itemsets over recent data streams
  • Keywords
    data mining; knowledge representation; transaction processing; NewMoment algorithm; bit-sequence representation; closed frequent itemsets; data streams; incremental updates; one-pass algorithm; online mining; transaction-sensitive sliding window; Algorithm design and analysis; Character generation; Computer science; Control systems; Data analysis; Data mining; Electronic mail; Error correction; Itemsets; Size control;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Data Mining Workshops, 2006. ICDM Workshops 2006. Sixth IEEE International Conference on
  • Conference_Location
    Hong Kong
  • Print_ISBN
    0-7695-2702-7
  • Type

    conf

  • DOI
    10.1109/ICDMW.2006.15
  • Filename
    4063710