Skip to Main Content
In traditional study of mining data stream, each item in the data stream is of equal importance. However, in practice, each item has a different significance, which is known as utility. This paper combines frequent mining item sets with utility and proposes an efficient algorithm for utility frequent pattern mining (UFPM). It combines bitmap with tree structure that can store and update the pattern of data stream quickly and completely by scanning only once. The algorithm generated by lexicographic order, proposes a novel tree U-tree and makes convenience for pattern updating and user reading. With a pattern growth approach in mining, the algorithm can effectively avoid the problem of a mass candidacy generation by level-wise searching. The experiments results show that our algorithm which is in high efficiency and good scalability outperforms the existing analogous algorithm.
Date of Conference: 12-14 Jan. 2012