摘要
随着数据挖掘的广泛应用,许多实际的数据挖掘应用需要用过去和当前数据对未来数据状态进行预测,针对这一现状,文中提出基于矩阵的数据流频繁模式预测算法(MFP).MFP算法可预测在下一时间窗口中可能性较大的频繁项集,以满足用户需要.该算法首先将数据转换为0-1矩阵;然后通过矩阵剪裁和位运算更新矩阵,并从中挖掘频繁项集;最后,利用当前窗口数据预测下一时间窗口中可能出现的频繁项集.实验结果表明,MFP算法在不同实验环境下能有效预测频繁项集,该算法是可行的.
With the wide application of data mining, many practical data mining applications need to use past and current data to predict the future state of the data. To solve this problem, we propose a new method （MFP） for predicting frequent patterns over data streams. MFP algorithm can predict those frequent itemsets that have high potential to become frequent in the subsequent time windows, to meet users＇ needs. Firstly, the algorithm converts the data to 0--1 matrix. Then it will update the matrix by tailoring it and bit operations, from which mine frequent itemsets as well. Finally, it will predict possible frequent itemsets that may appear in the next time window by using the current data. Experimental results show that MFP algorithm can predict the frequent itemsets in different experimental conditions, therefore, the algorithm is feasible.
出处
《微电子学与计算机》
CSCD
北大核心
2012年第10期60-63,68,共5页
Microelectronics & Computer
基金
国家自然科学基金项目(60603047)
教育部留学回国人员科研启动基金项目
辽宁省科技计划项目(2008216014)
辽宁省教育厅高等学校科研基金(L2010229)
大连市优秀青年科技人才基金(2008J23JH026)
关键词
频繁项集
数据流
数据挖掘
矩阵
预测
frequent itemset data stream
data mining
matrix
predict
