Hierarchical learning strategy in semantic relation extraction

作者:

Highlights:

摘要

This paper proposes a novel hierarchical learning strategy to deal with the data sparseness problem in semantic relation extraction by modeling the commonality among related classes. For each class in the hierarchy either manually predefined or automatically clustered, a discriminative function is determined in a top-down way. As the upper-level class normally has much more positive training examples than the lower-level class, the corresponding discriminative function can be determined more reliably and guide the discriminative function learning in the lower-level one more effectively, which otherwise might suffer from limited training data. In this paper, two classifier learning approaches, i.e. the simple perceptron algorithm and the state-of-the-art Support Vector Machines, are applied using the hierarchical learning strategy. Moreover, several kinds of class hierarchies either manually predefined or automatically clustered are explored and compared. Evaluation on the ACE RDC 2003 and 2004 corpora shows that the hierarchical learning strategy much improves the performance on least- and medium-frequent relations.

论文关键词:Semantic relation extraction,Data sparseness problem,Hierarchical learning strategy,Class hierarchy,Flat learning strategy

论文评审过程:Received 11 January 2007, Revised 6 June 2007, Accepted 16 July 2007, Available online 29 August 2007.

论文官网地址:https://doi.org/10.1016/j.ipm.2007.07.007