关键词: 面向对象概念格, 属性粒度, 粒计算, Zoom-in算法, Zoom-out算法

Abstract: How to reduce the complexity in the construction of concept lattice is an important research topic in formal concept analysis. Granular computing can analyze and solve problems from multiple angles which has been an effective tool for solving problems in the field of artificial intelligence. Aiming at the rapid construction of multi-granularity concept lattice, based on the granular computing theory, this paper investigates the relation between the extent and intent of concept before and after the change of the attribute granularity and defines different types of concepts. Then, Zoom algorithms composed of Zoom-in algorithm and Zoom-out algorithm are proposed, which achieve the transformation among object-oriented concept lattices with different attribute granularity combinations. Based on the original concept lattice, Zoom algorithms implement the construction of the new concept lattice directly, which avoid the trivial steps of the traditional construction method of concept lattice, and improve the efficiency of the construction of concept lattice. Therefore, the optimal granularity combination of the concept lattice can be quickly determined, which ultimately helps data mining and knowledge discovery from the data.

Key words: object-oriented concept lattice, attribute granularity, granular computing, Zoom-in algorithm, Zoom-out algorithm