• Journal of Internet Computing and Services
    ISSN 2287 - 1136 (Online) / ISSN 1598 - 0170 (Print)
    https://jics.or.kr/
Menu

A Closeness Centrality Analysis Algorithm for Workflow-supported Social Networks


Sungjoo Park, Kwanghoon Pio Kim, Journal of Internet Computing and Services, Vol. 14, No. 5, pp. 77-86, Oct. 2013
10.7472/jksii.2013.14.5.77, Full Text:  HTML
Keywords: Workflow, Social Network, Workflow-supported Social Network, Closeness Centrality

Abstract

This paper proposes a closeness centrality analysis algorithm for workflow-supported social networks that represent the collaborative relationships among the performers who are involved in a specific workflow model. The proposed algorithm uses the social network analysis techniques, particularly closeness centrality equations, to analyze the closeness centrality of the workflow-supported social network. Additionally, through an example we try to verify the accuracy and appropriateness of the proposed algorithm.


Statistics
Show / Hide Statistics

Statistics (Past 3 Years)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[APA Style]
Park, S. & Kim, K. (2013). A Closeness Centrality Analysis Algorithm for Workflow-supported Social Networks. Journal of Internet Computing and Services, 14(5), 77-86. DOI: 10.7472/jksii.2013.14.5.77.

[IEEE Style]
S. Park and K. P. Kim, "A Closeness Centrality Analysis Algorithm for Workflow-supported Social Networks," Journal of Internet Computing and Services, vol. 14, no. 5, pp. 77-86, 2013. DOI: 10.7472/jksii.2013.14.5.77.

[ACM Style]
Sungjoo Park and Kwanghoon Pio Kim. 2013. A Closeness Centrality Analysis Algorithm for Workflow-supported Social Networks. Journal of Internet Computing and Services, 14, 5, (2013), 77-86. DOI: 10.7472/jksii.2013.14.5.77.