Search (1 results, page 1 of 1)

0.013992311 = product of:
  0.027984623 = sum of:
    0.027984623 = product of:
      0.055969246 = sum of:
        0.055969246 = weight(_text_:2003 in 2077) [ClassicSimilarity], result of:
          0.055969246 = score(doc=2077,freq=2.0), product of:
            0.19453894 = queryWeight, product of:
              4.339969 = idf(docFreq=1566, maxDocs=44218)
              0.044824958 = queryNorm
            0.28770202 = fieldWeight in 2077, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.339969 = idf(docFreq=1566, maxDocs=44218)
              0.046875 = fieldNorm(doc=2077)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

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.