基于覆盖度函数的概念格约简  

Coverage Density Based Approach for Concept Lattice Reduction

作　　者：姜峰[1] 范玉顺[1] 

机构地区：[1]清华大学自动化系国家CIMS工程技术研究中心,北京100084

出　　处：《电子与信息学报》2010年第2期405-410,共6页Journal of Electronics & Information Technology

基　　金：国家863计划项目(2007AA04Z150);国家自然科学基金(60674080;60704027)资助课题

摘　　要：该文针对基于概念格的大规模数据和规则挖掘中,概念节点数呈指数爆炸的问题,提出了概念覆盖度函数和概念格度量模型,进行概念格约简,从而使生成的标示概念格具有线性空间复杂度。给出了概念格约简的直求法、同步法和提取法3种算法。时空复杂度分析和仿真试验表明,所提方法可以大幅约简概念格规模,从而显著提高建格和规则挖掘效率。标示概念还具有特殊含义,在Web服务关系挖掘中有很好的应用。To address the lattice size exponential explosion problem in large scale data and rule mining, concept coverage density function and measurement model are introduced to reduce redundant concepts. The pruned lattice, named marked-concept lattice, has linear space complexity and can be obtained through direct or synchronous construction or node-extraction. Analysis and simulation tests show that this reduction model not only significantly reduces normal concept lattice size, but also significantly improves lattice building and rule mining efficiency. Furthermore, marked concept carries crucial information and physical meanings, thus can make benefits for Web service relationship mining.

关 键 词：数据挖掘 形式概念分析 概念格 约简 Web关系挖掘 

分 类 号：TP391[自动化与计算机技术—计算机应用技术] TP274[自动化与计算机技术—计算机科学与技术]