Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

PSP-AMS

PSP-AMS Sequential pattern mining is used to find frequent data sequences over time. When sequential patterns are generated, the newly arriving patterns may not be identified as frequent sequential patterns due to the existence of old data and sequences. Progressive sequential pattern mining aims to find the most up-to-date sequential patterns given that obsolete items will be deleted from the sequences. When sequences come with multiple data streams, it is difficult to maintain and update the current sequential patterns. Even worse, when we consider the sequences across multiple streams, previous methods cannot efficiently compute the frequent sequential patterns. In this work, we propose an efficient algorithm PSP-AMS to address this problem. PSP-AMS uses a novel data structure PSP-MS-tree to insert new items, update current items, and delete obsolete items. By maintaining a PSP-MS-tree, PSP-AMS efficiently finds the frequent sequential patterns across multiple streams. The experimental results show that PSP-AMS significantly outperforms previous algorithms for mining of progressive sequential patterns across multiple streams on synthetic data as well as real data. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Knowledge Discovery from Data (TKDD) Association for Computing Machinery

PSP-AMS

Download PDF
23 pages

Loading next page...
 
/lp/association-for-computing-machinery/psp-ams-RWaGtxKOMT
Publisher
Association for Computing Machinery
Copyright
Copyright © 2018 ACM
ISSN
1556-4681
eISSN
1556-472X
DOI
10.1145/3281632
Publisher site
See Article on Publisher Site

Abstract

Sequential pattern mining is used to find frequent data sequences over time. When sequential patterns are generated, the newly arriving patterns may not be identified as frequent sequential patterns due to the existence of old data and sequences. Progressive sequential pattern mining aims to find the most up-to-date sequential patterns given that obsolete items will be deleted from the sequences. When sequences come with multiple data streams, it is difficult to maintain and update the current sequential patterns. Even worse, when we consider the sequences across multiple streams, previous methods cannot efficiently compute the frequent sequential patterns. In this work, we propose an efficient algorithm PSP-AMS to address this problem. PSP-AMS uses a novel data structure PSP-MS-tree to insert new items, update current items, and delete obsolete items. By maintaining a PSP-MS-tree, PSP-AMS efficiently finds the frequent sequential patterns across multiple streams. The experimental results show that PSP-AMS significantly outperforms previous algorithms for mining of progressive sequential patterns across multiple streams on synthetic data as well as real data.

Journal

ACM Transactions on Knowledge Discovery from Data (TKDD) – Association for Computing Machinery

Published: Dec 19, 2018

Keywords: Progressive mining

