首页> 外文会议>Artificial neural networks in engineering conference >PREDICTING LINKS AND LINK CHANGE IN FRIENDS NETWORKS: SUPERVISED TIME SERIES LEARNING WITH IMBALANCED DATA
【24h】

PREDICTING LINKS AND LINK CHANGE IN FRIENDS NETWORKS: SUPERVISED TIME SERIES LEARNING WITH IMBALANCED DATA

机译:预测朋友网络中的链接和链接变更:通过不平衡数据监督时间序列学习

获取原文

摘要

We address the problem of predicting links and link change in friends networks and introduce a new supervised learning method for both types of prediction. This extends previous based on directed graph features such as the indegree of candidate friends and pair dependent relational features such as common interests. In this new work, we consider how differential user data, such as that produced using regular crawls from a social network site, can be used to produce a time series with which we can identify prediction problems over both links and link change. A key issue we address is the rarity of change between two successive versions of a social network, resulting in severe imbalance between positive and negative examples of change. We compare existing approaches towards coping with this problem, present positive results on new crawls of LiveJoumal, and consider how temporal data can enhance the relational link mining process.
机译:我们解决了在朋友网络中预测链接和链接变化的问题,并为两种类型的预测引入了新的监督学习方法。这基于诸如候选朋友的Indegree等指导图的特征来延伸,并与诸如共同兴趣的依赖关系功能。在这项新工作中,我们考虑如何使用来自社交网络站点的常规爬网的差分用户数据是如何使用的,以产生时间序列,我们可以通过这两个链路和链路改变来识别预测问题。我们解决的一个关键问题是两个连续版本的社交网络之间的变化的变化,导致正面和否定例子之间的严重失衡。我们比较现有的解决问题的方法,目前在LiveJoumal的新爬网中显示积极结果,并考虑如何提高关系链路采矿过程。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号