K nearest neighbor for text summarization using feature similarity

T. Jo
{"title":"K nearest neighbor for text summarization using feature similarity","authors":"T. Jo","doi":"10.1109/ICCCCEE.2017.7866705","DOIUrl":null,"url":null,"abstract":"In this research, we propose a particular version of KNN (K Nearest Neighbor) where the similarity between feature vectors is computed considering the similarity among attributes or features as well as one among values. The task of text summarization is viewed into the binary classification task where each paragraph or sentence is classified into the essence or non-essence, and in previous works, improved results are obtained by the proposed version in the text classification and clustering. In this research, we define the similarity which considers both attributes and attribute values, modify the KNN into the version based on the similarity, and use the modified version as the approach to the text summarization task. As the benefits from this research, we may expect the more compact representation of data items and the better performance. Therefore, the goal of this research is to implement the text summarization algorithm which represents data items more compactly and provides the more reliability.","PeriodicalId":227798,"journal":{"name":"2017 International Conference on Communication, Control, Computing and Electronics Engineering (ICCCCEE)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Communication, Control, Computing and Electronics Engineering (ICCCCEE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCCEE.2017.7866705","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

Abstract

In this research, we propose a particular version of KNN (K Nearest Neighbor) where the similarity between feature vectors is computed considering the similarity among attributes or features as well as one among values. The task of text summarization is viewed into the binary classification task where each paragraph or sentence is classified into the essence or non-essence, and in previous works, improved results are obtained by the proposed version in the text classification and clustering. In this research, we define the similarity which considers both attributes and attribute values, modify the KNN into the version based on the similarity, and use the modified version as the approach to the text summarization task. As the benefits from this research, we may expect the more compact representation of data items and the better performance. Therefore, the goal of this research is to implement the text summarization algorithm which represents data items more compactly and provides the more reliability.
使用特征相似度进行文本摘要的K近邻
在这项研究中,我们提出了一个特定版本的KNN (K最近邻),其中特征向量之间的相似性是考虑属性或特征之间的相似性以及值之间的相似性来计算的。将文本摘要任务看作是将每个段落或句子划分为本质或非本质的二元分类任务,在以往的工作中,本文提出的版本在文本分类和聚类方面取得了改进的结果。在本研究中,我们定义了同时考虑属性和属性值的相似度,将KNN修改为基于相似度的版本,并将修改后的版本作为文本摘要任务的方法。由于这项研究的好处,我们可以期望更紧凑的数据项表示和更好的性能。因此,本研究的目标是实现更紧凑地表示数据项并提供更高可靠性的文本摘要算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信