首页> 外文会议>Fuzzy Systems and Knowledge Discovery,(FSKD), 2008 Fifth International Conference on >Mining Top-K Closed Frequent Traversal Sequences from Session Streams

【24h】

Mining Top-K Closed Frequent Traversal Sequences from Session Streams

机译：从会话流中挖掘Top-K封闭频繁遍历序列

获取原文

页面导航

著录项
相似文献
相关主题

著录项

来源
《Fuzzy Systems and Knowledge Discovery,(FSKD), 2008 Fifth International Conference on》||P.340-344|共5页
会议地点
作者
Zhang Xiaojian; Peng Huili; Shao Chao;
展开▼
作者单位

展开▼
会议组织
原文格式 PDF
正文语种
中图分类工业技术;
关键词

相似文献

外文文献
中文文献
专利

1. Mining top-k frequent closed itemsets over data streams using the sliding window model [J] . Pauray S.M. Tsai Expert systems with applications . 2010,第10期

机译：使用滑动窗口模型在数据流上挖掘前k个频繁关闭的项目集
2. Interactive mining of top-K frequent closed itemsets from data streams [J] . Hua-Fu Li Expert systems with applications . 2009,第7期

机译：从数据流中交互式挖掘前K个频繁关闭的项目集
3. An Efficient Closed Frequent Item Sets Mining Algorithm-For Mining Closed Frequent Item Sets from Data Streams [J] . Kuthadi Venu Madhav, Selvaraj Rajalakshmi Journal of computational and theoretical nanoscience . 2016,第10期

机译：有效的封闭频繁项目设置挖掘算法 - 用于挖掘数据流的闭合频繁项目集
4. Mining Top-K Closed Frequent Traversal Sequences from Session Streams [C] . International Conference on Fuzzy Systems and Knowledge Discovery . 2008

机译：挖掘Top-K封闭来自会话流的频繁遍历序列
5. Mining Frequent Itemsets from Uncertain Data: Extensions to Constrained Mining and Stream Mining. [D] . Hao, Boyu. 2010

机译：从不确定的数据中挖掘频繁项集：约束挖掘和流挖掘的扩展。
6. Hyper-structure mining of frequent patterns in uncertain data streams [O] . Chandima HewaNadungodage, Yuni Xia, Jaehwan John Lee, -1

机译：不确定数据流中频繁模式的超结构挖掘
7. The Top-k Frequent Closed Itemset Mining Using Top-k SAT Problem [O] . Said Jabbour, Lakhdar Sais, Yakoub Salhi 2015

机译：利用Top-k saT问题挖掘Top-k频繁闭项集

获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

客服微信
服务号