共 50 条
- [42] Mining frequent patterns in an arbitrary sliding window over data streams [J]. DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, 2008, 4947 : 496 - 503
- [43] Bloom Filter Based Frequent Patterns Mining over Data Streams [J]. INTERNATIONAL CONFERENCE ON GRAPHIC AND IMAGE PROCESSING (ICGIP 2012), 2013, 8768
- [44] Efficient algorithm for mining approximate frequent item over data streams [J]. Ruan Jian Xue Bao/Journal of Software, 2007, 18 (04): : 884 - 892
- [45] An Efficient Frequent Closed Itemsets Mining Algorithm Over Data Streams [J]. 2011 SECOND INTERNATIONAL CONFERENCE ON INFORMATION, COMMUNICATION AND EDUCATION APPLICATION (ICEA 2011), 2011, : 197 - 201
- [46] Efficient approximate mining of frequent patterns over transactional data streams [J]. DATA WAREHOUSING AND KNOWLEDGE DISCOVERY, PROCEEDINGS, 2008, 5182 : 241 - 250
- [47] An Efficient Approach for Mining Frequent Patterns over Uncertain Data Streams [J]. 2016 IEEE 28TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2016), 2016, : 980 - 984
- [48] Efficient algorithm for frequent pattern mining over uncertain data streams [J]. Journal of Computational Information Systems, 2015, 11 (21): : 7799 - 7808
- [49] An Efficient Frequent Closed Itemsets Mining Algorithm Over Data Streams [J]. 2009 INTERNATIONAL CONFERENCE ON INFORMATION MANAGEMENT, INNOVATION MANAGEMENT AND INDUSTRIAL ENGINEERING, VOL 3, PROCEEDINGS, 2009, : 65 - +
- [50] Approximate mining of global closed frequent itemsets over data streams [J]. JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 2011, 348 (06): : 1052 - 1081