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 条
  • [21] Mining Top-K Itemsets over a Sliding Window Based on Zipfian Distribution
    Wong, Raymond Chi-Wing
    Fu, Ada Wai-Chee
    PROCEEDINGS OF THE FIFTH SIAM INTERNATIONAL CONFERENCE ON DATA MINING, 2005, : 516 - 520
  • [22] Targeted mining of top-k high utility itemsets
    Huang, Shan
    Gan, Wensheng
    Miao, Jinbao
    Han, Xuming
    Fournier-Viger, Philippe
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2023, 126
  • [23] FPS-Tree Algorithm to Find Top-k Closed Itemsets in Data Streams
    Rehman, Zahoor Ur
    Shahbaz, Muhammad
    Shaheen, Muhammad
    Guergachi, Aziz
    ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2015, 40 (12) : 3507 - 3521
  • [24] Mining frequent closed itemsets from a landmark window over online data streams
    Liu, Xuejun
    Guan, Jihong
    Hu, Ping
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2009, 57 (06) : 927 - 936
  • [25] FPS-Tree Algorithm to Find Top-k Closed Itemsets in Data Streams
    Zahoor ur Rehman
    Muhammad Shahbaz
    Muhammad Shaheen
    Aziz Guergachi
    Arabian Journal for Science and Engineering, 2015, 40 : 3507 - 3521
  • [26] Upsortable: Programming Top-K Queries Over Data Streams
    Subercaze, Julien
    Gravier, Christophe
    Gillani, Syed
    Kammoun, Abderrahmen
    Laforest, Frederique
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2017, 10 (12): : 1873 - 1876
  • [27] Mining top-K frequent itemsets through progressive sampling
    Andrea Pietracaprina
    Matteo Riondato
    Eli Upfal
    Fabio Vandin
    Data Mining and Knowledge Discovery, 2010, 21 : 310 - 326
  • [28] Efficient algorithms of mining top-k frequent closed itemsets
    Lan Yongjie
    Qiu Yong
    ICEMI 2007: PROCEEDINGS OF 2007 8TH INTERNATIONAL CONFERENCE ON ELECTRONIC MEASUREMENT & INSTRUMENTS, VOL II, 2007, : 551 - 554
  • [29] Efficient Algorithms for Mining Top-K High Utility Itemsets
    Tseng, Vincent S.
    Wu, Cheng-Wei
    Fournier-Viger, Philippe
    Yu, Philip S.
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2016, 28 (01) : 54 - 67
  • [30] Mining top-K frequent itemsets through progressive sampling
    Pietracaprina, Andrea
    Riondato, Matteo
    Upfal, Eli
    Vandin, Fabio
    DATA MINING AND KNOWLEDGE DISCOVERY, 2010, 21 (02) : 310 - 326
12345