A novel algorithm for extracting frequent gradual patterns

被引:4
|
作者
Clementin, Tayou Djamegni [1 ,2 ]
Cabrel, Tabueu Fotso Laurent [2 ]
Belise, Kenmogne Edith [2 ]
机构
[1] Univ Dschang, Dept Comp Engn, UIT FV, Dschang, Cameroon
[2] Univ Dschang, Dept Math & Comp Sci, FS, Dschang, Cameroon
来源
MACHINE LEARNING WITH APPLICATIONS | 2021年 / 5卷
关键词
Pattern mining; Pruning; Search space; Gradual support; Lattice; Adjacency matrix;
D O I
10.1016/j.mlwa.2021.100068
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The extraction of frequent gradual pattern is an important problem in computer science and largely studied by the scientist's community of research in data mining. A frequent gradual pattern translates a recurrent covariation between the attributes of a database. Many applications issues from many domains, such as economy, health, education, market, bio-informatics, astronomy or web mining, are based on the extraction of frequent gradual patterns. Algorithms to extract frequent gradual patterns in the large databases are greedy in CPU time and memory space. This raises the problem of improving the performances of these algorithms. This paper presents a technique for improving the performance of frequent gradual pattern extraction algorithms. The exploitation of this technique leads to a new, more efficient algorithm called SGrite. The experiments carried out confirm the interest of the proposed technique.
引用
收藏
页数:14
相关论文
共 50 条
  • [31] A Search Space Reduced Algorithm for Mining Frequent Patterns
    Yen, Show-Jane
    Wang, Chiu-Kuang
    Ouyang, Liang-Yuh
    JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2012, 28 (01) : 177 - 191
  • [32] An Efficient Algorithm for Mining Frequent Patterns in Data Stream
    Zhang Guang-lu
    Lei Jing-sheng
    INTERNATIONAL CONFERENCE OF CHINA COMMUNICATION (ICCC2010), 2010, : 160 - +
  • [33] Parallelizing the Improved Algorithm for Frequent Patterns Mining Problem
    Thanh-Trung Nguyen
    Bach-Hien Nguyen
    Phi-Khu Nguyen
    INTELLIGENT INFORMATION AND DATABASE SYSTEMS (ACIIDS 2013), PT I,, 2013, 7802 : 156 - 165
  • [34] An algorithm for finding frequent patterns in a large sparse graph
    Zhou, Xiao Feng
    Gao, Lin
    Dong, An guo
    IMECS 2007: INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS, VOLS I AND II, 2007, : 290 - 294
  • [35] An integrated updating Algorithm for mining Maximal Frequent Patterns
    Yang Jun-rui
    Zhang Tie-jun
    Liu Nan-yan
    2008 CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-11, 2008, : 2396 - 2400
  • [36] CFGM: An algorithm for closed frequent graph patterns mining
    Peng, He
    Zhang, Defu
    INFORMATION SCIENCES, 2023, 625 : 327 - 341
  • [37] A new algorithm for mining frequent patterns in Can Tree
    Hoseini, Masome Sadat
    Shahraki, Mohammad Nadimi
    Neysiani, Behzad Soleimani
    2015 2ND INTERNATIONAL CONFERENCE ON KNOWLEDGE-BASED ENGINEERING AND INNOVATION (KBEI), 2015, : 843 - 846
  • [38] An Algorithm for Finding Frequent Patterns in Social Media Stream
    Ha, Suwook
    Lee, Yong Mi
    Nam, Kwang Woo
    Ryu, Kenn Ho
    2013 INTERNATIONAL CONFERENCE ON ICT CONVERGENCE (ICTC 2013): FUTURE CREATIVE CONVERGENCE TECHNOLOGIES FOR NEW ICT ECOSYSTEMS, 2013, : 618 - 623
  • [39] An effective ensemble pruning algorithm based on frequent patterns
    Zhou, Hongfang
    Zhao, Xuehan
    Wang, Xiao
    Zhou, H. (zhouhf@xaut.edu.cn), 1600, Elsevier B.V., Netherlands (56): : 79 - 85
  • [40] FSMTree: An efficient algorithm for mining frequent temporal patterns
    Kempe, Steffen
    Hipp, Jochen
    Kruse, Rudolf
    DATA ANALYSIS, MACHINE LEARNING AND APPLICATIONS, 2008, : 253 - +