Improved Transaction List Group Based Frequent Itemsets Mining Algorithm Based Frequent Itemsets Mining Algorithm On Data Streams
Xueli Zhang
Abstract
Xueli Zhang
Abstract
According to the characteristics of mass and time-varying for data,a improved transaction list group based frequent itemsets mining algorithm T-Stream upon data streams is proposed.The algorithm could self-adaptively adjust the size of time windows.In the algorithm,transaction list group is adopted as synopsis data structure.The experiments indicate that the T-Stream algorithm is more effective than the Manku algorithm in term of temporal and spatial performance.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
According to the characteristics of mass and time-varying for data,a improved transaction list group based frequent itemsets mining algorithm T-Stream upon data streams is proposed.The algorithm could self-adaptively adjust the size of time windows.In the algorithm,transaction list group is adopted as synopsis data structure.The experiments indicate that the T-Stream algorithm is more effective than the Manku algorithm in term of temporal and spatial performance.
Key concepts: Computer science, Database transaction, Data mining, Data stream mining, Algorithm, GSP Algorithm, Data stream, Transaction data