A FAST ALGORITHM TO BUILD DISTRIBUTED CONCEPT LATTICE BASED ON SYNCHRONOUSLY INCREASING OBJECT AND ATTRIBUTE

摘要

In the distributed database with large data,objects and attributes are in rapid growth with the increasing record.Existing algorithms for distributed concept lattice not only need to search plenty of irrelevant concepts and redundant records but also have to construct concept lattice again when dealing with a large scale data, which reduces the performance of algorithm.To address this problem, this paper presents a monadic operator RED β,which can reduce both objects and attributes at the same time, and a fast constructing algorithm for distributed concept lattice,which is said to be β-RCGA (Based on REDβ concept generation algorithm).