An Efficient Algorithm for Mining Maximal Frequent Sequential Patterns in Large Databases

被引：0
|
作者：
Su, Qiu-bin [1 ]
Lu, Lu [1 ,2 ]
Cheng, Bin [1 ]
机构：
[1] South China Univ Technol, Sch Comp Sci & Engn, Guangzhou, Guangdong, Peoples R China
[2] South China Univ Technol, Modern Ind Technol Res Inst, Zhongshan, Peoples R China
来源：
2018 INTERNATIONAL CONFERENCE ON COMMUNICATION, NETWORK AND ARTIFICIAL INTELLIGENCE (CNAI 2018) | 2018年
关键词：
Sequential pattern mining; Frequent sequence mining; Pruning strategy; data stream;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Frequent sequence mining is one of the important research directions of click stream analysis, this paper studies the problem of mining maximal frequent sequences in mobile app clickstreams. Different from frequent itemsets mining, frequent sequence mining takes the time order of elements into account. In this paper, MFSGrowth(Maximal Frequent Sequence Growth) is proposed for fast discovery of frequent sequence. MFSGrowth is an efficient algorithm based on the FP Tree, combined with the storage characteristics of the TriedTree, experiments show that the algorithm performs well in both mining time and storage efficiency.
引用
收藏
页码：404 / 410
页数：7
相关论文
共 50 条
  • [31] An Efficient Algorithm For Mining Top-Rank-K Frequent Patterns From Uncertain Databases
    Goyal, Neha
    Jain, S. K.
    [J]. PROCEEDINGS OF THE 2016 2ND INTERNATIONAL CONFERENCE ON APPLIED AND THEORETICAL COMPUTING AND COMMUNICATION TECHNOLOGY (ICATCCT), 2016, : 324 - 328
  • [32] An efficient maximal frequent itemsets mining algorithm - Based on frequent pattern tree
    Xue, XR
    Wang, GY
    Wu, Y
    Yang, SX
    [J]. DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES B-APPLICATIONS & ALGORITHMS, 2005, 1 : 176 - 181
  • [33] Efficient Mining of Frequent Item Sets on Large Uncertain Databases
    Wang, Liang
    Cheung, David Wai-Lok
    Cheng, Reynold
    Lee, Sau Dan
    Yang, Xuan S.
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2012, 24 (12) : 2170 - 2183
  • [34] An efficient algorithm for incremental mining of sequential patterns
    Ren, Jia-Dong
    Zhou, Xiao-Lei
    [J]. ADVANCES IN MACHINE LEARNING AND CYBERNETICS, 2006, 3930 : 179 - 188
  • [35] A high efficient algorithm of mining sequential patterns
    Qin, F
    Yang, XB
    [J]. PROCEEDINGS OF THE 3RD WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-5, 2000, : 3750 - 3752
  • [36] An Efficient Parallel Method for Mining Frequent Closed Sequential Patterns
    Bao Huynh
    Bay Vo
    Snasel, Vaclav
    [J]. IEEE ACCESS, 2017, 5 : 17392 - 17402
  • [37] An Efficient Approach to Discovering Sequential Patterns in Large Databases
    Yen, Show-Jane
    Cho, Chung-Wen
    [J]. LECTURE NOTES IN COMPUTER SCIENCE <D>, 2000, 1910 : 685 - 690
  • [38] An Efficient Approach for Mining Weighted Sequential Patterns in Dynamic Databases
    Ishita, Sabrina Zaman
    Noor, Faria
    Ahmed, Chowdhury Farhan
    [J]. ADVANCES IN DATA MINING: APPLICATIONS AND THEORETICAL ASPECTS (ICDM 2018), 2018, 10933 : 215 - 229
  • [39] An Efficient Algorithm for Mining Frequent Patterns in Data Stream
    Zhang Guang-lu
    Lei Jing-sheng
    [J]. INTERNATIONAL CONFERENCE OF CHINA COMMUNICATION (ICCC2010), 2010, : 160 - +
  • [40] FSMTree: An efficient algorithm for mining frequent temporal patterns
    Kempe, Steffen
    Hipp, Jochen
    Kruse, Rudolf
    [J]. DATA ANALYSIS, MACHINE LEARNING AND APPLICATIONS, 2008, : 253 - +
12345