计算机科学 ›› 2015, Vol. 42 ›› Issue (1): 285-289.doi: 10.11896/j.issn.1002-137X.2015.01.063
黄宏涛,吴忠良,万庆生,黄少滨
HUANG Hong-tao, WU Zhong-liang, WAN Qing-sheng and HUANG Shao-bin
摘要: 使用相似度图计算FCA概念相似度需要构造相似关系的传递闭包,对于复杂问题会导致相似度图规模过大,从而影响相似度评价的效率。为了降低相似度图规模,提出一种基于限界传递相似度图的FCA概念相似度计算方法。该方法首先通过限定传递相似关系的长度来避免构造相似关系的传递闭包,得到的限界传递相似度图中忽略了长度超过界限且对区分FCA概念无用的传递相似关系,能够有效压缩相似度图的规模;然后给出了动态传递相似度计算方法和由限界传递相似度图构建二部图的方法。实验结果表明,使用限界传递相似度图能够在不损失计算结果准确度的情况下有效提高FCA概念相似度计算的效率。
[1] Wille R,Yahia S,Nguifo E,et al.Formal Concept Analysis as Applied Lattice Theory[M]∥Concept Lattices and Their Applications.Springer Berlin Heidelberg,2008,4923:42-67 [2] Ning L,Guanyu L,Li S.Using formal concept analysis for maritime ontology building[C]∥2010 International Forum on Information Technology and Applications (IFITA).2010,2:159-162 [3] Sánchez D,Batet M,Isern D,et al.Ontology-based semanticsimilarity:A new feature-based approach[J].Expert Systems with Applications,2012,39(9):7718-7728 [4] Li D,Du J,Yao S.Research on Computer Science Domain Onto-logy Construction and Information Retrieval[J].Knowledge Engineering and Management,2011,123:603-608 [5] Kang X,Li D,Wang S.Research on domain ontology in different granulations based on concept lattice[J].Knowledge-Based Systems,2012,27:152-161 [6] Maarek Y S,Berry D M,Kaiser G E.An information retrieval approach for automatically constructing software libraries[J].IEEE Transactions on Software Engineering,1991,17(8):800-813 [7] Kumar C A.Knowledge discovery in data using formal concept analysis and random projections[J].International Journal of Applied Mathematics and Computer Science,2011,21(4):745-756 [8] Formica A.Semantic web search based on rough sets and fuzzy formal concept analysis[J].Knowledge-Based Systems,2012,26:40-47 [9] Formica A,Missikoff M.Concept similarity in SymOntos:an enterprise ontology management tool[J].The Computer Journal,2002,45(6):583-594 [10] Formica A.Ontology-based concept similarity in formal concept analysis[J].Information Sciences,2006,176(18):2624-2641 [11] Biere A,Cimatti A,Clarke E M,et al.Bounded model checking[J].Advances in computers,2003,58:117-148 [12] Bayati M,Shah D,Sharma M.Maximum weight matching via max-product belief propagation[C]∥Proceedings of the 2005 IEEE International Symposium of Information Theory.2008,54:1763-1767 [13] Yellin D M.Speeding up dynamic transitive closure for bounded degree graphs[J].Acta Informatica,1993,30(4):369-384 [14] Sankowski P,Mucha M.Fast dynamic transitive closure lookahead[J].Algorithmica,2010,56(2):180-197 [15] 舒虎,崇志宏,倪巍伟,等.X-Hop:传递闭包的多跳数压缩存储和快速可达性查询[J].计算机科学,2012(3):144-148 |
No related articles found! |
|