摘要
渐进式算法是概念格构造的重要方法之一,但以前的渐进式算法均为渐增式算法,即对象或属性都是增加的.实践表明,很多场合需要属性减少后的概念格.2013年,减少单个属性的渐减式算法已有研究,然而该算法只适用于单个属性,减少多个属性时,该算法需要反复执行多次.研究了减少多个属性的一次性渐减式算法,该算法与减少单个属性的渐减式算法有相同的时间复杂度,但当,减少多个属性时,单属性的渐减式算法需要反复执行多次,而该算法只需执行一次.
Incremental algorithms are important methods for the construction of concept lattices. But previous incremental algorithms are for the addition of objects or attributes. Concept lattices decrementing some attributes are needed in practical problems. Incremental algorithm decrementing single attribute were studied in 2013. But the algorithm only applies to decrement single attribute. When decrementing multi-attributes, the algorithm must be implemented again and again. This paper studies an incremental algorithm decrementing multi-attributes. This algorithm has as same time complexity as the algorithm decrementing single attribute. But when decrementing multi-attributes ,the algorithm decrementing single attribute must be implemented on many times, the presented algorithm only need to be implemented single execution.
出处
《软件学报》
EI
CSCD
北大核心
2015年第12期3162-3173,共12页
Journal of Software
基金
国家自然科学基金(61273019)~~
关键词
形式概念
概念格
减少属性
渐进式算法
概念格构造
formal concept
concept lattice
decrementing attribute
incremental algorithm
concept lattice construction
