Graph-based Word Clustering Considering the Distance and the Connectivity of a Co-occurrence

Supaporn Simcharoen, H. Unger
{"title":"Graph-based Word Clustering Considering the Distance and the Connectivity of a Co-occurrence","authors":"Supaporn Simcharoen, H. Unger","doi":"10.1109/RI2C56397.2022.9910302","DOIUrl":null,"url":null,"abstract":"Word clustering is a typical method of natural language processing. Several approaches for word clustering have been developed which consider different factors. The following article presents two factors, including the closest distance and the connectivity of a co-occurrence. The classical clustering algorithms, including k-means and Chinese Whispers, are chosen to compare their cluster quality. The results show that the quality of both proposed clustering algorithms of these two factors is close to k-means clustering.","PeriodicalId":403083,"journal":{"name":"2022 Research, Invention, and Innovation Congress: Innovative Electricals and Electronics (RI2C)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 Research, Invention, and Innovation Congress: Innovative Electricals and Electronics (RI2C)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RI2C56397.2022.9910302","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Word clustering is a typical method of natural language processing. Several approaches for word clustering have been developed which consider different factors. The following article presents two factors, including the closest distance and the connectivity of a co-occurrence. The classical clustering algorithms, including k-means and Chinese Whispers, are chosen to compare their cluster quality. The results show that the quality of both proposed clustering algorithms of these two factors is close to k-means clustering.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
考虑共现词距离和连通性的基于图的词聚类
聚类是一种典型的自然语言处理方法。考虑不同因素的词聚类方法有几种。下面的文章介绍了两个因素,包括最近距离和共现的连通性。选取k-means和Chinese Whispers这两种经典聚类算法,比较它们的聚类质量。结果表明,提出的两种因子聚类算法的聚类质量都接近k-means聚类。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Hyperparameter Tuning in Convolutional Neural Network for Face Touching Activity Recognition using Accelerometer Data RI2C 2022 Cover Page CNN based Automatic Detection of Defective Photovoltaic Modules using Aerial Imagery Metaverse for Developing Engineering Competency A Comparative Study of Deep Convolutional Neural Networks for Car Image Classification
×
引用
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