首页 | 官方网站   微博 | 高级检索  
     

加权概念格的渐进式构造及其关联规则提取
引用本文:张素兰,张继福,高愫邡.加权概念格的渐进式构造及其关联规则提取[J].计算机工程与应用,2005,41(7):173-175.
作者姓名:张素兰  张继福  高愫邡
作者单位:1. 太原重型机械学院计算机科学与技术分院,太原,030024
2. 太原重型机械学院计算机科学与技术分院,太原,030024;北京理工大学机电工程学院,北京,100081
摘    要:概念格的每个结点本质上是一个最大项目集,非常有利于关联规则的提取。然而目前对于概念格的研究,一般都假定由属性集所组成概念格的内涵同等重要,而在现实数据库中,组成内涵的属性重要性往往是不同的,因此,内涵并非同等重要。为了充分利用概念格实现关联规则提取,提出了一种新的概念格结构:加权概念格,并给出其渐进式构造算法及基于该格结构上的关联规则提取算法,同时给出算法分析以说明其可行性。

关 键 词:加权概念格  加权内涵  关联规则提取
文章编号:1002-8331-(2005)07-0173-03
修稿时间:2004年7月1日

The Construction of Weighted Concept Lattice and Association Rule Extraction
Zhang Sulan,Zhang Jifu,Gao Sufang.The Construction of Weighted Concept Lattice and Association Rule Extraction[J].Computer Engineering and Applications,2005,41(7):173-175.
Authors:Zhang Sulan  Zhang Jifu  Gao Sufang
Affiliation:Zhang Sulan1 Zhang Jifu1,2 Gao Sufang11
Abstract:The intension of each node of the concept lattice is virtually one largest item set,and it is benefit for the association rules extraction.However,the present research presumes that all the intensions of the concept lattice are equally important.In practice,the importance of the attributes consisting of the intension is often different,so the importance of the intension is not the same.In order to make the best use of the concept lattice for the association rules extraction,this paper puts forward one new concept lattice:weighted concept lattice.Moreover,it offers one association rule extraction algorithm and algorithm analysis that illustrates its practicability.
Keywords:WCL  weighted intension  association rules extraction  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号