An adaptive algorithm for frequent pattern mining over data streams using diffset strategy Online publication date: Wed, 08-May-2019
by B. Subbulakshmi; C. Deisy
International Journal of Business Information Systems (IJBIS), Vol. 31, No. 1, 2019
Abstract: Frequent pattern mining using sliding window over data streams is commonly used due to its wide applicability. Determining suitable window size and detection of concept change are the major issues and can be addressed by having flexible window based on amount of changes in frequent patterns. For mining frequent patterns over data streams, vertical mining algorithms can be used. However, in these algorithms, size of transaction identifiers (tidsets) and the time for computation of intersection between tidsets is large. Moreover, presence of null transactions does not contribute any useful frequent patterns. A new algorithm called recent frequent pattern mining based on diffset with elimination of null transactions (RFP-DIFF-ENT) over data streams using variable size window is proposed. It stores difference of tidsets and eliminates null transactions which minimise memory and mining time. Experimental results show that proposed algorithm saves computation time, memory usage and minimises the number of frequent patterns.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Business Information Systems (IJBIS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook