基于文本挖掘和模式聚类的乳腺癌及其相关基因关系提取

Koya Kawashima, Wenjun Bai, Changqin Quan
{"title":"基于文本挖掘和模式聚类的乳腺癌及其相关基因关系提取","authors":"Koya Kawashima, Wenjun Bai, Changqin Quan","doi":"10.1109/SNPD.2017.8022701","DOIUrl":null,"url":null,"abstract":"With the number increase of biomedical literatures, biomedical relation extraction discovery from the literature represents a new challenge for researchers in recent years. Then, a system that automatically extracts the related genes to the targeted disease is required. In this paper, we explore text mining and pattern clustering for relation extraction of breast cancer and related genes. It can be considered an unsupervised method and labeled data is not necessary. We firstly extract the candidate genes related to breast cancer by checking the window distance between the appearance of genes and breast cancer in a sentence. Then, two different clustering approaches (simple clustering and K-means clustering) are applied for finding the candidate association words that indicate the relationship between breast cancer and genes. The comparison experiment demonstrates that simple clustering is superior to K-means clustering in this task.","PeriodicalId":186094,"journal":{"name":"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Text mining and pattern clustering for relation extraction of breast cancer and related genes\",\"authors\":\"Koya Kawashima, Wenjun Bai, Changqin Quan\",\"doi\":\"10.1109/SNPD.2017.8022701\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the number increase of biomedical literatures, biomedical relation extraction discovery from the literature represents a new challenge for researchers in recent years. Then, a system that automatically extracts the related genes to the targeted disease is required. In this paper, we explore text mining and pattern clustering for relation extraction of breast cancer and related genes. It can be considered an unsupervised method and labeled data is not necessary. We firstly extract the candidate genes related to breast cancer by checking the window distance between the appearance of genes and breast cancer in a sentence. Then, two different clustering approaches (simple clustering and K-means clustering) are applied for finding the candidate association words that indicate the relationship between breast cancer and genes. The comparison experiment demonstrates that simple clustering is superior to K-means clustering in this task.\",\"PeriodicalId\":186094,\"journal\":{\"name\":\"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)\",\"volume\":\"69 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-06-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SNPD.2017.8022701\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SNPD.2017.8022701","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

随着生物医学文献数量的增加,从文献中发现生物医学关系是近年来研究人员面临的一个新的挑战。然后,需要一个自动提取目标疾病相关基因的系统。在本文中,我们探索了文本挖掘和模式聚类用于乳腺癌及其相关基因的关系提取。它可以被认为是一种无监督的方法,标记数据是不必要的。我们首先通过检查句子中基因出现与乳腺癌之间的窗口距离来提取与乳腺癌相关的候选基因。然后,采用两种不同的聚类方法(简单聚类和K-means聚类)来寻找表明乳腺癌与基因之间关系的候选关联词。对比实验表明,简单聚类优于K-means聚类。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Text mining and pattern clustering for relation extraction of breast cancer and related genes
With the number increase of biomedical literatures, biomedical relation extraction discovery from the literature represents a new challenge for researchers in recent years. Then, a system that automatically extracts the related genes to the targeted disease is required. In this paper, we explore text mining and pattern clustering for relation extraction of breast cancer and related genes. It can be considered an unsupervised method and labeled data is not necessary. We firstly extract the candidate genes related to breast cancer by checking the window distance between the appearance of genes and breast cancer in a sentence. Then, two different clustering approaches (simple clustering and K-means clustering) are applied for finding the candidate association words that indicate the relationship between breast cancer and genes. The comparison experiment demonstrates that simple clustering is superior to K-means clustering in this task.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Performance analysis of localization strategy for island model genetic algorithm Relationship between the five factor model personality and learning effectiveness of teams in three information systems education courses Evaluating the work of experienced and inexperienced developers considering work difficulty in sotware development Intrusion detection using clustering of network traffic flows Intelligent integrated coking flue gas indices prediction
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1