基于概念格的组规则产生集的算法研究

计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (29): 186-188.

基于概念格的组规则产生集的算法研究

李勃¹,刘启明¹,姚青²

1.鲁东大学计算机科学与技术学院,山东烟台 264025
2.山东大学计算机科学与技术学院,济南 250061

收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-10-11 发布日期:2007-10-11
通讯作者: 李勃

Research on algorithm of extracting minimal rule-generating sets based on concept lattice

LI Bo¹,LIU Qi-ming¹,YAO Qing²

1.School of Computer Science and Technology,Ludong University,Yantai,Shandong 264025,China
2.School of Computer Science and Technology,Shandong University,Jinan 250061,China

Received:1900-01-01 Revised:1900-01-01 Online:2007-10-11 Published:2007-10-11
Contact: LI Bo

摘要/Abstract

摘要： 数据挖掘中传统的关联规则生成算法产生的关联规则集合相当庞大,其中很多规则可由其它规则导出。使用闭项集可以减少规则的数目,而概念格节点间的泛化和例化关系非常适用于规则的提取。目前几种基于概念格的规则提取算法局限于得到准确支持度、信任度的无冗余规则。提出了一种在概念格上挖掘出能推导出所有满足最小支持度、信任度规则的规则产生集算法,文中称之为组规则产生集算法,减少了规则的规模。在此基础上进一步给出了组规则产生集的存储数据结构并用其导出一般规则产生集的算法。

关键词: 规则产生集, 概念格, 关联规则, 规则推导, 规则提取

Abstract: The rule sets extracted by traditional algorithm are usually very large,because a number of rules can be generated by other rules.The number of rules can be reduced using closed item sets.The relationship of generalization and specialization among concepts of concept lattice is very suitable for extracting rules.Now several kinds of algorithms for extracting rules based on concept lattice centered on getting non-redundant rules that have accurate support and confidence.The algorithm that extract rule-generating set based on concept lattice with which people can generate all frequent and confident rules can reduce number of rules and is more efficient.This paper introduces a kind of data structure that is used storing the rules and the algorithm that can lead to the general rule-generating set from rule-generating set.

Key words: rule-generating set, concept lattice, association rules, rule generating, rule extracting

李勃¹,刘启明¹,姚青². 基于概念格的组规则产生集的算法研究[J]. 计算机工程与应用, 2007, 43(29): 186-188.

LI Bo¹,LIU Qi-ming¹,YAO Qing². Research on algorithm of extracting minimal rule-generating sets based on concept lattice[J]. Computer Engineering and Applications, 2007, 43(29): 186-188.

[1]	张呈玲，李进金，林艺东. 基于OE-概念格的形式背景属性约简[J]. 计算机工程与应用, 2021, 57(15): 82-89.
[2]	张振海，张湘婷. 上下文感知的高铁信息服务推荐方法研究[J]. 计算机工程与应用, 2021, 57(12): 231-236.
[3]	杨葛英，沈夏炯，史先进，张磊. 以概念格为背景的关联规则可视化[J]. 计算机工程与应用, 2021, 57(1): 84-91.
[4]	纪文璐，王海龙，苏贵斌，柳林. 基于关联规则算法的推荐方法研究综述[J]. 计算机工程与应用, 2020, 56(22): 33-41.
[5]	顾军华，苏鸣，张亚娟，张丹红. 基于位编码链表的快速频繁模式挖掘算法研究[J]. 计算机工程与应用, 2020, 56(19): 86-93.
[6]	折延宏，胡梦婷，贺晓丽，曾望林. 两种多粒度形式概念分析模型的比较研究[J]. 计算机工程与应用, 2020, 56(10): 51-55.
[7]	刘莉萍1，章新友1，牛晓录2，郭永坤1，丁亮1. 基于Spark的并行关联规则挖掘算法研究综述[J]. 计算机工程与应用, 2019, 55(9): 1-9.
[8]	贺晓丽，刘华丽，刘瑶瑶. 多粒度数据的区间形式概念分析方法[J]. 计算机工程与应用, 2019, 55(19): 52-57.
[9]	郭鹏，蔡骋. 基于聚类和关联算法的学生成绩挖掘与分析[J]. 计算机工程与应用, 2019, 55(17): 169-179.
[10]	渠寒花1，惠建忠1，何险峰2，王慕华1，何晓凤1，丰德恩1. 气象服务形式概念分析模型研究[J]. 计算机工程与应用, 2018, 54(9): 257-264.
[11]	郭世伟，孟昱煜，陈绍立. 改进的PSOGM算法在动态关联规则挖掘中的应用[J]. 计算机工程与应用, 2018, 54(8): 160-165.
[12]	赵慧茹，林民. 融合关联规则的学术论文主题学习及表示方法[J]. 计算机工程与应用, 2018, 54(20): 159-165.
[13]	王建国，董泽宇，张文兴，卢丹. 基于回归树的支持向量机规则提取及应用[J]. 计算机工程与应用, 2017, 53(6): 236-240.
[14]	王晓丹，王建宇. 自动售药机配仓算法研究[J]. 计算机工程与应用, 2017, 53(4): 256-262.
[15]	沈夏炯1，2，叶曼曼2，甘甜2，韩道军1，2. 基于概念格的信息检索及其树形可视化[J]. 计算机工程与应用, 2017, 53(3): 95-99.