Mining recent frequent cooccurring items from transaction stream

被引:0
|
作者
Misra, Sumit [1 ]
Thakur, Soumyadeep [1 ]
Ghosh, Manosij [1 ]
Saha, Sanjoy Kumar [1 ]
机构
[1] Department of Computer Science and Engineering, Jadavpur University, Kolkata,700032, India
关键词
D O I
10.1504/IJDS.2019.105239
中图分类号
学科分类号
摘要
The work presents a simple but novel scheme to determine the recent frequent cooccurring items from transaction streams. It enables to follow the current trend, pattern of occurrence of the items and also help in recommendation. Proposed methodology works on a sequence of transaction forming a time-window. Based on the items present in a transaction, item-sets are formed and encoded. An in-memory structure maintains the frequency of the item-sets. Frequency is time-decayed count that prioritises the recent occurrences. To limit the size of in-memory structure, a pruning operation is carried out to remove the less frequent item-sets. Threshold for pruning is chosen dynamically. Impacts of decaying parameter and window size are also analysed. Experiment has been carried out on two datasets and performance has been compared with two recent works. Proposed methodology provides a better accuracy. Low time and space complexity make it suitable for stream analytic. Copyright © 2019 Inderscience Enterprises Ltd.
引用
收藏
页码:288 / 304
相关论文
共 50 条
  • [1] Memory efficient algorithm for mining recent frequent items in a stream
    Kolaczkowski, Piotr
    [J]. Rough Sets and Intelligent Systems Paradigms, Proceedings, 2007, 4585 : 485 - 494
  • [2] A New Approach for Mining Frequent Items in Data Stream
    Tu, Li
    Chen, Ling
    [J]. 2010 INTERNATIONAL COLLOQUIUM ON COMPUTING, COMMUNICATION, CONTROL, AND MANAGEMENT (CCCM2010), VOL II, 2010, : 225 - 228
  • [3] Mining frequent items in a stream using flexible windows
    Calders, Toon
    Dexters, Nele
    Goethals, Bart
    [J]. INTELLIGENT DATA ANALYSIS, 2008, 12 (03) : 293 - 304
  • [4] Frequent Items Mining Based on Weight in Data Stream
    Liang, Ran
    Sun, Jianling
    [J]. TENCON 2009 - 2009 IEEE REGION 10 CONFERENCE, VOLS 1-4, 2009, : 1808 - 1810
  • [5] Frequent Items Mining on Data Stream Based on Time Fading Factor
    Zhang, Shan
    Chen, Ling
    Tu, Li
    [J]. 2009 INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND COMPUTATIONAL INTELLIGENCE, VOL IV, PROCEEDINGS, 2009, : 336 - +
  • [6] An Algorithm for Mining Frequent Items on Data Stream Using Fading Factor
    Chen, Ling
    Zhang, Shan
    Tu, Li
    [J]. 2009 IEEE 33RD INTERNATIONAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE, VOLS 1 AND 2, 2009, : 845 - +
  • [7] Mining frequent items in data stream using time fading model
    Chen, Ling
    Mei, Qingling
    [J]. INFORMATION SCIENCES, 2014, 257 : 54 - 69
  • [8] Algorithm based on counting for mining frequent items over data stream
    Zhu, Ranwei
    Wang, Peng
    Liu, Majin
    [J]. Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2011, 48 (10): : 1803 - 1811
  • [9] Frequent Items Mining on Data Stream Using Hash-Table and Heap
    Shan, Zhang
    Ling, Chen
    Li, Tu
    [J]. 2009 IEEE INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTING AND INTELLIGENT SYSTEMS, PROCEEDINGS, VOL 1, 2009, : 141 - +
  • [10] Mining Frequent Items in OLAP
    Jin, Ling
    Lim, Ji Yeon
    Kim, Iee Joon
    Cho, Kyung Soo
    Kim, Seung Kwan
    Kim, Ung Mo
    [J]. SECURE AND TRUST COMPUTING, DATA MANAGEMENT, AND APPLICATIONS, 2011, 187 : 25 - 30