【作者】 曲立平； 刘大昕； 杨静； 张万松；

【Author】 Qu Liping,Liu Daxin,Yang Jing,and Zhang Wansong (College of Computer Science and Technology,Harbin Engineering University,Harbin 150001)

【机构】 哈尔滨工程大学计算机科学与技术学院；

【摘要】 概念格作为形式概念分析理论中的核心数据结构,在机器学习、数据挖掘和知识发现、信息检索等领域得到了广泛的应用,概念格的构造在其应用过程中是一个主要问题.提出了采用树结构对概念格节点进行组织,研究了基于属性的概念格渐进式构造算法.概念格节点的树结构组织可以约束更新格节点和产生子格节点的搜索范围,从而可以有效地减少算法的执行时间.在随机生成的数据集上进行的实验测试表明,本算法的时间性能更优越.更多还原

【Abstract】 Concept lattice,the core data structure in formal concept analysis,has been used widely in machine learning,data mining and knowledge discovery,information retrieval,etc.The main difficulty with concept lattice-based system comes from the lattice construction itself.In this paper,tree structure is employed to organize the set of concepts in concept lattice.Based on attribute,a fast incremental algorithm is developed.The organization of concepts in tree structure can reduce the search space of update nodes and generator nodes,and consequently improve the speed of the algorithm.The algorithm is experimentally evaluated and compared for random generated data.The results show that the algorithm performance is superior.更多还原