肺癌数据k-Means和k-Medoids聚类算法的效率

A. Dharmarajan, T. Velmurugan
{"title":"肺癌数据k-Means和k-Medoids聚类算法的效率","authors":"A. Dharmarajan, T. Velmurugan","doi":"10.20894/IJDMTA.102.005.002.011","DOIUrl":null,"url":null,"abstract":"The objective of this research work is focused on the right cluster creation of lung cancer data and analyzed the efficiency of k-Means and k-Medoids algorithms. This research work would help the developers to identify the characteristics and flow of algorithms. In this research work is pertinent for the department of oncology in cancer centers. This implementation helps the oncologist to make decision with lesser execution time of the algorithm.It is also enhances the medical care applications. This work is very suitable for selection of cluster development algorithm for lung cancer data analysis.Clustering is an important technique in data mining which is applied in many fields including medical diagnosis to find diseases. It is the process of grouping data, where grouping is recognized by discovering similarities between data based on their features. In this research work, the lung cancer data is used to find the performance of clustering algorithms via its computational time. Considering a limited number attributes of lung cancer data, the algorithmic steps are applied to get results and compare the performance of algorithms. The partition based clustering algorithms k-Means and k-Mediods are selected to analyze the lung cancer data.The efficiency of both the algorithms is analyzed based on the results produced by this approach. The finest outcome of the performance of the algorithm is reported for the chosen data concept.","PeriodicalId":414709,"journal":{"name":"International Journal of Data Mining Techniques and Applications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Efficiency of k-Means and k-Medoids Clustering Algorithms using Lung Cancer Dataset\",\"authors\":\"A. Dharmarajan, T. Velmurugan\",\"doi\":\"10.20894/IJDMTA.102.005.002.011\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The objective of this research work is focused on the right cluster creation of lung cancer data and analyzed the efficiency of k-Means and k-Medoids algorithms. This research work would help the developers to identify the characteristics and flow of algorithms. In this research work is pertinent for the department of oncology in cancer centers. This implementation helps the oncologist to make decision with lesser execution time of the algorithm.It is also enhances the medical care applications. This work is very suitable for selection of cluster development algorithm for lung cancer data analysis.Clustering is an important technique in data mining which is applied in many fields including medical diagnosis to find diseases. It is the process of grouping data, where grouping is recognized by discovering similarities between data based on their features. In this research work, the lung cancer data is used to find the performance of clustering algorithms via its computational time. Considering a limited number attributes of lung cancer data, the algorithmic steps are applied to get results and compare the performance of algorithms. The partition based clustering algorithms k-Means and k-Mediods are selected to analyze the lung cancer data.The efficiency of both the algorithms is analyzed based on the results produced by this approach. The finest outcome of the performance of the algorithm is reported for the chosen data concept.\",\"PeriodicalId\":414709,\"journal\":{\"name\":\"International Journal of Data Mining Techniques and Applications\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-12-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Data Mining Techniques and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.20894/IJDMTA.102.005.002.011\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Data Mining Techniques and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.20894/IJDMTA.102.005.002.011","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

本研究的目标是研究肺癌数据的正确聚类创建,并分析k-Means和k-Medoids算法的效率。这项研究工作将有助于开发人员识别算法的特征和流程。在这方面的研究工作与肿瘤中心的肿瘤科有关。这种实现有助于肿瘤学家在更短的算法执行时间内做出决策。它还增强了医疗保健的应用。这项工作非常适合于肺癌数据分析的聚类开发算法的选择。聚类是数据挖掘中的一项重要技术,应用于包括医学诊断在内的许多领域。它是对数据进行分组的过程,通过发现基于特征的数据之间的相似性来识别分组。在本研究中,使用肺癌数据,通过其计算时间来发现聚类算法的性能。考虑到肺癌数据的属性有限,应用算法步骤得到结果并比较算法的性能。选择基于分割的聚类算法k-Means和k-Mediods对肺癌数据进行分析。在此基础上对两种算法的效率进行了分析。对于所选的数据概念,报告了算法性能的最佳结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Efficiency of k-Means and k-Medoids Clustering Algorithms using Lung Cancer Dataset
The objective of this research work is focused on the right cluster creation of lung cancer data and analyzed the efficiency of k-Means and k-Medoids algorithms. This research work would help the developers to identify the characteristics and flow of algorithms. In this research work is pertinent for the department of oncology in cancer centers. This implementation helps the oncologist to make decision with lesser execution time of the algorithm.It is also enhances the medical care applications. This work is very suitable for selection of cluster development algorithm for lung cancer data analysis.Clustering is an important technique in data mining which is applied in many fields including medical diagnosis to find diseases. It is the process of grouping data, where grouping is recognized by discovering similarities between data based on their features. In this research work, the lung cancer data is used to find the performance of clustering algorithms via its computational time. Considering a limited number attributes of lung cancer data, the algorithmic steps are applied to get results and compare the performance of algorithms. The partition based clustering algorithms k-Means and k-Mediods are selected to analyze the lung cancer data.The efficiency of both the algorithms is analyzed based on the results produced by this approach. The finest outcome of the performance of the algorithm is reported for the chosen data concept.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信