Finding similarity in articles using various clustering techniques

Deeksha, Shashank Sahu
{"title":"Finding similarity in articles using various clustering techniques","authors":"Deeksha, Shashank Sahu","doi":"10.1109/ICRITO.2017.8342449","DOIUrl":null,"url":null,"abstract":"Clustering is a vital method within which bunching of articles occurred in the groups in such how that articles of a similar group contain a lot of similarity than the articles into other groups. This paper discussed numerous clustering techniques for finding similarity in articles. These clustering techniques are Hierarchical, K-means, and K-medoids clustering. In this paper, the research focus is to compare several distance measures and find out appropriate distance measure that is used to check the similarity in articles. Distance measure performs a crucial role in the performance of these algorithms. We use different distance measure methods of Hierarchical, K-means, and K-medoids clustering. Here, an experimental examines are performed in Matlab and results show that in Hierarchical clustering Euclidean distance measure, in K-means clustering Correlation distance measure, and in K-medoids clustering City block distance measure provides better results.","PeriodicalId":357118,"journal":{"name":"2017 6th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 6th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICRITO.2017.8342449","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Clustering is a vital method within which bunching of articles occurred in the groups in such how that articles of a similar group contain a lot of similarity than the articles into other groups. This paper discussed numerous clustering techniques for finding similarity in articles. These clustering techniques are Hierarchical, K-means, and K-medoids clustering. In this paper, the research focus is to compare several distance measures and find out appropriate distance measure that is used to check the similarity in articles. Distance measure performs a crucial role in the performance of these algorithms. We use different distance measure methods of Hierarchical, K-means, and K-medoids clustering. Here, an experimental examines are performed in Matlab and results show that in Hierarchical clustering Euclidean distance measure, in K-means clustering Correlation distance measure, and in K-medoids clustering City block distance measure provides better results.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
使用各种聚类技术查找文章的相似性
聚类是一种重要的方法,其中聚类的文章发生在组中,使相似组的文章比其他组的文章包含很多相似之处。本文讨论了用于寻找文章相似性的多种聚类技术。这些聚类技术是分层聚类、K-means聚类和k - medioids聚类。本文的研究重点是比较几种距离度量,找出合适的距离度量来检验文章的相似度。距离度量在这些算法的性能中起着至关重要的作用。我们使用了分层聚类、K-means聚类和k - mediids聚类的不同距离度量方法。本文在Matlab中进行了实验检验,结果表明在分层聚类中欧几里得距离度量,在K-means聚类中相关距离度量,在K-medoids聚类中城市街区距离度量具有较好的效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Fractal antenna for wireless applications Analysis of various techniques of feature extraction on skin lesion images Modeling and simulation of CEERI's water distribution network to detect leakage using HLR approach Design and analysis of symmetrical notch S shape patch antenna for wideband applications Experiences in the business process modelling at public organizations of La Pampa
×
引用
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