| 数据流时间窗口中闭频繁项集的在线挖掘 |
| |
| 引用本文： | 姜苗,倪志伟,孟金华,周之强.数据流时间窗口中闭频繁项集的在线挖掘[J].中国科学技术大学学报,2011,41(8):739-745. |
| |
| 作者姓名： | 姜苗 倪志伟 孟金华 周之强 |
| |
| 作者单位： | 合肥工业大学管理学院,安徽合肥230009;过程优化与智能决策教育部重点实验室,安徽合肥230009 |
| |
| 基金项目： | 国家自然科学基金(70871033); 中国高技术研究发展(863)计划(2007AA04Z116)资助 |
| |
| 摘 要： | 在数据流闭频繁项集挖掘过程中,常忽略历史模式对挖掘结果的影响,并采用一种结构来标记闭频繁项集的类型,导致算法的效率不高.为此提出一种挖掘数据流时间窗口中闭频繁项集的方法NEWT-moment.该方法能在单遍扫描数据流事务的条件下完整地记录模式信息.同时,NEWT-moment提出的剪枝方法能很好地降低滑动窗口树F-tr...
|
| 关 键 词： | 数据流 时间窗体 闭频繁集 衰减模式 |
Online mining closed frequent itemsets in the time window over data streams |
| |
| JIANG Miao,NI Zhiwei,MENG Jinhua,Zhou Zhiqiang.Online mining closed frequent itemsets in the time window over data streams[J].Journal of University of Science and Technology of China,2011,41(8):739-745. |
| |
| Authors: | JIANG Miao NI Zhiwei MENG Jinhua Zhou Zhiqiang |
| |
| Institution: | JIANG Miao1,2,NI Zhiwei1,MENG Jinhua1,Zhou Zhiqiang1,2(1.School of Management,Hefei University of Technology,Hefei 230009,China,2.Key Laboratory of Process Optimization and Intelligent Decision-making,Ministry of Education,China) |
| |
| Abstract: | When mining closed frequent itemsets over data streams,the available algorithms are often made inefficient due to the fact that they often ignore mode decaying as time passes,and adopt a structure to mark the types of closed frequent itemsets.A method was proposed for mining the closed frequent patterns in the time window of data streams.The pattern of data streams could be completely recorded by scanning the streams only once.And the pruning method of NEWT-moment could reduce the space complexity of slidin... |
| |
| Keywords: | data stream time window closed frequent itemsets time decaying |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
