Incremental Algorithm for Building Relative Reduced Concept Lattice Based on Concept Tree

摘要：

The main difficulty with concept lattice-based system comes from the lattice construction itself. This paper provides relative reduced concept lattice, a simplified concept lattice. Based on attribute, an incremental algorithm is developed. Concept tree is employed to organize the set of concepts, which can reduce the search space of nodes. The experimental results for random generated data show that the algorithm performance is superior.

关键词： formal concept analysis relative reduced concept lattice incremental algorithm concept tree

作者: Liping Qu Guisheng Yin Jing Yang Xiaoyu Hou

作者单位: College of Computer Science and Technology Harbin Engineering University Haerbin, Heilongjiang Province, China

会议类型: 国际会议

会议名称: 2010 International Conference on Circuit and Signal Processing(2010年电路与信号处理国际会议 ICCSP 2010)

会议地点: 上海

会议语种:英文

页码: 233-236

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