TY - GEN
T1 - Knowledge element analogy relation recognition using text and graph structure
AU - Wang, Wei
AU - Zheng, Qinghua
AU - Chen, Yingying
PY - 2009
Y1 - 2009
N2 - Knowledge element analogy relation is a corresponding relationship in content, function or other aspects between two knowledge elements. This paper proposes a framework of relation Gaussian processes-based learning for knowledge element analogy relation recognition, which can integrate information from text and relation graph structure. Based on terms or core terms co-occurrence and type compatibility, two rules are first developed to construct candidate analogy relation instances from knowledge element set. Next, three kernels are devised to capture information of terms, semantic types and relative positions of two knowledge elements, and graph Laplacian and expectation propagation algorithm are employed to approximate the relation graph structure. Then, these two types of information are integrated to predict analogy relation. Experimental evaluation on four data sets related to "computer" discipline demonstrates that the rules are effective and integrating three text kernels with relation graph structure can achieve better performance than only text kernels.
AB - Knowledge element analogy relation is a corresponding relationship in content, function or other aspects between two knowledge elements. This paper proposes a framework of relation Gaussian processes-based learning for knowledge element analogy relation recognition, which can integrate information from text and relation graph structure. Based on terms or core terms co-occurrence and type compatibility, two rules are first developed to construct candidate analogy relation instances from knowledge element set. Next, three kernels are devised to capture information of terms, semantic types and relative positions of two knowledge elements, and graph Laplacian and expectation propagation algorithm are employed to approximate the relation graph structure. Then, these two types of information are integrated to predict analogy relation. Experimental evaluation on four data sets related to "computer" discipline demonstrates that the rules are effective and integrating three text kernels with relation graph structure can achieve better performance than only text kernels.
KW - Candidate analogy relation instances construction
KW - Graph structure
KW - Kernel
KW - Knowledge element
KW - Knowledge element analogy relation recognition
UR - https://www.scopus.com/pages/publications/72249102351
U2 - 10.1109/NLPKE.2009.5313788
DO - 10.1109/NLPKE.2009.5313788
M3 - 会议稿件
AN - SCOPUS:72249102351
SN - 9781424445387
T3 - 2009 International Conference on Natural Language Processing and Knowledge Engineering, NLP-KE 2009
BT - 2009 International Conference on Natural Language Processing and Knowledge Engineering, NLP-KE 2009
T2 - 2009 International Conference on Natural Language Processing and Knowledge Engineering, NLP-KE 2009
Y2 - 24 September 2009 through 27 September 2009
ER -