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

• Journal of Intelligence and Information Systems
• /
• v.18 no.4
• /
• pp.117-127
• /
• 2012

Due to the recent expansion of the Web 2.0 -based services, along with the widespread of smartphones, online social network services are being popularized among users. Online social network services are the online community services which enable users to communicate each other, share information and expand human relationships. In the social network services, each relation between users is represented by a graph consisting of nodes and links. As the users of online social network services are increasing rapidly, the SNS are actively utilized in enterprise marketing, analysis of social phenomenon and so on. Social Network Analysis (SNA) is the systematic way to analyze social relationships among the members of the social network using the network theory. In general social network theory consists of nodes and arcs, and it is often depicted in a social network diagram. In a social network diagram, nodes represent individual actors within the network and arcs represent relationships between the nodes. With SNA, we can measure relationships among the people such as degree of intimacy, intensity of connection and classification of the groups. Ever since Social Networking Services (SNS) have drawn increasing attention from millions of users, numerous researches have made to analyze their user relationships and messages. There are typical representative SNA methods: degree centrality, betweenness centrality and closeness centrality. In the degree of centrality analysis, the shortest path between nodes is not considered. However, it is used as a crucial factor in betweenness centrality, closeness centrality and other SNA methods. In previous researches in SNA, the computation time was not too expensive since the size of social network was small. Unfortunately, most SNA methods require significant time to process relevant data, and it makes difficult to apply the ever increasing SNS data in social network studies. For instance, if the number of nodes in online social network is n, the maximum number of link in social network is n(n-1)/2. It means that it is too expensive to analyze the social network, for example, if the number of nodes is 10,000 the number of links is 49,995,000. Therefore, we propose a heuristic-based method for finding the shortest path among users in the SNS user graph. Through the shortest path finding method, we will show how efficient our proposed approach may be by conducting betweenness centrality analysis and closeness centrality analysis, both of which are widely used in social network studies. Moreover, we devised an enhanced method with addition of best-first-search method and preprocessing step for the reduction of computation time and rapid search of the shortest paths in a huge size of online social network. Best-first-search method finds the shortest path heuristically, which generalizes human experiences. As large number of links is shared by only a few nodes in online social networks, most nods have relatively few connections. As a result, a node with multiple connections functions as a hub node. When searching for a particular node, looking for users with numerous links instead of searching all users indiscriminately has a better chance of finding the desired node more quickly. In this paper, we employ the degree of user node vn as heuristic evaluation function in a graph G = (N, E), where N is a set of vertices, and E is a set of links between two different nodes. As the heuristic evaluation function is used, the worst case could happen when the target node is situated in the bottom of skewed tree. In order to remove such a target node, the preprocessing step is conducted. Next, we find the shortest path between two nodes in social network efficiently and then analyze the social network. For the verification of the proposed method, we crawled 160,000 people from online and then constructed social network. Then we compared with previous methods, which are best-first-search and breath-first-search, in time for searching and analyzing. The suggested method takes 240 seconds to search nodes where breath-first-search based method takes 1,781 seconds (7.4 times faster). Moreover, for social network analysis, the suggested method is 6.8 times and 1.8 times faster than betweenness centrality analysis and closeness centrality analysis, respectively. The proposed method in this paper shows the possibility to analyze a large size of social network with the better performance in time. As a result, our method would improve the efficiency of social network analysis, making it particularly useful in studying social trends or phenomena.

• Journal of Korea Port Economic Association
• /
• v.38 no.4
• /
• pp.25-43
• /
• 2022

Unlike the past, efforts must be made to interpret physical distribution from a network perspective as the service area expands spatially. In addition, logistics networks are undergoing rapid changes due to various changes in the environment. Therefore, the purpose of this study is to analyze the changes in the structure of maritime cargo and the centrality of ports using social network analysis. Using the trade data of domestic maritime at five-year intervals, we investigated changes in the network structure and identified the main factors that affect the centrality of domestic ports. Ports with the highest centrality, which is seen as a port that plays the role of an intermediary, emerged in the order of Busan and Ulsan. This study predicts patterns of domestic cargo trade over the next 20 years based on changes in port centrality and understanding of maritime cargo network, and can be used as reference materials for risk preparation.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.28 no.2
• /
• pp.99-117
• /
• 2017

