Method and apparatus for finding maximal frequent itemsets over data streams

摘要

A method for searching the most frequent item sets from a data stream and an apparatus therefor are provided to search the most frequent item sets as reducing the execution time and used amount of a memory by using an electric potential tree. A transaction Tk generated in at the moment k is inputted(210). Information of each node corresponding to item sets included in the Tk is updated among nodes of an electric potential tree(220). Each node corresponding to item sets which are not managed under the electric potential tree among item sets included in Tk is added to the electric potential tree(230). Information of the added nodes is set up. A mark among nodes of the electric potential tree visits the most frequent item sets, and checks whether corresponding item sets are frequent to search the most frequent item sets(260).