多概念格的横向合并算法.pdfVIP

11 Vol. 32 No. 11 2004 11 ACTA ELECTRONICA SINICA Nov. 2004 1, 2 1 2 2 2 李 云 , 刘宗田, 陈 , 徐晓华 , 程 伟 ( 1 , 200072; 2, 225009) : , . , ; , . - , . , , . , . : ; ; ; ; : TP18 : A : ( 2004) Horizontal Union Algorithm of Multiple Concept Lattices 1, 2 1 2 2 2 LI Yun , LIU Zongti n , CHEN Ling , XU Xi ohu , CHENG Wei ( 1School of Computer Science, Shanghai University , Shanghai 200072, China; 2Institute of Inf ormation Engineering, Yangzhou University , Yangzhou, Jiangsu 225009, China) Abstract: Since the completeness of concept l ttice, the time complexity of building concept l ttice is f ctor restricting the pplic tion of form l concept n lysis. B sed on the horizont l nd vertic l combin tion in form l contexts, this p per defines the inde pendent or consistent contexts nd l ttices in ttribute field; nd lso defines the horizont l ddition oper tion between contexts or con cepts nd the horizont l union oper tion between concept l ttices. In ddition,we prove th t the concept l ttice of subcontexts horizon t lly combined is isomorphic to the horizont l union of subl ttices of these subcontexts. Using the inherent gener lspeci l rel tion be tween concepts in subl ttice, the horizont l union lgorithm of multiple concept l ttices to construct the concept l ttice is lso presen ted. Experiment l results show th t the time complexity of this lgorithm is much better th n th t of other construction