首页> 外文会议>IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining >Solving the missing node problem using structure and attribute information
【24h】

Solving the missing node problem using structure and attribute information

机译:使用结构和属性信息解决缺少节点的问题

获取原文

摘要

An important area of social networks research is identifying missing information which is not explicitly represented in the network, or is not visible to all. Recently, the Missing Node Identification problem was introduced where missing members in the social network structure must be identified. However, previous works did not consider the possibility that information about specific users (nodes) within the network could be useful in solving this problem. In this paper, we present two algorithms: SAMI-A and SAMI-N. Both of these algorithms use the known nodes' specific information, such as demographic information and the nodes' historical behavior in the network. We found that both SAMI-A and SAMI-N perform significantly better than other missing node algorithms. However, as each of these algorithms and the parameters within these algorithms often perform better in specific problem instances, a mechanism is needed to select the best algorithm and the best variation within that algorithm. Towards this challenge, we also present OASCA, a novel online selection algorithm. We present results that detail the success of the algorithms presented within this paper.
机译:社交网络研究的一个重要领域是识别缺少的信息,这些信息未在网络中明确表示或对所有人不可见。最近,引入了“丢失节点识别”问题,其中必须识别社交网络结构中的丢失成员。但是,先前的工作没有考虑有关网络内特定用户(节点)的信息对解决此问题可能有用的可能性。在本文中,我们提出了两种算法:SAMI-A和SAMI-N。这两种算法都使用已知节点的特定信息,例如人口统计信息和节点在网络中的历史行为。我们发现SAMI-A和SAMI-N的性能均明显优于其他缺失节点算法。然而,由于这些算法中的每一个以及这些算法中的参数通常在特定的问题实例中表现更好,因此需要一种机制来选择最佳算法和该算法中的最佳变化。为了应对这一挑战,我们还提出了一种新颖的在线选择算法OASCA。我们提出的结果详细说明了本文提出的算法的成功。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号