Novel technique for prediction analysis using normalization for an improvement in K-means clustering

Shruti Gupta, Abha Thakral, Shilpi Sharma
{"title":"Novel technique for prediction analysis using normalization for an improvement in K-means clustering","authors":"Shruti Gupta, Abha Thakral, Shilpi Sharma","doi":"10.1109/INCITE.2016.7857584","DOIUrl":null,"url":null,"abstract":"Clustering is the unsupervised classification of spatterns in a dataset. Clustering is widely used to discover distributed patterns and classify them as clusters. Clustering algorithms uses a similarity measure based on distance. In order to cluster data points, k-means uses Euclidean distance measure and central point choice. In the K-means clustering, data points will be stacked and a central point is chosen. From the central point chosen, Euclidean distance will be computed and on that basis clusters will be assigned to the data points. One of the drawbacks of K-means is that numbers of clusters has to be provided due to which some data points remains un-clustered. In this paper, we propose a clustering calculation through which number of clusters can be characterised naturally. The proposed technique will improve accuracy and decrease clustering time moreover cluster quality will also be improved through multiple iterations.","PeriodicalId":59618,"journal":{"name":"下一代","volume":"30 1","pages":"32-36"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"下一代","FirstCategoryId":"1092","ListUrlMain":"https://doi.org/10.1109/INCITE.2016.7857584","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Clustering is the unsupervised classification of spatterns in a dataset. Clustering is widely used to discover distributed patterns and classify them as clusters. Clustering algorithms uses a similarity measure based on distance. In order to cluster data points, k-means uses Euclidean distance measure and central point choice. In the K-means clustering, data points will be stacked and a central point is chosen. From the central point chosen, Euclidean distance will be computed and on that basis clusters will be assigned to the data points. One of the drawbacks of K-means is that numbers of clusters has to be provided due to which some data points remains un-clustered. In this paper, we propose a clustering calculation through which number of clusters can be characterised naturally. The proposed technique will improve accuracy and decrease clustering time moreover cluster quality will also be improved through multiple iterations.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
利用归一化改进k均值聚类的预测分析新技术
聚类是对数据集中的模式进行无监督分类。聚类被广泛用于发现分布式模式并将其分类为簇。聚类算法使用基于距离的相似性度量。为了聚类数据点,k-means使用欧几里得距离度量和中心点选择。在K-means聚类中,数据点将被堆叠并选择一个中心点。从选择的中心点开始,计算欧几里得距离,并在此基础上为数据点分配聚类。K-means的缺点之一是必须提供集群的数量,因为有些数据点仍然是非集群的。在本文中,我们提出了一种聚类计算,通过它可以自然地表征聚类的数量。该方法不仅提高了聚类精度,减少了聚类时间,而且通过多次迭代可以提高聚类质量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
6212
期刊最新文献
Proceedings of the 4th International Workshop on Software Engineering Education for the Next Generation Parental Divorce and Children's Interpersonal Relationships: A Meta-Analysis How Young Adults Perceive Parental Divorce: The Role of Their Relationships with Their Fathers and Mothers Relationships Between Parents' Marital Status and University Students' Mental Health, Views of Mothers and Views of Fathers: A Study in Bulgaria Gender Schematization in Adolescents: Differences Based on Rearing in Single-Parent and Intact Families
×
引用
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