Mining multiplex interaction relationships from usage records in social networks

Author:

Hong Tzung-Pei12,Kao Chi-Cheng3,Chen Siang-Wei1,Chen Chun-Hao4

Affiliation:

1. Department of Computer Science and Information Engineering, National University of Kaohsiung, Taiwan

2. Department of Computer Science and Engineering, National Sun Yat-sen University, Taiwan

3. Institute of Applied Mathematics, National University of Kaohsiung, Taiwan

4. Department of Information and Finance Management, National Taipei University of Technology, Taiwan

Abstract

Social networks have become increasingly popular and are commonly used in everyday life. They also become the most convenient places to send information or receive advertisements. The multiplex network is an important study topic in social networks, in which many features could be appropriately represented in different layers. In this paper, we propose an approach to find the multiplex interaction relationships based on the action records of users on social networks. The multiplex user interactions are found and divided into three levels: high, normal and low. They are then used to check the friend and the follower relations such that users can find which friends or followers are active or not. In the experiments, the parameters are chosen based on Dunbar’s number, which is the number of social relationships that humans can have with high confidence. The results show the proposed approach is effective in helping users know the truly close friend relationships on a social network.

Publisher

IOS Press

Subject

Artificial Intelligence,Computer Vision and Pattern Recognition,Theoretical Computer Science

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3