Determining the Optimal Number of Clusters using Silhouette Score as a Data Mining Technique

Ylber Januzaj, E. Beqiri, A. Luma
{"title":"Determining the Optimal Number of Clusters using Silhouette Score as a Data Mining Technique","authors":"Ylber Januzaj, E. Beqiri, A. Luma","doi":"10.3991/ijoe.v19i04.37059","DOIUrl":null,"url":null,"abstract":"The identification of the same objects is very important in determining the similarity between different objects. Nowadays, there are several techniques that allow us to divide objects into different groups that differ from one to another. In order to have the best separation between the clusters, it is required that the optimal determination of the number of clusters of a corpus be made in advance. In our research, the Silhouette score technique was used in order to make the optimal determination of this number of clusters. The application of such a technique was done through the Python language, and a corpus of unstructured job vacancy data was used. After determining the optimal number, at the end we present these clusters and the similarity between them, this presentation will be done in the form of a graph in a suitable format.","PeriodicalId":247144,"journal":{"name":"Int. J. Online Biomed. Eng.","volume":"248 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Online Biomed. Eng.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3991/ijoe.v19i04.37059","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The identification of the same objects is very important in determining the similarity between different objects. Nowadays, there are several techniques that allow us to divide objects into different groups that differ from one to another. In order to have the best separation between the clusters, it is required that the optimal determination of the number of clusters of a corpus be made in advance. In our research, the Silhouette score technique was used in order to make the optimal determination of this number of clusters. The application of such a technique was done through the Python language, and a corpus of unstructured job vacancy data was used. After determining the optimal number, at the end we present these clusters and the similarity between them, this presentation will be done in the form of a graph in a suitable format.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
利用剪影分数作为数据挖掘技术确定最优聚类数量
同一物体的识别对于确定不同物体之间的相似性是非常重要的。如今,有几种技术可以让我们将物体分成不同的组,这些组彼此不同。为了实现最佳的聚类分离,需要提前确定语料库的最优聚类数。在我们的研究中,我们使用了剪影评分技术来确定最佳的聚类数量。这种技术的应用是通过Python语言完成的,并使用了非结构化职位空缺数据的语料库。在确定最佳数量之后,最后我们将这些聚类和它们之间的相似性呈现出来,这种呈现将以合适格式的图的形式完成。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Constructivist Computer-Based Instruction (CBI) Approach: A CBI Flipped Learning Integrated Problem Based and Case Method (PBL-cflip) in Clinical Refraction Course Automatically Avoiding Overfitting in Deep Neural Networks by Using Hyper-Parameters Optimization Methods Fiat lux et facta est lux: Leonardo Reveals the Secrets of the Heart and Arteries (in Health and Disease) Performance Analysis for 3D Reconstruction Objects in Meshroom and Agisoft - A Comparative Study Gray Level Co-Occurrence Matrices and Support Vector Machine for Improved Lung Cancer Detection
×
引用
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