• Journal of the Korean Society for information Management
• /
• v.32 no.2
• /
• pp.7-23
• /
• 2015

While there are several measures for node centralities, such as betweenness and degree, few centrality measures for local centralities in weighted networks have been suggested. This study developed a generalized centrality measure for calculating local centralities in weighted networks. Neighbor centrality, which was suggested in this study, is the generalization of the degree centrality for binary networks and the nearest neighbor centrality for weighted networks with the parameter ${\alpha}$. The characteristics of suggested measure and the proper value of parameter ${\alpha}$ are investigated with 6 real network datasets and the results are reported.

• Journal of Korean Library and Information Science Society
• /
• v.44 no.3
• /
• pp.405-428
• /
• 2013

This study tried to explore the relation between research networks(coauthor network, author co-citation network, author bibliographic coupling network) and research performance of Records and Archives Management study in Korea. For the analysis, three basic types of network centrality and three indicators of research performance are used. The summary of this study is as follows: Firstly, there are relations between three centralities and three indicators of research performance in the coauthor network. Secondly, there are relations between betweenness centrality and research performance in the author co-citation/author bibliographic coupling networks. Thirdly, there are relations between three centralities in the each research network. Fourthly, there are not high relations between all centralities of the three research networks.

• The Journal of the Korea Contents Association
• /
• v.15 no.11
• /
• pp.616-625
• /
• 2015

The purpose of the study is to structure the friendship network by the social network analysis and investigate the effects of social network centrality and learners' performances in college students. Both the in-degree centrality of 1st grade class study-network(t=2.722, P<.005) and the in-degree centrality of and $2^{nd}$ grade class study-network(t=2.708, P<.005)are predicted the individual student's learning performances. But there is no correlation between the in-degree centrality of $1^{st}$ and $2^{nd}$ grade class entertainment-network and the individual student's learning performances. Results of the study suggested the significant effect of social network analysis measures on learners' performance in the friendship networks. Based on the results, implication to the teaching strategy and future research direction were discussed.

• Journal of the Korean Society for Library and Information Science
• /
• v.40 no.3
• /
• pp.191-214
• /
• 2006

Recently, some bibliometric researchers tried to use the centrality analysis methods and the centrality measures which are standard tools in social network analysis. However the traditional centrality measures originated from social network analysis could not deal with weighted networks such as co-citation networks. In this study. new centrality measures for analyzing bibliometric networks with link weights are suggested and applied to three real network data, including an author co-citation network, a co-word network, and a website co-link network. The results of centrality analyses in these three cases can be regarded as Promising the usefulness of suggested centrality measures, especially in analyzing the Position and influence of each node in a bibliometric network.

• Korean Journal of Social Welfare Studies
• /
• v.41 no.4
• /
• pp.313-343
• /
• 2010

The aim of this study is to examine the factors influencing network centrality on women's welfare organizations, and to investigate how the level of network centrality influence the effectiveness of the organization. To achieve this goal, this study conducted a survey on women's welfare organizations in Seoul from March to June, 2009. Network analysis method was used to get each organization's network centrality value. Also, through the Structural Equation Modelling, organizational characteristics predicting network centrality and effect of network centrality on organizational effectiveness. The main results are as follows. First, the significant affecting factors were different between three types of centralities with regards to the type of organization, recognition of resource dependency, attitude of top manager, and established year. Second, the common factors affecting three network centralities were the number of informal ties, accepting feminism as the main organizational philosophy, and the number of qualified staffs. Third, only closeness centrality positively predicted the level of organizational effectiveness among three types of centralities. The faster the organization reaches to other organizations in a network, the organizational effectiveness becomes higher, which means high closeness centrality is more important factor than high degree centrality or high betweenness centrality to increase organizational effectiveness. This result shows social welfare organization should consider changing inter-organizational network strategy from quantity-focused to quality-focused.

• Journal of the Korean Society for information Management
• /
• v.31 no.3
• /
• pp.153-179
• /
• 2014

This study explores the characteristics of centrality measures for analyzing researchers' impact and structural positions in research collaboration networks. We investigate four binary network centrality measures (degree centrality, closeness centrality, betweenness centrality, and PageRank), and seven existing weighted network centrality measures (triangle betweenness centrality, mean association, weighted PageRank, collaboration h-index, collaboration hs-index, complex degree centrality, and c-index) for research collaboration networks. And we propose SSR, which is a new weighted centrality measure for collaboration networks. Using research collaboration data from three different research domains including architecture, library and information science, and marketing, the above twelve centrality measures are calculated and compared each other. Results indicate that the weighted network centrality measures are needed to consider collaboration strength as well as collaboration range in research collaboration networks. We also recommend that when considering both collaboration strength and range, it is appropriate to apply triangle betweenness centrality and SSR to investigate global centrality and local centrality in collaboration networks.

• Journal of the Korean Society for information Management
• /
• v.30 no.4
• /
• pp.241-264
• /
• 2013

This study compared and analyzed weighted network centrality measures supported by Opsahl's tnet and Lee's WNET, which are free softwares for weighted network analysis. Three node centrality measures including weighted degree, weighted closeness, and weighted betweenness are supported by tnet, and four node centrality measures including nearest neighbor centrality, mean association, mean profile association, triangle betweenness centrality are supported by WNET. An experimental analysis carried out on artificial network data showed tnet's high sensitiveness on linear transformations of link weights, however, WNET's centrality measures were insensitive to linear transformations. Seven centrality measures from both tools, tnet and WNET, were calculated on six real network datasets. The results showed the characteristics of weighted network centrality measures of tnet and WNET, and the relationships between them were also discussed.

• Journal of Internet Computing and Services
• /
• v.14 no.5
• /
• pp.77-85
• /
• 2013

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.

• Journal of the Korean Society for information Management
• /
• v.41 no.3
• /
• pp.511-533
• /
• 2024

This study aims to develop novel centrality measures applicable to networks that include both directional and weighted information, such as interlibrary loan networks and logistics transportation networks. While weighted PageRank has traditionally been used in such cases, experimental results reveal that it yields similar outcomes to neighborhood centrality, which measures local centrality. However, triangle betweenness centrality (TBC), despite assessing global centrality in weighted networks, does not consider link directions. To address these limitations, we propose two modified versions of the existing TBC measure: TBC-T for trust networks and TBC-F for flow networks. Applying these measures to two interlibrary loan networks, we find that TBC-T considers only the weights of inlinks, while TBC-F incorporates both inlink and outlink weights. These newly developed measures are expected to be useful for measuring node global centrality in weighted directed networks.

• Journal of Internet Computing and Services
• /
• v.17 no.1
• /
• pp.47-53
• /
• 2016

A type of workflow affiliation network is one of the specialized social network types, which represents the associative relation between actors and activities. There are many methods on a workflow affiliation network measuring centralities such as degree centrality, closeness centrality, betweenness centrality, eigenvector centrality. In particular, we are interested in the closeness centrality measurements on a workflow affiliation network discovered from enterprise workflow models, and we know that the time complexity problem is raised according to increasing the size of the workflow affiliation network. This paper proposes an estimated ranking algorithm and analyzes the accuracy and average computation time of the proposed algorithm. As a result, we show that the accuracy improves 47.5%, 29.44% in the sizes of network and the rates of samples, respectively. Also the estimated ranking algorithm's average computation time improves more than 82.40%, comparison with the original algorithm, when the network size is 2400, sampling rate is 30%.