• Journal of muscle and joint health
• /
• v.22 no.1
• /
• pp.13-19
• /
• 2015

Purpose: The purpose of this study was to identify the relationships among network centrality, psychological well-being (PWBS), and intention to exercise maintenance in participants of an aquatic exercise program. Methods: Using a single-experimental design, 17 osteoarthritis patients participated in an aquatic exercise program. The questionnaire to connect the network of members was used to peer nomination by Moreno (1953). Data were analyzed with the UCINET using centrality (degree, closeness, betweenness) and SPSS using descriptive statistics, wilcoxon signed ranked test, and spearman's rho. Results: Closeness centrality, PWBS, and intention to exercise maintenance were significantly different between 4 weeks and 8 weeks. At 4 weeks, PWBS was positively correlated with closeness centrality. Intention to exercise maintenance was positively correlated with degree, closeness, and betweenness centrality. At 8 weeks, PWBS was positively correlated with closeness centrality. Intention to exercise maintenance was positively correlated with closeness centrality. Conclusion: The aquatic exercise program can be effective in increasing closeness centrality, psychological well-being, and intention to exercise maintenance. This was the first study attempted to analyze construction of member relationships in osteoarthritis patients participating an exercise program by using social network analysis.

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

• 한국정보컨버전스학회:학술대회논문집
• /
• 2008.06a
• /
• pp.43-46
• /
• 2008

Centrality has been actively studied in network analysis field. In this paper we show a calculation method of closeness centrality for WSN. Since nodes in a sensor network are very scarce in energy and computation capability the calculation of the closeness is done in two tiers by dividing network into clusters. In first step closeness centrality for cluster heads is calculated. In the second step closeness of member nodes of the chosen cluster is computed in respect to that cluster itself.

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

• The Korean Journal of Applied Statistics
• /
• v.24 no.2
• /
• pp.401-409
• /
• 2011

From a social network of n nodes connected by l lines, one may produce centrality measures such as closeness, betweenness and so on. In the past, the magnitude of n was around 1,000 or 10,000 at most. Nowadays, some networks have 10,000, 100,000 or even more than that. Thus, the scalability issue needs the attention of researchers. In this short paper, we explore random networks of the size around n = 100,000 by Monte-Carlo method and propose Monte-Carlo algorithms of computing closeness and betweenness centrality measures to study the small world properties of social networks.

• Communications for Statistical Applications and Methods
• /
• v.29 no.4
• /
• pp.487-498
• /
• 2022

Social network analysis (SNA) techniques have recently been developed to monitor and detect abnormal behaviors in social networks. As a useful tool for process monitoring, control charts are also useful for network monitoring. In this paper, the degree and closeness centrality measures, in which each has global and local perspectives, respectively, are applied to an exponentially weighted moving average (EWMA) chart and a multinomial cumulative sum (CUSUM) chart for monitoring undirected weighted networks. In general, EWMA charts monitor only one variable in a single chart, whereas multinomial CUSUM charts can monitor a categorical variable, in which several variables are transformed through classification rules, in a single chart. To monitor both degree centrality and closeness centrality simultaneously, we categorize them based on the average of each measure and then apply to the multinomial CUSUM chart. In this case, the global and local attributes of the network can be monitored simultaneously with a single chart. We also evaluate the performance of the proposed procedure through a simulation study.

• Korea Trade Review
• /
• v.47 no.4
• /
• pp.137-159
• /
• 2022

This study aims to analyze international trade papers published in Korea during the past 2002-2022 years. Through this study, it is possible to understand the main subject and direction of research in Korea's international trade field. As the research mythologies, this study uses the big data analysis such as the text mining and Social Network Analysis such as frequency analysis, several centrality analysis, and topic analysis. After analyzing the empirical results, the frequency of key word is very high in trade, export, tariff, market, industry, and the performance of firm. However, there has been a tendency to include logistics, e-business, value and chain, and innovation over the time. The degree and closeness centrality analyses also show that the higher frequency key words also have been higher in the degree and closeness centrality. In contrast, the order of eigenvector centrality seems to be different from those of the degree and closeness centrality. The ego network shows the density of business, sale, exchange, and integration appears to be high in order unlike the frequency analysis. The topic analysis shows that the export, trade, tariff, logstics, innovation, industry, value, and chain seem to have high the probabilities of included in several topics.

• Kyungpook Mathematical Journal
• /
• v.56 no.4
• /
• pp.1191-1205
• /
• 2016

The emergence of various Internet worms, including the stand-alone Code Red worm that caused a distributed denial of service (DDoS), has prompted many studies on their propagation speed to minimize potential damages. Many studies, however, assume the same probabilities for initially infected nodes to infect each node during their propagation, which do not reflect accurate Internet worm propagation modelling. Thus, this paper analyzes how Internet worm propagation speed varies according to the number of vulnerable hosts directly connected to infected hosts as well as the link costs between infected and vulnerable hosts. A mathematical model based on centrality theory is proposed to analyze and simulate the effects of degree centrality values and closeness centrality values representing the connectivity of nodes in a large-scale network environment on Internet worm propagation speed.

• Journal of Internet Computing and Services
• /
• v.16 no.3
• /
• pp.71-77
• /
• 2015

This paper implements an estimated closeness centrality ranking algorithm in large-scale workflow-supported social networks and performance analyzes of the algorithm. Existing algorithm has a time complexity problem which is increasing performance time by network size. This problem also causes ranking process in large-scale workflow-supported social networks. To solve such problems, this paper conducts comparison analysis on the existing algorithm and estimated results by applying estimated-driven RankCCWSSN(Rank Closeness Centrality Workflow-supported Social Network). The RankCCWSSN algorithm proved its time-efficiency in a procedure about 50% decrease.

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