有向和加权网络中以自我为中心的社区检测

A. O. E. Moctar, Idrissa Sarr
{"title":"有向和加权网络中以自我为中心的社区检测","authors":"A. O. E. Moctar, Idrissa Sarr","doi":"10.1145/3110025.3121243","DOIUrl":null,"url":null,"abstract":"Community detection is one of the most studied topics in Social Network Analysis. Research in this realm has predominantly focus on finding out communities by considering the network as a whole. That is, all nodes are put in the same pool to define central metrics for finding out communities while ignoring the particularity of some nodes and their impact. Yet, if the position of some nodes matters when defining the metrics (i.e. node centric approach), the found communities may differ and can make more sens in real life situations. For instance, identifying the communities based on drug dealers and their interactions with others sounds better than finding communities while ignoring the individuals status. The purpose of this paper is to detect ego-centered community, which is defined as a community built from a particular node. Our solution is set to combine both link direction and weight, and therefore, differs from many existing solutions. Basically, we rely on a metric called a quality function that uses link properties to assess the cohesion of identified groups. Our method detect communities that reflect not only the structure but the reality regarding to the interaction nature in terms of intensity. We implement our solution and use \"Les Miserables\" dataset to demonstrate the effectiveness of our solution.","PeriodicalId":399660,"journal":{"name":"Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017","volume":"88 2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Ego-centered community detection in directed and weighted networks\",\"authors\":\"A. O. E. Moctar, Idrissa Sarr\",\"doi\":\"10.1145/3110025.3121243\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Community detection is one of the most studied topics in Social Network Analysis. Research in this realm has predominantly focus on finding out communities by considering the network as a whole. That is, all nodes are put in the same pool to define central metrics for finding out communities while ignoring the particularity of some nodes and their impact. Yet, if the position of some nodes matters when defining the metrics (i.e. node centric approach), the found communities may differ and can make more sens in real life situations. For instance, identifying the communities based on drug dealers and their interactions with others sounds better than finding communities while ignoring the individuals status. The purpose of this paper is to detect ego-centered community, which is defined as a community built from a particular node. Our solution is set to combine both link direction and weight, and therefore, differs from many existing solutions. Basically, we rely on a metric called a quality function that uses link properties to assess the cohesion of identified groups. Our method detect communities that reflect not only the structure but the reality regarding to the interaction nature in terms of intensity. We implement our solution and use \\\"Les Miserables\\\" dataset to demonstrate the effectiveness of our solution.\",\"PeriodicalId\":399660,\"journal\":{\"name\":\"Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017\",\"volume\":\"88 2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-07-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3110025.3121243\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3110025.3121243","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

社区检测是社会网络分析中研究最多的课题之一。这一领域的研究主要集中在通过将网络作为一个整体来寻找社区。也就是说,所有节点都放在同一个池中,以定义查找社区的中心指标,同时忽略某些节点的特殊性及其影响。然而,如果在定义度量时某些节点的位置很重要(即以节点为中心的方法),那么所发现的社区可能会有所不同,并且在现实生活中可能更有意义。例如,根据毒贩及其与他人的互动来确定社区,听起来比在忽视个人地位的情况下寻找社区要好。本文的目的是检测以自我为中心的社区,它被定义为从特定节点构建的社区。我们的解决方案结合了链接方向和权重,因此不同于许多现有的解决方案。基本上,我们依赖于一个称为质量函数的度量,它使用链接属性来评估已识别组的内聚性。我们的方法检测的社区不仅反映了结构,而且在强度方面反映了相互作用性质的现实。我们实现了我们的解决方案,并使用“悲惨世界”数据集来证明我们的解决方案的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Ego-centered community detection in directed and weighted networks
Community detection is one of the most studied topics in Social Network Analysis. Research in this realm has predominantly focus on finding out communities by considering the network as a whole. That is, all nodes are put in the same pool to define central metrics for finding out communities while ignoring the particularity of some nodes and their impact. Yet, if the position of some nodes matters when defining the metrics (i.e. node centric approach), the found communities may differ and can make more sens in real life situations. For instance, identifying the communities based on drug dealers and their interactions with others sounds better than finding communities while ignoring the individuals status. The purpose of this paper is to detect ego-centered community, which is defined as a community built from a particular node. Our solution is set to combine both link direction and weight, and therefore, differs from many existing solutions. Basically, we rely on a metric called a quality function that uses link properties to assess the cohesion of identified groups. Our method detect communities that reflect not only the structure but the reality regarding to the interaction nature in terms of intensity. We implement our solution and use "Les Miserables" dataset to demonstrate the effectiveness of our solution.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信