Mining Popular Patterns: A Novel Mining Problem and Its Application to Static Transactional Databases and Dynamic Data Streams

被引:6
作者
Cuzzocrea, Alfredo [1 ,2 ]
Jiang, Fan [3 ]
Leung, Carson K. [3 ]
Liu, Dacheng [3 ,4 ]
Peddle, Aaron [3 ]
Tanbeer, Syed K. [3 ]
机构
[1] CNR, ICAR, I-87036 Arcavacata Di Rende, CS, Italy
[2] Univ Calabria, I-87036 Arcavacata Di Rende, CS, Italy
[3] Univ Manitoba, Winnipeg, MB, Canada
[4] Wuhan Univ, Wuhan 430072, Hubei, Peoples R China
来源
TRANSACTIONS ON LARGE-SCALE DATA- AND KNOWLEDGE-CENTERED SYSTEMS XXI | 2015年 / 9260卷
关键词
Data mining; Knowledge discovery; Interesting patterns; Popular patterns; Useful patterns; Tree-based mining; Data streams;
D O I
10.1007/978-3-662-47804-2_6
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Since the introduction of the frequent pattern mining problem, researchers have extended frequent patterns to different useful patterns such as cyclic, emerging, periodic and regular patterns. In this paper, we (i) introduce popular patterns, which capture the popularity of individuals, items, or events among their peers or groups. Moreover, we also propose (ii) the Pop-tree structure to capture the essential information from transactional databases and (iii) the Pop-growth algorithm formining popular patterns from the Pop-tree. Moreover, we illustrate how our algorithm (iv) mines popular friends from social networks. As we are not confined to mining popular patterns from static transactional databases, we extend our work to mining popular patterns from dynamic data streams. Specifically, we propose (v) the Pop-stream structure to capture the popular patterns in batches of data streams and (vi) the Pop-streaming algorithm for mining popular patterns from the Pop-stream structure. Experimental results showed that (i) our proposed tree structure is compact and space efficient and (ii) our proposed algorithm is time efficient in mining popular patterns from static transactional databases and dynamic data streams.
引用
收藏
页码:115 / 139
页数:25
相关论文
共 34 条
  • [1] [Anonymous], 2013, 17 INT DATABASE EN
  • [2] [Anonymous], DATA MINING NEXT GEN
  • [3] [Anonymous], 1995, FUZZINESS DATABASE M
  • [4] Bailey J., 2002, Principles of Data Mining and Knowledge Discovery. 6th European Conference, PKDD 2002. Proceedings (Lecture Notes in Artificial Intelligence Vol.2431), P39
  • [5] Storing and retrieving XPath fragments in structured P2P networks
    Bonifati, Angela
    Cuzzocrea, Alfredo
    [J]. DATA & KNOWLEDGE ENGINEERING, 2006, 59 (02) : 247 - 269
  • [6] Cameron J. J., 2011, Proceedings of the 2011 IEEE 9th International Conference on Dependable, Autonomic and Secure Computing (DASC 2011), P824, DOI 10.1109/DASC.2011.141
  • [7] Density-Based Clustering over an Evolving Data Stream with Noise
    Cao, Feng
    Ester, Martin
    Qian, Weining
    Zhou, Aoying
    [J]. PROCEEDINGS OF THE SIXTH SIAM INTERNATIONAL CONFERENCE ON DATA MINING, 2006, : 328 - +
  • [8] Castelltort M., 2010, Estudios Turisticos, P7
  • [9] Chen YC, 2007, IEEE C ELEC DEVICES, P761
  • [10] A distributed system for answering range queries on sensor network data
    Cuzzocrea, A
    Furfaro, F
    Greco, S
    Masciari, E
    Mazzeo, GM
    Saccà, D
    [J]. THIRD IEEE INTERNATIONAL CONFERENCE ON PERVASIVE COMPUTING AND COMMUNICATIONS, WORKSHOPS, 2005, : 369 - 373