基于自我聚类的社交网络时间序列传播预测

Fei Teng, Rong Tang, Tianrui Li
{"title":"基于自我聚类的社交网络时间序列传播预测","authors":"Fei Teng, Rong Tang, Tianrui Li","doi":"10.1109/ISKE.2017.8258811","DOIUrl":null,"url":null,"abstract":"Online social networks are now recognized as an important platform for propagating information. Recently, a lot of efforts are made to predict the popularity of social information, to help the government and companies effectively control and guide public opinions. Information propagation in social networks exist many different temporal patterns, which are useful reference for predicting the future spreading of news. Considering temporal patterns are related to the network structure and information content, some researchers formulated a time series clustering problem to obtain tem­poral patterns in social networks. Previous clustering based algorithms take each cluster center as a typical propagation pattern, and then classify prediction object into its nearest-neighbor cluster. However, the nearest pattern can not fit the prediction object very precisely. This paper proposes a novel E-CTPM (Ego-Clustering based Temporal Prediction Model). E-CTPM utilizes the prediction object itself as a fixed cluster center, which can attract the most similar time series into one cluster and generate an ego-pattern for the prediction object. The tailored pattern fits the prediction object well, so it is suitable to indicate the future propagation. Experiments are carried on twitter and phrase datasets, with the results that E-CTPM outperforms the existing algorithms by achieving lower prediction bias and prediction variance. Meanwhile, E-CTPM has general applicability, which is able to work with multiple clustering methods and avoids the prediction difference resulting from classification methods.","PeriodicalId":208009,"journal":{"name":"2017 12th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Ego-clustering based propagation prediction of time series in social networks\",\"authors\":\"Fei Teng, Rong Tang, Tianrui Li\",\"doi\":\"10.1109/ISKE.2017.8258811\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Online social networks are now recognized as an important platform for propagating information. Recently, a lot of efforts are made to predict the popularity of social information, to help the government and companies effectively control and guide public opinions. Information propagation in social networks exist many different temporal patterns, which are useful reference for predicting the future spreading of news. Considering temporal patterns are related to the network structure and information content, some researchers formulated a time series clustering problem to obtain tem­poral patterns in social networks. Previous clustering based algorithms take each cluster center as a typical propagation pattern, and then classify prediction object into its nearest-neighbor cluster. However, the nearest pattern can not fit the prediction object very precisely. This paper proposes a novel E-CTPM (Ego-Clustering based Temporal Prediction Model). E-CTPM utilizes the prediction object itself as a fixed cluster center, which can attract the most similar time series into one cluster and generate an ego-pattern for the prediction object. The tailored pattern fits the prediction object well, so it is suitable to indicate the future propagation. Experiments are carried on twitter and phrase datasets, with the results that E-CTPM outperforms the existing algorithms by achieving lower prediction bias and prediction variance. Meanwhile, E-CTPM has general applicability, which is able to work with multiple clustering methods and avoids the prediction difference resulting from classification methods.\",\"PeriodicalId\":208009,\"journal\":{\"name\":\"2017 12th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 12th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISKE.2017.8258811\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 12th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISKE.2017.8258811","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在线社交网络现在被认为是传播信息的重要平台。最近,人们在预测社会信息的流行程度方面做了很多努力,以帮助政府和企业有效地控制和引导舆论。信息在社交网络中的传播存在着多种不同的时间模式,这为预测新闻未来的传播提供了有益的参考。考虑到时间模式与网络结构和信息内容有关,一些研究者提出了一个时间序列聚类问题来获取社会网络中的时间-时间模式。以往基于聚类的算法将每个聚类中心作为典型的传播模式,然后将预测对象分类到最近邻的聚类中。然而,最接近的模式不能非常精确地拟合预测对象。提出了一种基于自我聚类的时间预测模型。E-CTPM利用预测对象本身作为固定的聚类中心,将最相似的时间序列吸引到一个聚类中,生成预测对象的自我模式。该裁剪模式与预测对象拟合较好,适合用于预测未来的传播。在twitter和短语数据集上进行了实验,结果表明,E-CTPM在预测偏差和预测方差方面均优于现有算法。同时,E-CTPM具有通用性,能够与多种聚类方法协同工作,避免了因分类方法导致的预测差异。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Ego-clustering based propagation prediction of time series in social networks
Online social networks are now recognized as an important platform for propagating information. Recently, a lot of efforts are made to predict the popularity of social information, to help the government and companies effectively control and guide public opinions. Information propagation in social networks exist many different temporal patterns, which are useful reference for predicting the future spreading of news. Considering temporal patterns are related to the network structure and information content, some researchers formulated a time series clustering problem to obtain tem­poral patterns in social networks. Previous clustering based algorithms take each cluster center as a typical propagation pattern, and then classify prediction object into its nearest-neighbor cluster. However, the nearest pattern can not fit the prediction object very precisely. This paper proposes a novel E-CTPM (Ego-Clustering based Temporal Prediction Model). E-CTPM utilizes the prediction object itself as a fixed cluster center, which can attract the most similar time series into one cluster and generate an ego-pattern for the prediction object. The tailored pattern fits the prediction object well, so it is suitable to indicate the future propagation. Experiments are carried on twitter and phrase datasets, with the results that E-CTPM outperforms the existing algorithms by achieving lower prediction bias and prediction variance. Meanwhile, E-CTPM has general applicability, which is able to work with multiple clustering methods and avoids the prediction difference resulting from classification methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An interval-valued fuzzy soft set based triple I method Knowledge-based innovative methods for collaborative quality control in equipment outsourcing chain SimWalk: Learning network latent representations with social relation similarity An evaluation of sustainable development in less developed areas of Western China A data forwarding algorithm based on estimated Hungarian method for underwater sensor networks
×
引用
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