A closeness centrality analysis algorithm for workflow-supported social networks

Sung-jo Park, Minjae Park, Hyunah Kim, Haksung Kim, Wonhyun Yoon, T. B. Yoon, Kwanghoon Pio Kim
{"title":"A closeness centrality analysis algorithm for workflow-supported social networks","authors":"Sung-jo Park, Minjae Park, Hyunah Kim, Haksung Kim, Wonhyun Yoon, T. B. Yoon, Kwanghoon Pio Kim","doi":"10.7472/JKSII.2013.14.5.77","DOIUrl":null,"url":null,"abstract":"The purpose of this paper is to build a theoretical approach for numerically analyzing closeness centrality measures among workflow-actors of workflow-supported social network models to be formed through BPM(workflow)-driven organizational operations. The essential part of the proposed approach is a closeness centrality analysis equation to calculate each performer's closeness centrality measure on a workflow-supported social network model. In this paper, we try to develop an algorithm that is able to efficiently compute the closeness centrality analysis equation suggested from the conventional social network analysis literature, and eventually the developed algorithm will be applied to analyzing the degree of work-intimacy among those workflow-actors who are allocated to perform the corresponding workflow model.","PeriodicalId":118033,"journal":{"name":"2013 15th International Conference on Advanced Communications Technology (ICACT)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 15th International Conference on Advanced Communications Technology (ICACT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.7472/JKSII.2013.14.5.77","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 20

Abstract

The purpose of this paper is to build a theoretical approach for numerically analyzing closeness centrality measures among workflow-actors of workflow-supported social network models to be formed through BPM(workflow)-driven organizational operations. The essential part of the proposed approach is a closeness centrality analysis equation to calculate each performer's closeness centrality measure on a workflow-supported social network model. In this paper, we try to develop an algorithm that is able to efficiently compute the closeness centrality analysis equation suggested from the conventional social network analysis literature, and eventually the developed algorithm will be applied to analyzing the degree of work-intimacy among those workflow-actors who are allocated to perform the corresponding workflow model.
工作流支持的社交网络的紧密中心性分析算法
本文的目的是建立一种理论方法,用于通过BPM(工作流)驱动的组织操作形成的工作流支持的社会网络模型的工作流参与者之间的接近性中心性度量的数值分析。该方法的关键部分是一个密切中心性分析方程,用于计算每个表演者在工作流支持的社会网络模型上的密切中心性度量。在本文中,我们试图开发一种算法,能够有效地计算传统社会网络分析文献中提出的亲密度中心性分析方程,并最终将所开发的算法应用于分析被分配执行相应工作流模型的工作流参与者之间的工作亲密度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信