首页> 外文会议>ACM international conference on information and knowledge management >Content based Social Behavior Prediction: A Multi-task Learning Approach
【24h】

Content based Social Behavior Prediction: A Multi-task Learning Approach

机译:基于内容的社会行为预测:多任务学习方法

获取原文

摘要

The study of information flow analyzes the principles and mechanisms of social information distribution. It is becoming an extremely important research topic in social network research. Traditional approaches are primarily based on the social network graph topology. However, topology itself can not accurately reflect user interests or behavior. In this paper, we adopt a "microeconomics" approach to study social information diffusion. In particular, we aim to answer the question that how social information flow and socialization behaviors are related to content similarities and user interests. We study content-based social activity prediction, i.e.. to predict a user's response (e.g. comment or like) to their friends' postings (e.g. blogs) w.r.t. message content. In our solution, we cast the social behavior prediction problem as a multi-task learning problem, in which each task corresponds to a user. We have designed a novel multi-task learning algorithm for predicting information flow in social networks. In our model, we apply ι_1 and Tikhonov regularization to obtain a sparse and smooth model in a linear multi-task learning framework. With comprehensive experiments, we have demonstrated the effectiveness of the proposed learning method.
机译:信息流程研究分析了社会信息分布的原则和机制。它正在成为社会网络研究中的一个极其重要的研究课题。传统方法主要基于社交网络图形拓扑。但是,拓扑本身不能准确反映用户兴趣或行为。在本文中,我们采用“微观经济学”方法来研究社会信息扩散。特别是,我们的目标是回答社交信息流和社会化行为如何与内容相似性和用户兴趣有关的问题。我们研究基于内容的社会活动预测,即预测用户的答复(例如评论或喜欢)给他们的朋友的帖子(例如博客)w.r.t.消息内容。在我们的解决方案中,我们将社会行为预测问题投用为多任务学习问题,其中每个任务对应于用户。我们设计了一种用于预测社交网络中信息流的新型多任务学习算法。在我们的模型中,我们应用ι_1和tikhonov正常化,以获得线性多任务学习框架中的稀疏和平滑模型。通过综合实验,我们已经证明了所提出的学习方法的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号