A Fast Algorithm for Generating Concepts

摘要：

The concept lattice,the core data structure in the formal concept analysis,has been used widely in machine learning,data mining etc.In the formal concept analysis, researching on constructing the concept lattice efficiently is one of the important contents.This paper presents a new algorithm called IETreeCS (Concept Sets based on Intension and Extension Tree)based on the IE-Tree(Intension and Extension Tree)and characteristic space partitions.The IETreeCS algorithm firstly defines an IE-Tree,and then it converts the formal context into the IE-Tree to reduce the storage of data sets.The paper also defines characteristic spaces and describes how to partition a characteristic space on the basis of the IE-Tree,and finally presents an integrated algorithm that generates all concepts efficiently from a binary relation.The experimental results show that the IETreeCS algorithm performs much better than the NextClosure and SSPCG algorithms in the large-scale sparse data sets or distributed data sets.

关键词： Formal concept analysis concept lattice concept characteristic space

作者: Yun Li Yunhao Yuan Xin Guo Yan Sheng Ling Chen

作者单位: Institute of Information Engineering Yangzhou University Jiangsu,225009,China

会议类型: 国际会议

会议名称: 2008 IEEE International Conference on Onformation and Automation(IEEE 信息与自动化国际会议)

会议地点: 张家界

会议语种:英文

页码: 1728-1733

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