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).

关键词： Data Mining Distributed Concept Lattice Formal Contezt Entropy

作者: Liying Zheng Mingzhao Zhang

作者单位: College of Electronic & Information Engineering,Lanzhou Jiaotong University Lanzhou 730070,P.R.China

会议类型: 国际会议

会议名称: 2009 International Symposium on Computer Science and Technology(2009 中国宁波国际计算机科学与技术学术大会)

会议地点: 宁波

会议语种:英文

页码: 449-452

在线出版日期: 2009-11-20（万方平台首次上网日期，不代表论文的发表时间）