Browse > Article
http://dx.doi.org/10.3837/tiis.2016.03.031

An Estimated Closeness Centrality Ranking Algorithm and Its Performance Analysis in Large-Scale Workflow-supported Social Networks  

Kim, Jawon (Department of Security Convergence, Chung-ang University)
Ahn, Hyun (Department of Computer Science, Kyonggi University)
Park, Minjae (BISTel, Inc. Engineering Innovation Department)
Kim, Sangguen (Department of Security Convergence, Chung-ang University)
Kim, Kwanghoon Pio (Department of Computer Science, Kyonggi University)
Publication Information
KSII Transactions on Internet and Information Systems (TIIS) / v.10, no.3, 2016 , pp. 1454-1466 More about this Journal
Abstract
This paper implements an estimated ranking algorithm of closeness centrality measures in large-scale workflow-supported social networks. The traditional ranking algorithms for large-scale networks have suffered from the time complexity problem. The larger the network size is, the bigger dramatically the computation time becomes. To solve the problem on calculating ranks of closeness centrality measures in a large-scale workflow-supported social network, this paper takes an estimation-driven ranking approach, in which the ranking algorithm calculates the estimated closeness centrality measures by applying the approximation method, and then pick out a candidate set of top k actors based on their ranks of the estimated closeness centrality measures. Ultimately, the exact ranking result of the candidate set is obtained by the pure closeness centrality algorithm [1] computing the exact closeness centrality measures. The ranking algorithm of the estimation-driven ranking approach especially developed for workflow-supported social networks is named as RankCCWSSN (Rank Closeness Centrality Workflow-supported Social Network) algorithm. Based upon the algorithm, we conduct the performance evaluations, and compare the outcomes with the results from the pure algorithm. Additionally we extend the algorithm so as to be applied into weighted workflow-supported social networks that are represented by weighted matrices. After all, we confirmed that the time efficiency of the estimation-driven approach with our ranking algorithm is much higher (about 50% improvement) than the traditional approach.
Keywords
Workflow-supported social network; Closeness centrality measurement; Estimation-driven ranking algorithm; Performance analysis;
Citations & Related Records
Times Cited By KSCI : 7  (Citation Analysis)
연도 인용수 순위
1 D. Knoke, S. Yang, Social Network Analysis - Edition, Series: Quantitative Applications in the Social Sciences, SAGE Publications, 2008.
2 W. M. P. van der Aalst, H. A. Reijers, M. Song, “Discovering social networks from event logs,” Computer Supported Cooperative Work, vol. 14, no. 6, pp. 549-593, 2005. Article (CrossRef Link)   DOI
3 J. Song, et al., "A framework: Workflow-based social network discovery and analysis," in Proc. of the 13th International Conference on Computational Science and Engineering, pp. 421-426, 2010. Article (CrossRef Link)
4 J. Kim, H. Ahn, K. Kim, “Performance analysis of an estimated closeness centrality ranking algorithm in large-scale workflow-supported social networks,” Journal of Internet Computing and Services, vol. 16, no. 3, pp. 71-77, 2015. Article (CrossRef Link)   DOI
5 S. Park, K. P. Kim, "A closeness centrality analysis algorithm for workflow-supported social networks," in Proc. of the 15th International Conference on Advanced Communication Technology, pp. 158-161, 2013.
6 M.-S. Kim, K.-H. Kim, "A disconnectedness determination algorithm on workflow-supported enterprise social networks," Journal of Internet Computing and Services, vol. 16, no. 5, pp. 67-73, 2015.   DOI
7 M. Kim, H. Kim, K. P. Kim, "Disconnectedness on workflow-supported organizational social networks," in Proc. of the 6th International Conference on Internet, pp. 109-114, 2014.
8 J. Kim, et al., "A ranking algorithm of closeness centralities for large scale workflow-supported social networks," in Proc. of KSII Domestic Conference on Internet Information, pp. 55-56, 2014.
9 J. Kim, H. Ahn, K. P. Kim, "Performance analysis of an estimated closeness centrality ranking algorithm in large-scale workflow-supported social networks," in Proc. of the 10th Asia-Pacific Conference on Information Science and Technology, pp. 75-80, 2015.
10 K. Kim, “A workflow-based social network intelligence discovery algorithm,” Journal of Internet Computing and Services, vol. 13, no. 2, pp. 73-86, 2012. Article (CrossRef Link)   DOI
11 K. Kim, “A workflow-based affiliation network knowledge discovery algorithm,” Journal of Internet Computing and Services, vol. 13, no. 2, pp. 109-118, 2012. Article (CrossRef Link)   DOI
12 H. Kim, H. Ahn, K. P. Kim, “Discovering workflow performer-application affiliation knowledge and its implications,” ICIC Express Letters, vol. 9, no. 4, pp. 1049-1056, 2015.
13 H. Jeong, H. Kim, K. P. Kim, "Betweenness centralization analysis formalisms on workflow-supported org-social networks," in Proc. of the 16th International Conference on Advanced Communications Technology, pp. 1173-1177. 2014. Article (CrossRef Link)
14 M.-J. Kim, H. Ahn, M.-J. Park, “A theoretical framework for closeness centralization measurements in a workflow-supported organization,” KSII Transactions on Internet and Information Systems, vol. 9, no. 9, pp. 3611-3634, 2015.   DOI
15 M.-J. Kim, H. Ahn, M. Park, “A GraphML-based visualization framework for workflow-performer's closeness centrality measurements,” KSII Transactions on Internet and Information Systems, vol. 9, no. 8, pp. 3216-3230, 2015.   DOI
16 H. Ahn, H. Kim, K. P. Kim, “Visualizing workflow-supported social networks and their degree centrality measures,” International Journal of Advances in Soft Computing and Its Application, vol. 6, no. 3, pp. 82-93, 2014.
17 H. Ahn, C. Park, K. Kim, "A BPM activity-performer correspondence analysis method," Journal of Internet Computing and Services, vol. 14, no. 4, pp. 64-72, 2013. Article (CrossRef Link)
18 H. Ahn, K. Kim, "An activity-performer bipartite matrix generation algorithm for analyzing workflow-supported human-resource affiliations," Journal of Internet Computing and Services, vol. 14, no. 2, pp. 25-34, 2013. Article (CrossRef Link)
19 H. Kim, H. Ahn, K. P. Kim, “Modeling, discovering, and visualizing workflow performer-role affiliation networking knowledge,” KSII Transactions on Internet and Information Systems, vol. 8, no. 2, pp. 134-151, 2014. Article (CrossRef Link)
20 M. Jeon, K. P. Kim, “Workload-centrality analysis and visualization of workflow-supported social networks,” ICIC Express Letters, vol. 7, no. 3(B), pp. 1049-1054, 2013.
21 D. Lee, et al., "An approximation approach to rank closeness centrality measures in a large-scale workflow affiliation network," in Proc. of the 10th Asia Pacific International Conference on Information Science and Technology, pp. 75-80, 2015.
22 A. Graves, A. Sibel, H. Jim, "A method to rank nodes in an RDF graph," in Proc. of International Semantic Web Conference (Posters & Demos), vol. 401, 2008. Article (CrossRef Link)
23 W. de Nooy, M. Andrej, B. Vladimir, "Exploratory Social Network Analysis with Pajek," Cambridge University Press, vol. 27, 2011.
24 P. DeScioli, et al., “Best friends alliances, friend ranking, and the myspace social network,” Perspectives on Psychological Science, vol. 6, no. 1, pp. 6-8, 2011. Article (CrossRef Link)   DOI
25 D. Eppstein, J. Wang, “Fast approximation of centrality,” Journal of Graph Algorithms and Applications, vol. 8, no. 1, pp. 39-45, 2004. Article (CrossRef Link)   DOI
26 K. Okamoto, W. Chen, X.-Y. Li, "Ranking of closeness centrality for large-scale social networks," Lecture Notes in Computer Science of Frontiers in Algorithmics, vol. 5059, pp. 186-195, 2008. Article (CrossRef Link)
27 Shortest path problem, Article (CrossRef Link)
28 T. Opsahl, A. Filip, S. John, “Node centrality in weighted networks: Generalizing degree and shortest paths,” Social Networks, vol. 32, no. 3, pp. 245-251, 2010. Article (CrossRef Link)   DOI
29 E. W. Dijkstra, “A note on two problems in connexion with graphs,” Numerische Mathematik, vol. 1, no. 1, pp. 269-271, 1959. Article (CrossRef Link)   DOI
30 M. E. J. Newman, “Scientific collaboration networks. Ⅱ. Shortest paths, weighted networks, and centrality,” Physical Review E, vol. 64, 016132, 2001. Article (CrossRef Link)   DOI
31 U. Brandes, “A faster algorithm for betweenness centrality,” Journal of Mathematical Sociology, vol. 25, pp. 163-177, 2001. Article (CrossRef Link)   DOI