Cited By
View all- Mozafari BZeng KZaniolo CElmagarmid AAgrawal D(2010)K*SQLProceedings of the 2010 ACM SIGMOD International Conference on Management of data10.1145/1807167.1807302(1143-1146)Online publication date: 6-Jun-2010
There has been much recent interest in on-line data mining. Existing mining algorithms designed for stored data are either not applicable or not effective on data streams, where real-time response is often needed and data characteristics change ...
Proposed algorithm discovers complete frequent itemsets from the stream data.It uses CanTree to store transactions and has an efficient algorithm for sliding-windows.GTree is proposed to find frequent itemsets and serves as a projection-tree.GTree uses ...
Frequent itemsets mining is an important problem in data mining. Frequent closed itemsets mining provides complete and condensed information for frequent pattern analysis thus reduces the memory cost without accuracy loss. Recently more research focus ...
IEEE Computer Society
United States