基于K近邻图的新闻文章摘要验证

T. Jo
{"title":"基于K近邻图的新闻文章摘要验证","authors":"T. Jo","doi":"10.1109/ICGHIT.2019.00022","DOIUrl":null,"url":null,"abstract":"This research proposes the text summarization tool based on a machine learning algorithm which is the modified KNN version which classifies a graph into summary or non-summary. The motivations of this research are the three facts: one fact is that a graph is a visualize representation of data items, another fact is that various similarity metrics among graphs are defined and the other is that the text summarization is able to be viewed into a classification task which a machine algorithm is applicable. The proposed system partitions a text into paragraphs, encode them into graphs in each of which vertices are words and edges are semantic relations between words, and applies the modified KNN version to the text summarization. The proposed approach is empirically validated as the better one, in summarizing news articles domain by domain. We need to consider the domain granularity and pre-classification of each full text into a domain for implementing the text summarization systems.","PeriodicalId":160708,"journal":{"name":"2019 International Conference on Green and Human Information Technology (ICGHIT)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Validation of Graph Based K Nearest Neighbor for Summarizing News Articles\",\"authors\":\"T. Jo\",\"doi\":\"10.1109/ICGHIT.2019.00022\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This research proposes the text summarization tool based on a machine learning algorithm which is the modified KNN version which classifies a graph into summary or non-summary. The motivations of this research are the three facts: one fact is that a graph is a visualize representation of data items, another fact is that various similarity metrics among graphs are defined and the other is that the text summarization is able to be viewed into a classification task which a machine algorithm is applicable. The proposed system partitions a text into paragraphs, encode them into graphs in each of which vertices are words and edges are semantic relations between words, and applies the modified KNN version to the text summarization. The proposed approach is empirically validated as the better one, in summarizing news articles domain by domain. We need to consider the domain granularity and pre-classification of each full text into a domain for implementing the text summarization systems.\",\"PeriodicalId\":160708,\"journal\":{\"name\":\"2019 International Conference on Green and Human Information Technology (ICGHIT)\",\"volume\":\"53 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 International Conference on Green and Human Information Technology (ICGHIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICGHIT.2019.00022\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on Green and Human Information Technology (ICGHIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICGHIT.2019.00022","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本研究提出了一种基于机器学习算法的文本摘要工具,这是一种改进的KNN版本,它将图分类为摘要或非摘要。本研究的动机有三个方面:一是图是数据项的可视化表示,二是图之间定义了各种相似度度量,三是文本摘要可以被看作是一个分类任务,并且可以应用机器算法。该系统将文本划分为多个段落,将段落编码为图,图中的顶点为单词,边为单词之间的语义关系,并将改进的KNN版本应用于文本摘要。在逐个领域总结新闻文章方面,本文提出的方法被经验验证为更好的方法。为了实现文本摘要系统,我们需要考虑每个全文的域粒度和预分类。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Validation of Graph Based K Nearest Neighbor for Summarizing News Articles
This research proposes the text summarization tool based on a machine learning algorithm which is the modified KNN version which classifies a graph into summary or non-summary. The motivations of this research are the three facts: one fact is that a graph is a visualize representation of data items, another fact is that various similarity metrics among graphs are defined and the other is that the text summarization is able to be viewed into a classification task which a machine algorithm is applicable. The proposed system partitions a text into paragraphs, encode them into graphs in each of which vertices are words and edges are semantic relations between words, and applies the modified KNN version to the text summarization. The proposed approach is empirically validated as the better one, in summarizing news articles domain by domain. We need to consider the domain granularity and pre-classification of each full text into a domain for implementing the text summarization systems.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Data Reduction with Real-Time Critical Data Forwarding for Internet-of-Things A Novel Self Organizing Feature Map for Uncertain Data Detecting Harmful Parameters of Produced Water and Drilling Waste from Smart Phone Through Things Speak App: Case Study from the Mediterranean Region A Mathematical Study on Weight Balancing in 2D Meshes and It's Application to Engineering Problems Specializing K Nearest Neighbor for Content Based Segmentation of News Article by Graph Similarity Metric
×
引用
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