• Journal of the Korean Society for Library and Information Science
• /
• v.45 no.2
• /
• pp.251-275
• /
• 2011

In this paper, we propose a novel kernel called a semantic parse tree kernel that extends the parse tree kernel previously studied to extract protein-protein interactions(PPIs) and shown prominent results. Among the drawbacks of the existing parse tree kernel is that it could degenerate the overall performance of PPI extraction because the kernel function may produce lower kernel values of two sentences than the actual analogy between them due to the simple comparison mechanisms handling only the superficial aspects of the constituting words. The new kernel can compute the lexical semantic similarity as well as the syntactic analogy between two parse trees of target sentences. In order to calculate the lexical semantic similarity, it incorporates context-based word sense disambiguation producing synsets in WordNet as its outputs, which, in turn, can be transformed into more general ones. In experiments, we introduced two new parameters: tree kernel decay factors, and degrees of abstracting lexical concepts which can accelerate the optimization of PPI extraction performance in addition to the conventional SVM's regularization factor. Through these multi-strategic experiments, we confirmed the pivotal role of the newly applied parameters. Additionally, the experimental results showed that semantic parse tree kernel is superior to the conventional kernels especially in the PPI classification tasks.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06b
• /
• pp.157-159
• /
• 2006

표절이란 원작자의 허락 없이 저작물의 일부분 혹은 전체를 사용하는 것이다. 이는 특히 대학의 프로그래밍 코스에서 심각한 문제가 된다. 이를 해결하기 위해 많은 표절 검출 시스템이 연구되어 왔으나 복사된 소스코드에 필요 없는 코드를 첨가할 경우, 성능이 낮아지는 문제가 있었다. 이 문제는 기존 시스템이 소스코드의 구조적인 정보를 효율적으로 다루지 않았기 때문이다. 본 논문에서는 Parse Tree Kernels를 이용한 소스 코드 표절 검출 시스템을 제안한다. 제안한 시스템은 Parse Tree Kernels를 이용하여 소스코드의 구조적 정보를 효과적으로 다룬다. 이를 보이기 위한 실험에서는 기존의 표절 검출 시스템인 SID, JPlag와 비교하여 제안한 시스템이 소스 코드의 구조적 정보를 기존 시스템에 비해 효율적으로 이용하고 있음을 보였다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.12
• /
• pp.988-992
• /
• 2009

In this paper, we attempted to extract binary relations between terminologies using composite kernels consisting of convolution parse tree kernels and WordNet verb synset vector kernels which explain the semantic relationships between two entities in a sentence. In order to evaluate the performance of our system, we used three domain specific test collections. The experimental results demonstrate the superiority of our system in all the targeted collection. Especially, the increase in the effectiveness on KREC 2008, 8% in F1, shows that the core contexts around the entities play an important role in boosting the entire performance of relation extraction.

• Journal of KIISE:Software and Applications
• /
• v.37 no.2
• /
• pp.85-94
• /
• 2010

This paper introduces a novel way to leverage convolution parse tree kernel to extract the interaction information between two proteins in a sentence without multiple features, clues and complicated kernels. Our approach needs only the parse tree alone of a candidate sentence including pairs of protein names which is potential to have interaction information. The main contribution of this paper is two folds. First, we show that for the PPI, it is imperative to execute parse tree pruning removing unnecessary context information in deciding whether the current sentence imposes interaction information between proteins by comparing with the latest existing approaches' performance. Secondly, this paper presents that tree kernel decay factor can play an pivotal role in improving the extraction performance with the identical learning conditions. Consequently, we could witness that it is not always the case that multiple kernels with multiple parsers perform better than each kernels alone for PPI extraction, which has been argued in the previous research by presenting our out-performed experimental results compared to the two existing methods by 19.8% and 14% respectively.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2007.11a
• /
• pp.415-421
• /
• 2007

This paper proposes a convolution tree kernel-based approach for relation extraction where the parse tree is expanded with entity features such as entity type, subtype, and mention level etc. Our study indicates that not only can our method effectively capture both syntactic structure and entity information of relation instances, but also can avoid the difficulty with tuning the parameters in composite kernels. We also demonstrate that predicate verb information can be used to further improve the performance, though its enhancement is limited. Evaluation on the ACE2004 benchmark corpus shows that our system slightly outperforms both the previous best-reported feature-based and kernel-based systems.

• Journal of KIISE:Software and Applications
• /
• v.36 no.8
• /
• pp.642-652
• /
• 2009

In order to improve the performance of the existing relation extraction approaches, we propose a method for combining two pivotal concepts which play an important role in classifying semantic relationships between entities in text. Having built a composite kernel-based relation extraction system, which incorporates both entity features and syntactic structured information of relation instances, we define nine classes of lexical features and synthetically apply them to the system. Evaluation on the ACE RDC corpus shows that our approach boosts the effectiveness of the existing composite kernels in relation extraction. It also confirms that by integrating the three important features (entity features, syntactic structures and contextual lexical features), we can improve the performance of a relation extraction process.