使用变种k-means算法学习社交媒体网站的集体行为

Magare Minal, D. R. Patil
{"title":"使用变种k-means算法学习社交媒体网站的集体行为","authors":"Magare Minal, D. R. Patil","doi":"10.1109/PERVASIVE.2015.7087202","DOIUrl":null,"url":null,"abstract":"In this paper we have implemented a new k-means variant for clustering. Huge amount of data is generated on social media websites which challenges us to predict collective behavior. Collective behavior means to understand how the individual behaves in social networking environment. There is problem of prediction on sites as there are many numbers of actors. So because of this problem a new technique of edge centric clustering is carried out here which extracts sparse social dimensions. A k-means variant algorithm is then implemented for clustering which reduces the time required for clustering. The experimental results shows that variant of k-means has given better results than the other k-means algorithm. We could see this by the comparison shown of two k means algorithms.","PeriodicalId":442000,"journal":{"name":"2015 International Conference on Pervasive Computing (ICPC)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Learning collective behavior of social media sites using Variant of k-means algorithm\",\"authors\":\"Magare Minal, D. R. Patil\",\"doi\":\"10.1109/PERVASIVE.2015.7087202\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we have implemented a new k-means variant for clustering. Huge amount of data is generated on social media websites which challenges us to predict collective behavior. Collective behavior means to understand how the individual behaves in social networking environment. There is problem of prediction on sites as there are many numbers of actors. So because of this problem a new technique of edge centric clustering is carried out here which extracts sparse social dimensions. A k-means variant algorithm is then implemented for clustering which reduces the time required for clustering. The experimental results shows that variant of k-means has given better results than the other k-means algorithm. We could see this by the comparison shown of two k means algorithms.\",\"PeriodicalId\":442000,\"journal\":{\"name\":\"2015 International Conference on Pervasive Computing (ICPC)\",\"volume\":\"66 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-04-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 International Conference on Pervasive Computing (ICPC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PERVASIVE.2015.7087202\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Pervasive Computing (ICPC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PERVASIVE.2015.7087202","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在本文中,我们实现了一种新的k-means聚类变体。社交媒体网站上产生了大量的数据,这给我们预测集体行为带来了挑战。集体行为是指理解个体在社交网络环境中的行为。由于参与者数量众多,因此在网站上存在预测问题。针对这一问题,本文提出了一种提取稀疏社会维数的边缘中心聚类技术。然后实现k-means变算法用于聚类,减少了聚类所需的时间。实验结果表明,k-means的变体比其他k-means算法具有更好的效果。我们可以通过两种k均值算法的比较看出这一点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Learning collective behavior of social media sites using Variant of k-means algorithm
In this paper we have implemented a new k-means variant for clustering. Huge amount of data is generated on social media websites which challenges us to predict collective behavior. Collective behavior means to understand how the individual behaves in social networking environment. There is problem of prediction on sites as there are many numbers of actors. So because of this problem a new technique of edge centric clustering is carried out here which extracts sparse social dimensions. A k-means variant algorithm is then implemented for clustering which reduces the time required for clustering. The experimental results shows that variant of k-means has given better results than the other k-means algorithm. We could see this by the comparison shown of two k means algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信