检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]上海理工大学管理学院,上海200093 [2]广西大学计算机与电子信息学院,南宁530004
出 处:《情报学报》2009年第2期169-174,共6页Journal of the China Society for Scientific and Technical Information
基 金:国家自然科学基金资助项目(60564001)。
摘 要:本文采用人工免疫算法进行关联规则挖掘,通过权值设置发现在事务数据集中有意义的二进制关系,将挖掘工作集中在那些有着特殊权值的有意义的关联项,避免了挖掘工作在大量的无意义的关系项中搜索。实验证明,此算法是有效的且灵活性强,能在Web使用数据集中发现有意义的带权值的关联规则。同时给出了在最小支持度和最小置信度不变的情况下,在动态数据集中进行增量关联规则挖掘的方法。同样使用权值方法来提升新数据集的重要性。此方法的可行性和有效性同样在实验中体现出来。We address the issues of discovering significant binary relationships in transaction datasets in a weighted setting. Traditional model of association rule mining is adapted to handle weighted association rule mining problems where each item is allowed to have a weight.The goal is to steer the mining focus to those significant relationships involving items with significant weights rather than being flooded in the combinatorial explosion of insignificant relationships.A new algorithm is developed based on artificial immune system and on the improved model for association rules mining.The algorithm is both scalable and efficient in discovering significant relationships in weighted settings as illustrated by experiments performed on web usage datasets.Meanwhile, we also propose a strategy for maintaining association rules in dynamic databases.We assume that the two thresholds,min support and min confidence,do not change.This method uses weighting technique to highlight new data.The experiments have shown that our approach is efficient and promising.
关 键 词:人工免疫系统 关联规则 WEB使用挖掘 增量式更新
分 类 号:TP311.13[自动化与计算机技术—计算机软件与理论] Q939.91[自动化与计算机技术—计算机科学与技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249