检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李新[1,2]
机构地区:[1]汕头大学工学院计算机科学与技术系,汕头515063 [2]汕头大学智能制造技术教育部重点实验室,汕头515063
出 处:《计算机工程》2009年第8期56-58,共3页Computer Engineering
基 金:汕头大学青年科研基金资助项目(YR07004)
摘 要:在关联规则的数据挖掘中,良好的规则评价方法有利于去除价值不大的关联规则。分析基于概率运算的可信度和作用度这2种传统方法的局限性,指出其缺乏有力的逻辑基础。根据广义相关性理论,运用泛逻辑运算,提出新的关联规则抽取方法。分析和实验表明,该方法能有效提高关联规则的抽取质量。The evaluation of associated rules is an important question in the process of data mining. Good evaluating methods are favor of removing feigned and unvalued associated rules. Traditional evaluating methods are support and confidence which are both based on probabilistic computing. The limitations of those two methods are analyzed. It is indicated that lacking logic basis is the important question that the methods of support and confidence are both in face of. With the theory of general relativity, a new method of abstracting associating rules is presented, which is based on formulas of general logics. Experimental results show that the method can improve the quality of abstracting process effectively.
分 类 号:TP311[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.227.102.59