%A HUANG Hong-tao, WU Zhong-liang, WAN Qing-sheng and HUANG Shao-bin %T FCA Concept Similarity Computation Based on Bounded Transitive Similarity Graph %0 Journal Article %D 2015 %J Computer Science %R 10.11896/j.issn.1002-137X.2015.01.063 %P 285-289 %V 42 %N 1 %U {https://www.jsjkx.com/CN/abstract/article_3222.shtml} %8 2018-11-14 %X It is necessary to construct the transitive closure of similarity relation in the case of computing similarity between FCA concepts by means of similarity graph.This method will lead to large scale similarity graph for complex problem,which may affect the efficiency of similarity evaluation.A bounded transitive similarity graph based FCA concept similarity computing method was proposed in order to reduce the size of similarity graph.This method can avoid constructing the transitive closure of similarity relation by adding a bound on transitive similarity relation,and the bounded transitive similarity graph obtained does not contain the transitive relation whose length beyonds the bound,and this omitted transitive relation is useless to distinguish different FCA concepts,which makes it possible to compress the scale of similarity graph.Then a dynamic transitive similarity computation method and a bipartite graph construction method using bounded transitive similarity graph were given.Experimental results show that this bounded transitive similarity graph based method improves the efficiency of FCA concept computation effectively without the loss of accuracy.