Concept-Locating Method In Concept Lattice Construction And Its Application

As an important prerequisite for the application of formal concept analysis the construction of concept lattice has been a hot issue in the study. So far, there are two kinds of algorithms for concept lattices constructing, batch algorithms and incremental algorithms. In this paper, we define a concept- Locating Function. And Based on this tool, we introduce a new construction method of concept lattice and a new reduction method of concept lattice. In this dissertation, three emphases are placed on the development of the methods includingWith the help of concept-locating function, we can fast posit the concept, without judging all known concepts, thus greatly reducing update concept or insert concept. Considering the reduction problem, we directly define the unnecessary attributes (object) by the data of formal context, while avoiding discussion of the form of background reduction sets. By the searching operation of singly index-linked list, all nodes can be judge fast, thus, the range of searching for node, time cost of mining association rule, and the computing complexity ofthe algorithm are reduced.By comparing the two different methods, the steps are basically the same, we can find the method of consistency and portability.