检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《科学技术与工程》2008年第14期3798-3802,共5页Science Technology and Engineering
基 金:基辽宁省自然科学基金(20072157)资助
摘 要:关联规则作为数据挖掘的核心任务现已经得到了广泛的研究。而由二元关系导出的概念格是一种非常有用的形式化工具,它体现了概念内涵和外延的统一,反映了对象和特征间的联系以及概念间的泛化与例。扩展概念格是对概念格的一种改进。提出了一种动态构造扩展概念格的方法,并在扩展概念格上实现了简洁的关联规则算法。Association rules, as the core task of data mining have been studied extensively. Concept lattice induced from binary relations is a very useful formal tool. It realizes the unification of concept intension and concept extension, reflects the association between objects and features, as well as the same surface and the different surface between objects. Expansion concept lattice is an improvement of concept lattice. A dynamic way of constructing expansion concept lattice is presented, and achieve a simple association rules algorithm based on expansion concept lattice.
分 类 号:TP311.13[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3