The Parallel Model For Concept Lattice Constructing Based On Synonymous Concepts And Congener Concepts

Concept lattice, the main data structure in formal concept analysis theory, has been widely applied to many fields such as machine learning, knowledge discovery, information retrieval and software engineering. The lattice construction algorithm plays a very important role in the application of concept lattice. The completeness of concept lattice on the one hand insures the uniqueness of the final results which isn't influenced by the order of data or attributes and the construction algorithms, and on the other hand, it will make a large lattice even from a small set of original data. Theoretically speaking, the nodes number of the lattice will make an exponential increase for the growth of objects and attributes in the worst condition. According to the growth of original data, the constructing of a lattice will take more and more time as well as more and more space. For this reason, it seems impossible to find a much better time complexity construction algorithm. Thus, how to construct a lattice efficiently from a large context is still a focus of the research on FCA.With the maturing of parallel computing technology and the reducing cost of high-performance parrallel computer, more and more researchers tend to use parallel and distributed store techniques to build concept lattice. However, it is still a problem how to utilize this technology efficiently.Based on the known existence currently of construction alogrithms and models, we emphasizes the research work of parallel model for concept lattice union. By analyzing the parallel model and the union results of two extent-independence and intent-independence common universe concept lattices, we find that the performance of concept lattice union will be much better if two formal concept have the same extent or intent. Then we propose two important notions, synonymous concepts and congener concepts. Thus, we design and implement two lattice uion algorithms based on synonymous concepts and congener concepts, respectively. The two algorithms are considered as the foundation of the parallel model.According to analysis of the algorithm and results of the experiments, the model and the algorithms mentioned above are testified to be effective and suitable for distributed computing and storing. And also they have good flexibilities especially for the changeful contexts. In this model, the lattice union algorithm plays a key role which...