Multiple kernels learning-based biological entity relationship extraction method
Abstract Background Automatic extracting protein entity interaction information from biomedical literature can help to build protein relation network and design new drugs. There are more than 20 million literature abstracts included in MEDLINE, which is the most authoritative textual database in the...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
BMC
2017-09-01
|
Series: | Journal of Biomedical Semantics |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1186/s13326-017-0138-9 |
id |
doaj-6e6f9a31728443459fee375218db613e |
---|---|
record_format |
Article |
spelling |
doaj-6e6f9a31728443459fee375218db613e2020-11-24T22:17:54ZengBMCJournal of Biomedical Semantics2041-14802017-09-018S11810.1186/s13326-017-0138-9Multiple kernels learning-based biological entity relationship extraction methodXu Dongliang0Pan Jingchang1Wang Bailing2School of Mechanical, Electrical and Information Engineering, ShanDong UniversitySchool of Mechanical, Electrical and Information Engineering, ShanDong UniversitySchool of Computer Science and Technology, Harbin Institute of TechnologyAbstract Background Automatic extracting protein entity interaction information from biomedical literature can help to build protein relation network and design new drugs. There are more than 20 million literature abstracts included in MEDLINE, which is the most authoritative textual database in the field of biomedicine, and follow an exponential growth over time. This frantic expansion of the biomedical literature can often be difficult to absorb or manually analyze. Thus efficient and automated search engines are necessary to efficiently explore the biomedical literature using text mining techniques. Results The P, R, and F value of tag graph method in Aimed corpus are 50.82, 69.76, and 58.61%, respectively. The P, R, and F value of tag graph kernel method in other four evaluation corpuses are 2–5% higher than that of all-paths graph kernel. And The P, R and F value of feature kernel and tag graph kernel fuse methods is 53.43, 71.62 and 61.30%, respectively. The P, R and F value of feature kernel and tag graph kernel fuse methods is 55.47, 70.29 and 60.37%, respectively. It indicated that the performance of the two kinds of kernel fusion methods is better than that of simple kernel. Conclusion In comparison with the all-paths graph kernel method, the tag graph kernel method is superior in terms of overall performance. Experiments show that the performance of the multi-kernels method is better than that of the three separate single-kernel method and the dual-mutually fused kernel method used hereof in five corpus sets.http://link.springer.com/article/10.1186/s13326-017-0138-9Tag-graph kernelEntity relationship extractionMulti-kernels learing |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Xu Dongliang Pan Jingchang Wang Bailing |
spellingShingle |
Xu Dongliang Pan Jingchang Wang Bailing Multiple kernels learning-based biological entity relationship extraction method Journal of Biomedical Semantics Tag-graph kernel Entity relationship extraction Multi-kernels learing |
author_facet |
Xu Dongliang Pan Jingchang Wang Bailing |
author_sort |
Xu Dongliang |
title |
Multiple kernels learning-based biological entity relationship extraction method |
title_short |
Multiple kernels learning-based biological entity relationship extraction method |
title_full |
Multiple kernels learning-based biological entity relationship extraction method |
title_fullStr |
Multiple kernels learning-based biological entity relationship extraction method |
title_full_unstemmed |
Multiple kernels learning-based biological entity relationship extraction method |
title_sort |
multiple kernels learning-based biological entity relationship extraction method |
publisher |
BMC |
series |
Journal of Biomedical Semantics |
issn |
2041-1480 |
publishDate |
2017-09-01 |
description |
Abstract Background Automatic extracting protein entity interaction information from biomedical literature can help to build protein relation network and design new drugs. There are more than 20 million literature abstracts included in MEDLINE, which is the most authoritative textual database in the field of biomedicine, and follow an exponential growth over time. This frantic expansion of the biomedical literature can often be difficult to absorb or manually analyze. Thus efficient and automated search engines are necessary to efficiently explore the biomedical literature using text mining techniques. Results The P, R, and F value of tag graph method in Aimed corpus are 50.82, 69.76, and 58.61%, respectively. The P, R, and F value of tag graph kernel method in other four evaluation corpuses are 2–5% higher than that of all-paths graph kernel. And The P, R and F value of feature kernel and tag graph kernel fuse methods is 53.43, 71.62 and 61.30%, respectively. The P, R and F value of feature kernel and tag graph kernel fuse methods is 55.47, 70.29 and 60.37%, respectively. It indicated that the performance of the two kinds of kernel fusion methods is better than that of simple kernel. Conclusion In comparison with the all-paths graph kernel method, the tag graph kernel method is superior in terms of overall performance. Experiments show that the performance of the multi-kernels method is better than that of the three separate single-kernel method and the dual-mutually fused kernel method used hereof in five corpus sets. |
topic |
Tag-graph kernel Entity relationship extraction Multi-kernels learing |
url |
http://link.springer.com/article/10.1186/s13326-017-0138-9 |
work_keys_str_mv |
AT xudongliang multiplekernelslearningbasedbiologicalentityrelationshipextractionmethod AT panjingchang multiplekernelslearningbasedbiologicalentityrelationshipextractionmethod AT wangbailing multiplekernelslearningbasedbiologicalentityrelationshipextractionmethod |
_version_ |
1725783859157532672 |