A fast algorithm of concept generation

Abstract

Concept generation is an important prerequisite for the formal concept analysis. With the increment of the formal context, time complexity of the existing algorithms increase rapidly. This paper presents a fast algorithm of concept generation. The algorithm needs the formal context to satisfy certain conditions. It uses a continuous matrix. It first determines the state of each row of the continuous matrix then generates concepts with each row as an object every time. It had been proved that the time complexity of the algorithm is O(n). It is significantly higher than the efficiency of the existing algorithms. This approach utilizes continuous matrix and provides new idea in formal concept analysis.