%0 Journal Article
%T Coverage Density Based Approach for Concept Lattice Reduction<br>基于覆盖度函数的概念格约简
%A Jiang Feng
%A Fan Yu-shun
%A <br>姜峰
%A 范玉顺
%J 电子与信息学报
%D 2010
%I 
%X 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.
%K Data mining
%K Formal Concept Analysis (FCA)
%K Concept lattice
%K Reduction
%K Web relationship mining<br>数据挖掘
%K 形式概念分析
%K 概念格
%K 约简
%K Web关系挖掘
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=1319827C0C74AAE8D654BEA21B7F54D3&jid=EFC0377B03BD8D0EF4BBB548AC5F739A&aid=AD6A9F11B06C358C6389BE77C247C478&yid=140ECF96957D60B2&vid=9971A5E270697F23&iid=0B39A22176CE99FB&sid=EB58C3052341AAA3&eid=FED44C0135DC1D9C&journal_id=1009-5896&journal_name=电子与信息学报&referenced_num=0&reference_num=23