Mining top-K significant itemsets in landmark windows over data streams

被引：0
|
作者：
Yang, Bei [1 ,2 ]
Huang, Houkuan [2 ]
机构：
[1] School of Information Engineering, Zhengzhou University, Zhengzhou 450001, China
[2] School of Computer and Information Technology, Beijing Jiaotong University, Beijing 100044, China
来源：
Jisuanji Yanjiu yu Fazhan/Computer Research and Development | 2010年 / 47卷 / 03期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：463 / 473
相关论文
共 50 条
  • [31] Efficient incremental mining of top-K frequent closed itemsets
    Pietracaprina, Andrea
    Vandin, Fabio
    DISCOVERY SCIENCE, PROCEEDINGS, 2007, 4755 : 275 - +
  • [32] Mining of top-k high utility itemsets with negative utility
    Sun, Rui
    Han, Meng
    Zhang, Chunyan
    Shen, Mingyao
    Du, Shiyu
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2021, 40 (03) : 5637 - 5652
  • [33] A Declarative Framework for Mining Top-k High Utility Itemsets
    Hidouri, Amel
    Jabbour, Said
    Raddaoui, Badran
    Chebbah, Mouna
    Ben Yaghlane, Boutheina
    BIG DATA ANALYTICS AND KNOWLEDGE DISCOVERY (DAWAK 2021), 2021, 12925 : 250 - 256
  • [34] Continuous Top-k Dominating Query of Incomplete Data over Data Streams
    Santoso, Bagus Jati
    Permadi, Vynska Amalia
    Ahmad, Tohari
    Ijtihadie, Royyana Muslim
    Sektiaji, Bayu
    PROCEEDINGS OF 2018 3RD INTERNATIONAL CONFERENCE ON SUSTAINABLE INFORMATION ENGINEERING AND TECHNOLOGY (SIET 2018), 2018, : 21 - 26
  • [35] Sliding Window Top-K Monitoring over Distributed Data Streams
    Lv, Zhijin
    Chen, Ben
    Yu, Xiaohui
    WEB AND BIG DATA, APWEB-WAIM 2017, PT I, 2017, 10366 : 527 - 540
  • [36] Sliding Window Top-K Monitoring over Distributed Data Streams
    Chen B.
    Lv Z.
    Yu X.
    Liu Y.
    Data Science and Engineering, 2017, 2 (4) : 289 - 300
  • [37] TKEH: an efficient algorithm for mining top-k high utility itemsets
    Singh, Kuldeep
    Singh, Shashank Sheshar
    Kumar, Ajay
    Biswas, Bhaskar
    APPLIED INTELLIGENCE, 2019, 49 (03) : 1078 - 1097
  • [38] TKEH: an efficient algorithm for mining top-k high utility itemsets
    Kuldeep Singh
    Shashank Sheshar Singh
    Ajay Kumar
    Bhaskar Biswas
    Applied Intelligence, 2019, 49 : 1078 - 1097
  • [39] Top-k/w publish/subscribe: A publish/subscribe model for continuous top-k processing over data streams
    Pripuzic, Kresimir
    Zarko, Ivana Podnar
    Aberer, Karl
    INFORMATION SYSTEMS, 2014, 39 : 256 - 276
  • [40] TFP: An efficient algorithm for mining top-K frequent closed itemsets
    Wang, JY
    Han, JW
    Lu, Y
    Tzvetkov, P
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2005, 17 (05) : 652 - 664
12345