• 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 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 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.

• Journal of the Korean Society for information Management
• /
• v.29 no.2
• /
• pp.193-204
• /
• 2012

The characteristics of citation and centrality measures in citation networks can be identified using multiple linear regression analyses. In this study, we examine the relationships between bibliometric indices and centrality measures in an article-level co-citation network to determine whether the linear model is the best fitting model and to suggest the necessity of data transformation in the analysis. 703 highly cited articles in Physics published in 2004 were sampled, and four indicators were developed as variables in this study: citation counts, degree centrality, closeness centrality, and betweenness centrality in the co-citation network. As a result, the relationship pattern between citation counts and degree centrality in a co-citation network fits a non-linear rather than linear model. Also, the relationship between degree and closeness centrality measures, or that between degree and betweenness centrality measures, can be better explained by non-linear models than by a linear model. It may be controversial, however, to choose non-linear models as the best-fitting for the relationship between closeness and betweenness centrality measures, as this result implies that data transformation may be a necessary step for inferential statistics.

• Journal of the Korean Society for Railway
• /
• v.20 no.3
• /
• pp.413-422
• /
• 2017

In this study we investigate the importance of the subway station using network centrality measures. For centrality measures, we have used betweenness centrality, closeness centrality, and degree centrality. A new measure called weighted betweenness centrality is proposed, that combines both traditional betweenness centrality and passenger flow between stations. Through correlation analysis and power-law analysis of passenger flow on the Seoul metropolitan subway network, we have shown that weighted betweenness centrality is a meaningful and practical measure. We have also shown that passenger flow between any two stations follows a highly skewed power-law distribution.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.3
• /
• pp.1454-1466
• /
• 2016

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.

• 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 the Korean Society for information Management
• /
• v.31 no.2
• /
• pp.121-142
• /
• 2014

This study aims to investigate the importance of author keyword with analysis the position of author keyword in journal. In the first stage, an analysis was carried out on the position of author keyword. We examined the importance of author keyword by using degree centrality, closeness centrality, betweenness centrality, eigenvector centrality and effective size of structural hole. In the next stage, We performed analysis on correlation between network centrality measures and the position of author keyword. The result of correlation analysis on network centrality measures and the position of author keyword shows that there are the more significant areas of the result of the correlation analysis on degree centrality, betweenness centrality and the position of keyword. In addition, These results show that we need to consider that the possible way as measuring the importance of author keyword in journal is not only a term frequency but also degree centrality and betweenness centrality.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.41 no.2
• /
• pp.95-104
• /
• 2018

Using network betweenness centrality we attempt to analyze the characteristics of Seoul metropolitan subway lines. Betweenness centrality highlights the importance of a node as a transfer point between any pairs of nodes. This 'transfer' characteristic is obviously of paramount importance in transit systems. For betweenness centrality, both traditional betweenness centrality measure and weighted betweenness centrality measure which uses monthly passenger flow amount between two stations are used. By comparing traditional and weighted betweenness centrality measures of lines characteristics of passenger flow can be identified. We also investigated factors which affect betweenness centrality. It is the number of passenger who get on or get off that significantly affects betweenness centrality measures. Through correlation analysis of the number of passenger and betweenness centrality, it is found out that Seoul metropolitan subway system is well designed in terms of regional distribution of population. Four measures are proposed which represent the passenger flow characteristics. It is shown they do not follow Power-law distribution, which means passenger flow is relatively evenly distributed among stations. It has been shown that the passenger flow characteristics of subway networks in other foreign cities such as Beijing, Boston and San Franciso do follow power-law distribution, that is, pretty much biased passenger flow traffic characteristics. In this study we have also tried to answer why passenger traffic flow of Seoul metropolitan subway network is more homogeneous compared to that of Beijing.

• The Journal of Korean Association of Computer Education
• /
• v.10 no.2
• /
• pp.77-87
• /
• 2007

The purpose of the study was to investigate the effects of social network centrality variables on students' performance in blended learning environment in a higher educational institution. Using data from 36-student course on Learning Theories and Their Implications on Instructional Design Practices, the researcher empirically tested how social network centrality variables - such as friendship network centrality, advice network centrality, and adversary network centrality - are correlated with academic achievement measures. Results indicate, as hypothesized, the friendship and advice centrality positively correlate with, whereas the adversary centrality being negatively correlate with application performance measures and test scores. The size and quality of posted online discussions are positively and strongly correlated with the advice network centrality.