中文摘要：

针对区间概念格的复杂结构以及基于现有建格算法构建的区间概念格存在概念冗余问题，本文直接从形式背景出发，对区间概念格进行动态压缩的方法，减少了区间概念结点的冗余度。为了保证概念压缩后仍能体现概念之间的关联关系，首先给出了基于形式背景的二元关系对的相似度及关系上的覆盖近邻空间的定义；其次，通过定义区间概念压缩算子，得到了压缩概念，并证明了压缩后的概念集是压缩前概念集的子集；基于覆盖的近邻空间及压缩算子，进一步构建了区间概念格的动态压缩模型。可以根据相似类阈值大小控制区间概念格中的结点数量，实现区间概念格的动态压缩，最后通过实例验证了模型的正确性以及压缩的高效性。

英文摘要：

The structure of interval concept lattice is complex and the lattice built by the existing construction algorithm has the problem of concept redundancy.To reduce the redundancy of interval concepts,a dynamic reduction method for interval concept lattice is put forward which starts from a formal context directly.Firstly,the similarity degree of the binary relations and covering-neighborhood-space are defined which could ensure that the compressed lattice still can reflect the relationship between concepts.Secondly,according to the reduction operators,the compressed concept is acquired.Thirdly,it is proved that the reduced interval concept set is a subset of the original.Then,it built the dynam-ic reduction model for interval concept lattice based on the covering-neighborhood-space and reduction operators.The number of concepts in lattice is controlled by the threshold value of similarity class which can realize the dynamic of reduction.Finally,the correctness of model and the high efficiency of reduction are shown by a case study.