An efficient algorithm for approximate frequent intemset mining

被引：0
|
作者：
Uppal, Veepu [1 ]
机构：
[1] Departement of Computer Science and Engineering, Manav Rachna College of Engineering, Faridabad, India
来源：
International Journal of Database Theory and Application | 2015年 / 8卷 / 03期
关键词：
D O I：
10.14257/ijdta.2015.8.3.24
中图分类号：
学科分类号：
摘要：
5
引用
下载
收藏
页码：279 / 288
相关论文
共 50 条
  • [41] BOSTER: An Efficient Algorithm for Mining Frequent Unordered Induced Subtrees
    School of Electrical Engineering and Computer Science, Queensland University of Technology, Brisbane, Australia
    1600, Springer Verlag (8786):
  • [42] Efficient mining algorithm of frequent itemsets for uncertain data streams
    Wang Qianqian
    Liu Fang-ai
    PROCEEDINGS OF 2016 9TH INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND DESIGN (ISCID), VOL 2, 2016, : 443 - 446
  • [43] Memory efficient algorithm for mining recent frequent items in a stream
    Kolaczkowski, Piotr
    Rough Sets and Intelligent Systems Paradigms, Proceedings, 2007, 4585 : 485 - 494
  • [44] Efficient frequent sequence mining by a dynamic strategy switching algorithm
    Chiu, Ding-Ying
    Wu, Yi-Hung
    Chen, Arbee L. P.
    VLDB JOURNAL, 2009, 18 (01): : 303 - 327
  • [45] A GSP-based efficient algorithm for mining frequent sequences
    Zhang, MH
    Kao, B
    Yip, CL
    Cheung, D
    IC-AI'2001: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS I-III, 2001, : 497 - 503
  • [46] PROWL: An efficient frequent continuity mining algorithm on event sequences
    Huang, KY
    Chang, CH
    Lin, KZ
    DATA WAREHOUSING AND KNOWLEDGE DISCOVERY, PROCEEDINGS, 2004, 3181 : 351 - 360
  • [47] An Efficient and Fast Algorithm for Mining Frequent Patterns on Multiple Biosequences
    Liu, Wei
    Chen, Ling
    COMPUTER AND COMPUTING TECHNOLOGIES IN AGRICULTURE IV, PT 1, 2011, 344 : 178 - 194
  • [48] An Efficient Algorithm for Mining Embedded Frequent Subtree on Biological Data
    Liu, Wei
    Chen, Ling
    PROCEEDING OF THE 10TH INTERNATIONAL CONFERENCE ON INTELLIGENT TECHNOLOGIES, 2009, : 613 - 619
  • [49] Mop: An Efficient Algorithm for Mining Frequent Pattern with Subtree Traversing
    Deng, Zhi-Hong
    Gao, Ning
    Xu, Xiao-Ran
    FUNDAMENTA INFORMATICAE, 2011, 111 (04) : 373 - 390
  • [50] An efficient polynomial delay algorithm for pseudo frequent itemset mining
    Uno, Takeaki
    Arimura, Hiroki
    DISCOVERY SCIENCE, PROCEEDINGS, 2007, 4755 : 219 - +
12345