Cbica: Correlation based incremental clustering algorithm, a new approach

Kaustubh Shinde, Preeti Mulay
{"title":"Cbica: Correlation based incremental clustering algorithm, a new approach","authors":"Kaustubh Shinde, Preeti Mulay","doi":"10.1109/I2CT.2017.8226138","DOIUrl":null,"url":null,"abstract":"With progress in the area of computer science, it is achievable to read, process, store and generate information out of the available data. Humongous amount of data is generated, which is of mixed type, including time-series, Boolean, spatial-temporal and alpha-numeric data. This data is generated at a very giant speed and volume, which makes difficult for the traditional clustering algorithms to create and maintain the desired clusters. Thus, the proposed system encourages incremental clustering using a non-probability based similarity measure. The experimental results, of Correlation Based Incremental Clustering Algorithm (CBICA), which are obtained using the Pearson's coefficient of correlation, are compared with the experimental results of the Closeness-Factor Based Algorithm (CFBA), which uses the probability based similarity measures. The threshold computation is done to decide the cluster members in the post clustering phase, to adapt influx of new data. Wherein the new data is accommodated in the available clusters or new clusters are formed, depending upon the threshold values.","PeriodicalId":343232,"journal":{"name":"2017 2nd International Conference for Convergence in Technology (I2CT)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 2nd International Conference for Convergence in Technology (I2CT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/I2CT.2017.8226138","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

Abstract

With progress in the area of computer science, it is achievable to read, process, store and generate information out of the available data. Humongous amount of data is generated, which is of mixed type, including time-series, Boolean, spatial-temporal and alpha-numeric data. This data is generated at a very giant speed and volume, which makes difficult for the traditional clustering algorithms to create and maintain the desired clusters. Thus, the proposed system encourages incremental clustering using a non-probability based similarity measure. The experimental results, of Correlation Based Incremental Clustering Algorithm (CBICA), which are obtained using the Pearson's coefficient of correlation, are compared with the experimental results of the Closeness-Factor Based Algorithm (CFBA), which uses the probability based similarity measures. The threshold computation is done to decide the cluster members in the post clustering phase, to adapt influx of new data. Wherein the new data is accommodated in the available clusters or new clusters are formed, depending upon the threshold values.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Cbica:基于相关性的增量聚类算法
随着计算机科学领域的进步,从可用数据中读取、处理、存储和生成信息是可以实现的。生成了大量混合类型的数据,包括时间序列数据、布尔数据、时空数据和数字数据。这些数据以非常大的速度和数量生成,这使得传统的聚类算法难以创建和维护所需的聚类。因此,提出的系统鼓励使用非概率相似性度量的增量聚类。将基于Pearson相关系数的基于相关性的增量聚类算法(CBICA)的实验结果与基于概率的相似度度量的基于接近度因子的算法(CFBA)的实验结果进行了比较。在聚类后阶段通过阈值计算来确定聚类成员,以适应新数据的涌入。其中,根据阈值将新数据容纳在可用簇中或形成新簇。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Face detection based ATM security system using embedded Linux platform Implementation of news app based on cordova cross-platform Design topology based comparative study on electric and photometric parameters of commercially available led lamp systems Design and formal analysis of electronic voting protocol using AVISPA Tele-operated trajectory tracking of differential drive wheeled mobile robot using haptic robot
×
引用
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