关联挖掘中的时效度研究-计算机应用.PDF

第25卷第1期 计算机应用 Vo1．25 No．1 2005年1月 Computer Applications Jan．2oo5 文章编号：1001—9081(2005)01—0028—03 关联挖掘中的时效度研究 王晓国，黄韶坤，朱 炜 (同济大学计算机科学与工程系，上海200092) (hsk@private．21 an．com) 摘 要：传统的关联挖掘算法，以支持度和置信度作为评价标准来衡量规则是否有价值。然而， 这种模式不能体现出数据的时效敏感特性，如Web数据和长期积累数据。文中将首次建立一个全新 的时基模型来重新估计数据规则的价值，并给出时效度(time．validity)作为新的规则价值衡量标准。 最后，给出了基于这个新的时基模型的一种新并行算法。这种算法使得我们在挖掘过程中使用增量 挖掘，而且使得用户可以通过互操作来优化挖掘过程。 关键词：数据挖掘；关联规则；时效度；并联算法 中图分类号：TP393 文献标识码：A Time—validity in mining association rules WANG Xiao—guo．HUANG Shao—kun．ZHU Wei (Department of Computer Science＆Engineering，ToR酥 Universit),Shanghai 200092 China) Abstract：Data mining，also known as knowledge discovery in database has been recognized as a new area for database ， research．This area can be defined as efficiently discovering interesting mles from large collections of data．As for association roles mining，traditionally speaking，support and confidence are the evaluation index to decide whether or not it is a strong association rule．Yet this ignores the prescription factor of time—sensitive data，such as Web data or long。date stored data ． In this paper a new time base model Was firstly built up to estimate the interest of the hales．A new interest—measure called time—validity for roles based on this new model Was presented．A new parallel algorithm for this new time base model fundamentally different from the known algorithms Was also presented．Those techniques allow for increasable mining and su