概念格的分布式集成算法研究

Research of Distributed Integration Algorithm on Concept Lattices

随着大数据时代的到来,海量数据的分布存储和分布计算变得越来越重要,其中概念格的分布式集成变得尤为紧迫。为了解决概念格的构格时间较长的问题,提出了面向概念格的分布式集成算法。概念格的集成是先对子概念格中的概念按内涵个数递减进行排序,再将排序后的子概念格集成为全局概念格。构造全局概念格选择两种集成方式:1)添加式集成方式,即主节点接收并集成来自所有子节点的子概念格;2)二路归并式集成方式,即各个子节点处的所有子概念格先集成,而后将所得的概念格提交给主节点接收并完成最终集成。实验表明,这两种概念格的分布式集成策略各有优缺点,但都能够减少概念格的构格时间。

With the advent of the era of big data,the distributed storage and computing of massive data are increasingly important, and the distributed integration of concept lattices is particularly urgent. In order to solve the problem of long constructing time of concept lattice. This paper put forward the concept lattices oriented distributed integration algo- rithm. Integration of concept lattice are defined as follows., concepts in sub-concept lattice are sorted according to the de- creases of intent number, and then the sub-concept lattices are integrated into a global concept lattice. Two types of inte- gration are selected to construct the global concept Lattice in this paper： one is the add lattice merge, the master node re- ceives and integrates sub-concept lattices that come from all child nodes-the other way is called two-way merge, firstly, its sub-concept lattices from all child nodes are integrated, and then the master node receives and integrates the sub-concept lattices. The experiments show that two kinds of distributed integration strategy of concept lattice have their ad- vantages and disadvantages, but both of them can effectively reduce the time of constructing concept lattice.