社会网络中的子社区行为分析

I. Alsmadi, Chuck Easttom
{"title":"社会网络中的子社区行为分析","authors":"I. Alsmadi, Chuck Easttom","doi":"10.15864/ajse.1103","DOIUrl":null,"url":null,"abstract":"Clique relations are useful in understanding the dynamics of a wide range of social interactions. One application of studying clique relations involves studying how such “detection of abnormal cliques’ behaviors” can be used to detect sub-communities’ behaviors\n based on information from Online Social Networks (OSNs).In social networks, a clique represents a sub-group of the larger group in which every member in the clique is directly associated with every other member in the clique. Those cliques often possess a containment relation with each\n other where large cliques can contain small size cliques. Thus, finding the extent of the clique, or the maximum clique is an important research questions. In our approach, we evaluated adding the weight factor and integrating graph theory to clique algorithm in order to derive more data about\n the clique. In this regard clique activities are not like those in group discussions where an activity is posted by one user and is visible by all others. Our algorithm calculates the overall weight of the clique based on individual edges. Users post frequent activities. Their clique members,\n just like other entities, may or may not interact with all those activities.","PeriodicalId":93409,"journal":{"name":"American journal of engineering, science and technology","volume":"17 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Analysis of Sub-Communities Behavior in Social Networks\",\"authors\":\"I. Alsmadi, Chuck Easttom\",\"doi\":\"10.15864/ajse.1103\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Clique relations are useful in understanding the dynamics of a wide range of social interactions. One application of studying clique relations involves studying how such “detection of abnormal cliques’ behaviors” can be used to detect sub-communities’ behaviors\\n based on information from Online Social Networks (OSNs).In social networks, a clique represents a sub-group of the larger group in which every member in the clique is directly associated with every other member in the clique. Those cliques often possess a containment relation with each\\n other where large cliques can contain small size cliques. Thus, finding the extent of the clique, or the maximum clique is an important research questions. In our approach, we evaluated adding the weight factor and integrating graph theory to clique algorithm in order to derive more data about\\n the clique. In this regard clique activities are not like those in group discussions where an activity is posted by one user and is visible by all others. Our algorithm calculates the overall weight of the clique based on individual edges. Users post frequent activities. Their clique members,\\n just like other entities, may or may not interact with all those activities.\",\"PeriodicalId\":93409,\"journal\":{\"name\":\"American journal of engineering, science and technology\",\"volume\":\"17 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"American journal of engineering, science and technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.15864/ajse.1103\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"American journal of engineering, science and technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15864/ajse.1103","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

派系关系对于理解广泛的社会互动的动态是有用的。研究集团关系的一个应用涉及研究如何利用这种“异常集团行为检测”来检测基于在线社交网络(Online Social Networks, osn)信息的子社区行为。在社交网络中,小团体代表大团体的一个子团体,其中小团体中的每个成员都与小团体中的其他成员直接相关。这些小集团往往具有相互牵制的关系,大的小集团可以容纳小的小集团。因此,寻找集团的程度,或最大集团是一个重要的研究问题。在我们的方法中,我们评估了在团算法中添加权重因子和整合图论,以获得更多关于团的数据。在这方面,小团体活动不像那些由一个用户发布的活动,所有其他用户都可以看到。我们的算法基于单个边计算团的总权重。用户发布频繁的活动。他们的小集团成员,就像其他实体一样,可能会或可能不会与所有这些活动互动。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The Analysis of Sub-Communities Behavior in Social Networks
Clique relations are useful in understanding the dynamics of a wide range of social interactions. One application of studying clique relations involves studying how such “detection of abnormal cliques’ behaviors” can be used to detect sub-communities’ behaviors based on information from Online Social Networks (OSNs).In social networks, a clique represents a sub-group of the larger group in which every member in the clique is directly associated with every other member in the clique. Those cliques often possess a containment relation with each other where large cliques can contain small size cliques. Thus, finding the extent of the clique, or the maximum clique is an important research questions. In our approach, we evaluated adding the weight factor and integrating graph theory to clique algorithm in order to derive more data about the clique. In this regard clique activities are not like those in group discussions where an activity is posted by one user and is visible by all others. Our algorithm calculates the overall weight of the clique based on individual edges. Users post frequent activities. Their clique members, just like other entities, may or may not interact with all those activities.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信