使用频繁交互的具有流层次的简明社会网络表示

T. M. G. Tennakoon, R. Nayak
{"title":"使用频繁交互的具有流层次的简明社会网络表示","authors":"T. M. G. Tennakoon, R. Nayak","doi":"10.1109/ICTAI.2018.00101","DOIUrl":null,"url":null,"abstract":"In this paper we introduce the flow hierarchy derived from frequent interactions to represent complex social networks in a concise way. Frequent interactions extract the impactful users while the flow hierarchy visualizes the dependencies and identifies different roles such as leaders, topic experts, information disseminators, emerging leaders and active followers. It is highly applicable in intelligent systems which involve user ranking, expert searching, recommendation, viral marketing, political campaigning, disaster management and many more. We present novel methods of deriving flow hierarchy considering the temporal dimension of interactions among users, flow directions and structural dependencies. We empirically evaluate proposed methods using real-world social network interaction datasets related to citation and retweet networks. Empirical analysis reveals that a hierarchy derived from frequent social interactions is effective in extracting the impactful users and their position in the network. Baseline results with user-centric measures show the efficacy of the proposed methods in finding a concise network representation.","PeriodicalId":254686,"journal":{"name":"2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Concise Social Network Representation with Flow Hierarchy Using Frequent Interactions\",\"authors\":\"T. M. G. Tennakoon, R. Nayak\",\"doi\":\"10.1109/ICTAI.2018.00101\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we introduce the flow hierarchy derived from frequent interactions to represent complex social networks in a concise way. Frequent interactions extract the impactful users while the flow hierarchy visualizes the dependencies and identifies different roles such as leaders, topic experts, information disseminators, emerging leaders and active followers. It is highly applicable in intelligent systems which involve user ranking, expert searching, recommendation, viral marketing, political campaigning, disaster management and many more. We present novel methods of deriving flow hierarchy considering the temporal dimension of interactions among users, flow directions and structural dependencies. We empirically evaluate proposed methods using real-world social network interaction datasets related to citation and retweet networks. Empirical analysis reveals that a hierarchy derived from frequent social interactions is effective in extracting the impactful users and their position in the network. Baseline results with user-centric measures show the efficacy of the proposed methods in finding a concise network representation.\",\"PeriodicalId\":254686,\"journal\":{\"name\":\"2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICTAI.2018.00101\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTAI.2018.00101","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文引入频繁交互衍生出的流层次,以简洁的方式表示复杂的社会网络。频繁的交互提取了有影响力的用户,而流层次可视化了依赖关系,并识别了不同的角色,如领导者、话题专家、信息传播者、新兴领导者和活跃的追随者。它非常适用于涉及用户排名、专家搜索、推荐、病毒式营销、政治竞选、灾难管理等智能系统。我们提出了考虑用户之间交互的时间维度、流方向和结构依赖关系的流层次的新方法。我们使用与引用和转发网络相关的真实社会网络交互数据集对提出的方法进行了实证评估。实证分析表明,频繁的社会互动产生的层次结构可以有效地提取有影响力的用户及其在网络中的位置。以用户为中心度量的基线结果显示了所提出的方法在寻找简明网络表示方面的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Concise Social Network Representation with Flow Hierarchy Using Frequent Interactions
In this paper we introduce the flow hierarchy derived from frequent interactions to represent complex social networks in a concise way. Frequent interactions extract the impactful users while the flow hierarchy visualizes the dependencies and identifies different roles such as leaders, topic experts, information disseminators, emerging leaders and active followers. It is highly applicable in intelligent systems which involve user ranking, expert searching, recommendation, viral marketing, political campaigning, disaster management and many more. We present novel methods of deriving flow hierarchy considering the temporal dimension of interactions among users, flow directions and structural dependencies. We empirically evaluate proposed methods using real-world social network interaction datasets related to citation and retweet networks. Empirical analysis reveals that a hierarchy derived from frequent social interactions is effective in extracting the impactful users and their position in the network. Baseline results with user-centric measures show the efficacy of the proposed methods in finding a concise network representation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信