聚类概念漂移分类数据的多变量函数最优聚类质心辨识

K. Madhavi, A. Babu, A. A. Rao, S. Raju
{"title":"聚类概念漂移分类数据的多变量函数最优聚类质心辨识","authors":"K. Madhavi, A. Babu, A. A. Rao, S. Raju","doi":"10.1145/2345396.2345417","DOIUrl":null,"url":null,"abstract":"Identification of useful clusters in large datasets has attracted considerable interest in clustering process. Since data in the World Wide Web is increasing exponentially that affects on clustering accuracy and decision making, change in the concept between every cluster occurs named concept drift. This newly added time based data must be assigned/labeled into generated clusters at our hand. To say that the data labeling was performed well, the clusters must be efficient. Selecting initial cluster center (centroid) is the key factor that has high affection in generating effective clusters. The existing clustering methods selects centroid randomly. Different centroids results in different clusters. To avoid this random selection, we are proposing methods in selecting the centroid by analyzing the properties of data since the data with different properties exists in real world. Our previous work was concentrated in the identification centroid for the functions of single variable and two variable functions. This paper proposes methods in finding optimal cluster centroid for the multi-variable functions and then apply any existing clustering algorithm to generate clusters by using suitable distance measure.","PeriodicalId":290400,"journal":{"name":"International Conference on Advances in Computing, Communications and Informatics","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Identification of optimal cluster centroid of multi-variable functions for clustering concept-drift categorical data\",\"authors\":\"K. Madhavi, A. Babu, A. A. Rao, S. Raju\",\"doi\":\"10.1145/2345396.2345417\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Identification of useful clusters in large datasets has attracted considerable interest in clustering process. Since data in the World Wide Web is increasing exponentially that affects on clustering accuracy and decision making, change in the concept between every cluster occurs named concept drift. This newly added time based data must be assigned/labeled into generated clusters at our hand. To say that the data labeling was performed well, the clusters must be efficient. Selecting initial cluster center (centroid) is the key factor that has high affection in generating effective clusters. The existing clustering methods selects centroid randomly. Different centroids results in different clusters. To avoid this random selection, we are proposing methods in selecting the centroid by analyzing the properties of data since the data with different properties exists in real world. Our previous work was concentrated in the identification centroid for the functions of single variable and two variable functions. This paper proposes methods in finding optimal cluster centroid for the multi-variable functions and then apply any existing clustering algorithm to generate clusters by using suitable distance measure.\",\"PeriodicalId\":290400,\"journal\":{\"name\":\"International Conference on Advances in Computing, Communications and Informatics\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-08-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Advances in Computing, Communications and Informatics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2345396.2345417\",\"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 Conference on Advances in Computing, Communications and Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2345396.2345417","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在大数据集中识别有用的聚类已经引起了人们对聚类过程的极大兴趣。由于万维网上的数据呈指数级增长,影响了聚类的准确性和决策,每个聚类之间的概念变化发生了概念漂移。这些新添加的基于时间的数据必须分配/标记到生成的集群中。要说数据标记执行得很好,聚类必须是有效的。初始聚类中心(质心)的选择是影响有效聚类生成的关键因素。现有的聚类方法随机选取质心。不同的质心形成不同的簇。为了避免这种随机选择,由于现实世界中存在不同属性的数据,我们提出了通过分析数据属性来选择质心的方法。我们之前的工作主要集中在单变量函数和双变量函数的辨识质心。本文提出了对多变量函数寻找最优聚类质心的方法,然后利用现有的任何聚类算法通过适当的距离度量生成聚类。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Identification of optimal cluster centroid of multi-variable functions for clustering concept-drift categorical data
Identification of useful clusters in large datasets has attracted considerable interest in clustering process. Since data in the World Wide Web is increasing exponentially that affects on clustering accuracy and decision making, change in the concept between every cluster occurs named concept drift. This newly added time based data must be assigned/labeled into generated clusters at our hand. To say that the data labeling was performed well, the clusters must be efficient. Selecting initial cluster center (centroid) is the key factor that has high affection in generating effective clusters. The existing clustering methods selects centroid randomly. Different centroids results in different clusters. To avoid this random selection, we are proposing methods in selecting the centroid by analyzing the properties of data since the data with different properties exists in real world. Our previous work was concentrated in the identification centroid for the functions of single variable and two variable functions. This paper proposes methods in finding optimal cluster centroid for the multi-variable functions and then apply any existing clustering algorithm to generate clusters by using suitable distance measure.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信