References

  • Mining sequential patterns
    Agrawal, R.; Srikant, R.
  • Sequential pattern mining using a bitmap representation
    Ayres, J.; Flannick, J.; Gehrke, J.; Yiu, T.
  • SeqStream: Mining closed sequential patterns over stream sliding windows
    Chang, L.; Wang, T.; Yang, D.; Luan, H.
  • Sequential pattern mining in multiple streams
    Chen, G.; Wu, X.; Zhu, X.
  • Mining appliance usage patterns in smart home environment
    Chen, Yi-Cheng; Ko, Yu-Lun; Peng, Wen-Chih; Lee, Wang-Chien
  • IncSpan: Incremental mining of sequential patterns in large database
    Cheng, Hong; Yan, Xifeng; Han, Jiawei
  • Clustering on demand for multiple data streams
    Dai, Bi-Ru; Huang, Jen-Wei; Yeh, Mi-Yen; Chen, Ming-Syan
  • Adaptive clustering for multiple evolving streams
    Dai, Bi-Ru; Huang, Jen-Wei; Yeh, Mi-Yen; Chen, Ming-Syan
  • SSM: A frequent sequential data stream patterns miner
    Ezeife, C. I.; Monwar, M.
  • Incremental mining of sequential patterns over a stream sliding window
    Ho, Chin-Chuan; Li, Hua-Fu; Kuo, Fang-Fei; Lee, Suh-Yin
  • DPSP: Distributed progressive sequential pattern mining on the cloud
    Huang, Jen-Wei; Lin, Su-Chen; Chen, Ming-Syan
  • A general model for sequential pattern mining with a progressive database
    Huang, Jen-Wei; Tseng, Chi-Yao; Ou, Jian-Chih; Chen, Ming-Syan
  • Mining frequent progressive usage patterns across multiple mobile broadcasting channels
    Jaysawal, Bijay Prasad; Huang, Jen-Wei
  • Efficient support coupled frequent pattern mining over progressive databases
    Keshavamurthy, Bettahally N.; Sharma, Mitesh; Toshniwal, Durga
  • KDD-cup 2000 organizers’ report: Peeling the onion
    Kohavi, Ron; Brodley, Carla E.; Frasca, Brian; Mason, Llew; Zheng, Zijian
  • PTree: Mining sequential patterns efficiently in multiple data streams environment
    Lee, Guanling; Chen, Yi-Chun; Hung, Kuo-Che
  • Extracting temporal behavior patterns of mobile user
    Lee, S. C.; Lee, E.; Choi, W.; Kim, U. M.
  • DFSP: A depth-first SPelling algorithm for sequential pattern mining of biological sequences
    Liao, Vance Chiang-Chi; Chen, Ming-Syan
  • Mining cluster-based mobile sequential patterns in location-based service environments
    Lu, E. H. C.; Tseng, V. S.
  • Extracting sequential patterns from progressive databases: A weighted approach
    Mhatre, A.; Verma, M.; Toshniwal, D.
  • Improvements of IncSpan: Incremental mining of sequential patterns in large database
    Nguyen, SonN.; Sun, Xingzhi; Orlowska, MariaE.
  • Incremental and interactive sequence mining
    Parthasarathy, S.; Zaki, M. J.; Ogihara, M.; Dwarkadas, S.
  • Mining sequential patterns by pattern-growth: The PrefixSpan approach
    Pei, J.; Han, J.; Mortazavi-Asl, B.; Wang, J.; Pinto, H.; Chen, Q.; Dayal, U.; Hsu, M.-C.
  • Mining sequential patterns across multiple sequence databases
    Peng, Wen-Chih; Liao, Zhung-Xun
  • SPEED: Mining maxirnal sequential patterns over data streams
    Raissi, C.; Poncelet, P.; Teisseire, M.
  • High utility pattern mining over data streams with sliding window technique
    Ryang, Heungmo; Yun, Unil
  • Mining temporal mobile sequential patterns in location-based service environments
    Tseng, V. S.; Lu, E. Hsueh-Chan; Huang, Cheng-Hsien
  • Mining sequential alarm patterns in a telecommunication database
    Wu, Pei-Hsin; Peng, Wen-Chih; Chen, Ming-Syan
  • Research issues in mining multiple data streams
    Wu, Wenyan; Gruenwald, Le
  • Sequential pattern mining in data streams using the weighted sliding window model
    Xu, C.; Chen, Y.; Bie, R.
  • Incremental mining of across-streams sequential patterns in multiple data streams
    Yang, S.-Y.; Chao, C.-M.; Chen, P.-Z.; Sun, C.-H.
  • Clustering over multiple evolving streams by events and correlations
    Yeh, M. Y.; Dai, B. R.; Chen, M. S.
  • Mining mobile sequential patterns in a mobile commerce environment
    Yun, C. H.; Chen, M. S.
  • Mining recent high average utility patterns based on sliding window from stream data
    Yun, Unil; Kim, Donggyu; Ryang, Heungmo; Lee, Gangin; Lee, Kyung-Min
  • Sliding window based weighted erasable stream pattern mining for stream data applications
    Yun, Unil; Lee, Gangin
  • Efficient high utility pattern mining for establishing manufacturing plans with sliding window control
    Yun, U.; Lee, G.; Yoon, E.
  • Efficient mining of robust closed weighted sequential patterns without information loss
    Yun, Unil; Pyun, Gwangbum; Yoon, Eunchul
  • Efficient enumeration of frequent sequences
    Zaki, Mohammed J.