TY - GEN
T1 - Knowledge element relation extraction using conditional random fields
AU - Chen, Yingying
AU - Zheng, Qinghua
AU - Wang, Wei
AU - Chen, Yan
PY - 2010
Y1 - 2010
N2 - Knowledge element relation extraction is to find predefined relations between pairs of knowledge elements from text documents. As a novel form for organization and management of knowledge resources, knowledge element relation can be utilized to establish knowledge navigation system, knowledge retrieval system and collaborative knowledge construction system. In this paper, we employ conditional random fields (CRFs) to extract relations between knowledge elements from natural language documents by treating the relation extraction task as a sequence labeling problem. We first introduce three rules to generate candidate relation instances, and then incorporate various features including terms, semantic type, distance and context information to represent candidate relation instances. Experimental evaluation shows that our method achieves better performance than previous work. It also indicates that CRFs outperform other probabilistic models i.e. hidden Markov model and maximum entropy, and show effective in knowledge element relation extraction.
AB - Knowledge element relation extraction is to find predefined relations between pairs of knowledge elements from text documents. As a novel form for organization and management of knowledge resources, knowledge element relation can be utilized to establish knowledge navigation system, knowledge retrieval system and collaborative knowledge construction system. In this paper, we employ conditional random fields (CRFs) to extract relations between knowledge elements from natural language documents by treating the relation extraction task as a sequence labeling problem. We first introduce three rules to generate candidate relation instances, and then incorporate various features including terms, semantic type, distance and context information to represent candidate relation instances. Experimental evaluation shows that our method achieves better performance than previous work. It also indicates that CRFs outperform other probabilistic models i.e. hidden Markov model and maximum entropy, and show effective in knowledge element relation extraction.
KW - Candidate relation instance construction
KW - Conditional random fields
KW - Knowledge element
KW - Knowledge element relation extraction
UR - https://www.scopus.com/pages/publications/79953791491
U2 - 10.1109/CSCWD.2010.5471967
DO - 10.1109/CSCWD.2010.5471967
M3 - 会议稿件
AN - SCOPUS:79953791491
SN - 9781424467631
T3 - Proceedings of the 2010 14th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2010
SP - 245
EP - 250
BT - Proceedings of the 2010 14th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2010
T2 - 2010 14th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2010
Y2 - 14 April 2010 through 16 April 2010
ER -