Dynamic reduction theory for interval concept lattice based on covering and its realization
Zhang Chun-yin · Journal of Shandong University · 2014
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 dynamic 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.