The present study positively analyzed the hyperlinks of 32 web sites with the purpose of analyzing the hyperlink network structure of web sites for each domestic library type. After collecting the hyperlink data using the crawler, we analyzed the overall characteristics of the websites in the network based on the characteristics of the library. The results are as follows. 1) Among all analyzed libraries, Yonsei scored the highest in degree centrality, betweenness centrality, closeness centrality, and eigenvector centrality. 2) By library type, Sejong for national library, Seoul for public library, and Yonsei for college library appeared an influential a relatively. Based on these analysis results, the present study will be utilized as basic data for establishing an operation strategy that improves the efficiency and effectiveness of library web sites in the future.

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

• Journal of Information Technology Services
• /
• v.18 no.4
• /
• pp.83-95
• /
• 2019

It is becoming more and more difficult to cope with new knowledge and technology required by society by the efforts of one person or organization according to the development of science and technology. As a method to overcome this, collaborative research is becoming important. This tendency is increasing in the government R&D projects as well, and the 'A' test research institute, which is the subject of this paper, is also increasing a collaborative research. The purpose of this study is to analyze the network characteristics among the participating researchers in the government R&D project conducted by the institution A, and to ascertain how the network characters of the researchers actually affect the financial performance of the team. The results of the analysis show that 'closeness centrality' and 'degree of centrality' contribute positively to the financial performance of the team. On the other hand, 'betweenness centrality' and 'eigenvector centrality' have a negative effect on the financial performance of the team because they are not directly related to financial performance.

• 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 Navigation and Port Research
• /
• v.44 no.2
• /
• pp.73-78
• /
• 2020

The cruise industry in the Mediterranean region increased from 2000-2018, being the second most important region after the Caribbean. The purpose of this study was to analyze the networks and hub ports of the Mediterranean. This paper used the SNA (Social Network Analysis) methodology, which includes Hub and Authority Combined Centrality (HACC) that has been used to analyze cruise port centrality, as well as degree centrality such as In-Degree, Out-Degree, and Betweenness. This empirical study suggests that the top three ports of the Mediterranean ports' network in terms of hub index are Barcelona, Civitavecchia, and Palma de Mallorca. The academic implications are the suggestion for data integration based on real itineraries and numbers of POC (Port of Calls), as well as the selection of the hubs of the targeted areas. The practical implications are suggested such as a clear requirement for cruise industry, as a way to widen the scope for the Mediterranean region and a valuable reference for cruise ship companies to select the best fit home ports.

• Human Ecology Research
• /
• v.60 no.1
• /
• pp.1-20
• /
• 2022

This paper presents a social network analysis of changes in Home Economics education content loaded on YouTube before and after the outbreak of COVID-19. From January 1, 2008 to June 30, 2021, a basic analysis was conducted of 761 Home Economics education videos loaded on YouTube, using NetMiner 4.3 to analyze important keywords and the centrality of video titles and full texts. Before COVID-19, there were 164 Home Economics education videos posted on YouTube, increasing significantly to 597 following the emergence of the pandemic. In both periods, there was more middle school content than high school content. The content in the child-family field was the most, and the main keywords were youth and family. Before COVID-19, a performance evaluation indicated that the proportion of student content was high, whereas after the outbreak of the disease, teacher content increased significantly due to the effect of distance learning. However, compared with video use, the self-expression and participation of users were lower in both periods. The centrality analysis indicated that in the title, 'family' exhibited a high degree of both centrality and eigenvector centrality over the entire period. Degree centrality of the video title was found to be high in the order of class, online, family, management, etc. after the outbreak of COVID-19, and the connection of keywords was strong overall. Eigenvector centrality indicated that career, search, life, and design were influential keywords before COVID-19, while class, youth, online, and development were influential keywords after COVID-19.

• Journal of the Korea Convergence Society
• /
• v.8 no.9
• /
• pp.199-209
• /
• 2017

This study was carried out to confirm a convergent research pattern and researchers' role in stem cell sector by social network analysis. Articles were extracted from 1996 to 2012 in PubMed, 515 authors of 270 embryonic stem cell and induced pluripotent stem cell articles and 1,515 authors of 580 adult stem cell and mesenchymal stem cell articles. Degree(D) and betweenness(B) centrality was measured and co-author network was generated for researcher's role. As a result, Core researcher and Intermediary researcher was identified in co-author network. Core researcher had high D. centrality, otherwise high B. centrality or not. Intermediary researcher for convergent research had high B. centrality and low D. centrality. Conclusively, co-author network will be used as objective data not only to find core researchers in subject area for improving achievement but also to select experts for research project evaluation.