空间网络中基于轨迹的对象聚类

M. R. Reddy, K. Srinivasa, B. E. Reddy
{"title":"空间网络中基于轨迹的对象聚类","authors":"M. R. Reddy, K. Srinivasa, B. E. Reddy","doi":"10.1504/IJAC.2018.10013772","DOIUrl":null,"url":null,"abstract":"Clustering is a proficient approach to breaking down and locate the enormous, concealed, obscure and fascinating information in expansive scale dataset, which encourages the fast improvement of information mining innovation in late decades. With the advancement of area-based administration, moving article clustering turns into a blossoming subject in related fields as a key some portion of information mining innovation. It is a moderately new subfield of information mining which increased high notoriety. This paper considers the issue of proficiently keeping up a clustering of an active arrangement of information focuses that move persistently in 2D Euclidean space. This paper recommends an improved k-means (i-kmeans) algorithm which is done in four stages, which uses segmentation cluster as part of improved k-means. To describe the effectiveness of the obtained cluster we use Silhouette Coefficient metric. Experimental results reveal that improved i-kmeans technique gives better results in terms of accuracy and quality than the traditional one.","PeriodicalId":374882,"journal":{"name":"Int. J. Auton. Comput.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Clustering trajectory-based objects in spatio networks\",\"authors\":\"M. R. Reddy, K. Srinivasa, B. E. Reddy\",\"doi\":\"10.1504/IJAC.2018.10013772\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Clustering is a proficient approach to breaking down and locate the enormous, concealed, obscure and fascinating information in expansive scale dataset, which encourages the fast improvement of information mining innovation in late decades. With the advancement of area-based administration, moving article clustering turns into a blossoming subject in related fields as a key some portion of information mining innovation. It is a moderately new subfield of information mining which increased high notoriety. This paper considers the issue of proficiently keeping up a clustering of an active arrangement of information focuses that move persistently in 2D Euclidean space. This paper recommends an improved k-means (i-kmeans) algorithm which is done in four stages, which uses segmentation cluster as part of improved k-means. To describe the effectiveness of the obtained cluster we use Silhouette Coefficient metric. Experimental results reveal that improved i-kmeans technique gives better results in terms of accuracy and quality than the traditional one.\",\"PeriodicalId\":374882,\"journal\":{\"name\":\"Int. J. Auton. Comput.\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-06-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Auton. Comput.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/IJAC.2018.10013772\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Auton. Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJAC.2018.10013772","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

聚类是一种在大规模数据集中分解和定位海量、隐藏、模糊和吸引人的信息的有效方法,促进了近几十年来信息挖掘创新的快速发展。随着区域管理的推进,动态文章聚类作为信息挖掘创新的一个关键部分,成为相关领域的一个新兴课题。它是信息挖掘的一个相对较新的分支领域,增加了很高的知名度。本文考虑了如何熟练地保持在二维欧几里得空间中持续移动的主动信息焦点的聚类问题。本文提出了一种改进的k-means (i-kmeans)算法,该算法分四个阶段完成,该算法使用分割聚类作为改进k-means的一部分。为了描述得到的聚类的有效性,我们使用了轮廓系数度量。实验结果表明,改进的i-kmeans技术在精度和质量上都优于传统的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Clustering trajectory-based objects in spatio networks
Clustering is a proficient approach to breaking down and locate the enormous, concealed, obscure and fascinating information in expansive scale dataset, which encourages the fast improvement of information mining innovation in late decades. With the advancement of area-based administration, moving article clustering turns into a blossoming subject in related fields as a key some portion of information mining innovation. It is a moderately new subfield of information mining which increased high notoriety. This paper considers the issue of proficiently keeping up a clustering of an active arrangement of information focuses that move persistently in 2D Euclidean space. This paper recommends an improved k-means (i-kmeans) algorithm which is done in four stages, which uses segmentation cluster as part of improved k-means. To describe the effectiveness of the obtained cluster we use Silhouette Coefficient metric. Experimental results reveal that improved i-kmeans technique gives better results in terms of accuracy and quality than the traditional one.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信