• Title/Summary/Keyword: NETWORK CENTRALITY

Search Result 727, Processing Time 0.03 seconds

A Closeness Centrality Analysis Algorithm for Workflow-supported Social Networks (워크플로우 소셜 네트워크 근접중심성 분석 알고리즘)

  • Park, Sungjoo;Kim, Kwanghoon Pio
    • 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.

A Study on International Trade of Water Transport Service using Social Network Analysis (소셜네트워크분석(SNA)을 활용한 수상운송서비스 무역 네트워크 분석 연구)

  • Seon-youl Park
    • Korea Trade Review
    • /
    • v.47 no.3
    • /
    • pp.75-92
    • /
    • 2022
  • This study aims to analyze the International trade network of Water transport service using Social Network Analysis for defining the status of Korean Water transport industry. This study use World Input-Output Table of Asian Development Bank from 2000 to 2020 and build the International trade matrix of Water transport service from that. Therefore, this study analyze Out-degree centrality, In-degree centrality and betweenness centrality of Korea and other main countries in the matrix of World Water transport industry. As a result, Korea rank above 10th in the all centralities and the total output also rank 8th in the world, therefore, this study show the importance of Korean Water transport industry in the world. However, Singapore has the highest centrality in the world, even though China has the largest Total output among 63 countries.

Movie Popularity Classification Based on Support Vector Machine Combined with Social Network Analysis

  • Dorjmaa, Tserendulam;Shin, Taeksoo
    • Journal of Information Technology Services
    • /
    • v.16 no.3
    • /
    • pp.167-183
    • /
    • 2017
  • The rapid growth of information technology and mobile service platforms, i.e., internet, google, and facebook, etc. has led the abundance of data. Due to this environment, the world is now facing a revolution in the process that data is searched, collected, stored, and shared. Abundance of data gives us several opportunities to knowledge discovery and data mining techniques. In recent years, data mining methods as a solution to discovery and extraction of available knowledge in database has been more popular in e-commerce service fields such as, in particular, movie recommendation. However, most of the classification approaches for predicting the movie popularity have used only several types of information of the movie such as actor, director, rating score, language and countries etc. In this study, we propose a classification-based support vector machine (SVM) model for predicting the movie popularity based on movie's genre data and social network data. Social network analysis (SNA) is used for improving the classification accuracy. This study builds the movies' network (one mode network) based on initial data which is a two mode network as user-to-movie network. For the proposed method we computed degree centrality, betweenness centrality, closeness centrality, and eigenvector centrality as centrality measures in movie's network. Those four centrality values and movies' genre data were used to classify the movie popularity in this study. The logistic regression, neural network, $na{\ddot{i}}ve$ Bayes classifier, and decision tree as benchmarking models for movie popularity classification were also used for comparison with the performance of our proposed model. To assess the classifier's performance accuracy this study used MovieLens data as an open database. Our empirical results indicate that our proposed model with movie's genre and centrality data has by approximately 0% higher accuracy than other classification models with only movie's genre data. The implications of our results show that our proposed model can be used for improving movie popularity classification accuracy.

An Analysis of Cultural Policy-related Studies' Trend in Korea using Semantic Network Analysis(2008-2017) (언어네트워크분석을 통한 국내 문화정책 연구동향 분석(2008-2017))

  • Park, Yang Woo
    • The Journal of the Korea Contents Association
    • /
    • v.17 no.11
    • /
    • pp.371-382
    • /
    • 2017
  • This study aims to analyze the research trend of cultural policy-related papers based on 832 key words among 186 whole articles in the Journal of Cultural Policy by the Korea Culture & Tourism Institute from October 2008 to January 2017. The analysis was performed using a big data analysis technique called the Semantic Network Analysis. The Semantic Network Analysis consists of frequency analysis, density analysis, centrality analysis including degree centrality, betweenness centrality, and eigenvector centrality. Lastly, the study shows a figure visualizing the results of the centrality analysis through Netdraw program. The most frequently exposed key words were 'culture', 'cultural policy/administration', 'cultural industry/cultural content', 'policy', 'creative industry', in the order. The key word 'culture' was ranked as the first in all the analysis of degree centrality, betweenness centrality and eigenvector centrality, followed by 'policy' and 'cultural policy/administraion'. The key word 'cultural industry/cultural content' with very high frequency recorded high points in degree centrality and eigenvector centrality, but showed relatively low points in betweenness centrality.

Curve Estimation among Citation and Centrality Measures in Article-level Citation Networks (문헌 단위 인용 네트워크 내 인용과 중심성 지수 간 관계 추정에 관한 연구)

  • Yu, So-Young
    • 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.

A Big Data Analysis on Research Keywords, Centrality, and Topics of International Trade using the Text Mining and Social Network (텍스트 마이닝과 소셜 네트워크 기법을 활용한 국제무역 키워드, 중심성과 토픽에 대한 빅데이터 분석)

  • Chae-Deug Yi
    • 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.

Study on Influence and Diffusion of Word-of-Mouth in Online Fashion Community Network (온라인 패션커뮤니티 네트워크에서의 구전 영향력과 확산력에 관한 연구)

  • Song, Kieun;Lee, Duk Hee
    • Journal of the Korean Society of Costume
    • /
    • v.65 no.6
    • /
    • pp.25-35
    • /
    • 2015
  • The purpose of this study is to investigate the characteristics of members and communities that have significant influence in the online fashion community through their word-of-mouth activities. In order to identify the influence and the diffusion of word-of-mouth in fashion community, the study selected one online fashion community. Then, the study sorted the online posts and comments made on fashion information and put them into the matrix form to perform social network analysis. The result of the analysis is as follows: First, the fashion community network used in the study has many active members that relay information very quickly. Average time for information diffusion is very short, taking only one or two days in most cases. Second, the influence of word-of-mouth is led by key information produced from only a few members. The number of influential members account for less than 20% of the total number of community members, which indicate high level of degree centrality. The diffusion of word-of-mouth is led by even fewer members, which represent high level of betweenness centrality, compared to the case of degree centrality. Third, component characteristic shares similar information with about 70% of all members being linked to maximize information influence and diffusion. Fourth, a node with high degree centrality and betweenness centrality shares similar interests, presenting strain effect to particular information. Specially, members with high betweenness centrality show similar interests with members of high degree centrality. The members with high betweenness centrality also help expansion of related information by actively commenting on posts. The result of this research emphasizes the necessity of creation and management of network to efficiently convey fashion information by identifying key members with high level of information influence and diffusion to enhance the outcome of online word-of-mouth.

Network Structure and Centrality Analysis of Global Value Chains in Electrical and Electronic Industries (전기·전자산업의 중간재 글로벌가치사슬 네트워크 구조와 중심성 분석)

  • Seog-Min Kim
    • Korea Trade Review
    • /
    • v.46 no.1
    • /
    • pp.113-134
    • /
    • 2021
  • This study analyzed the centrality of the GVCs network and the value-added-based production structure of the electrical and electronic industries using ADB-MIRO and social network analysis methods. According to the analysis, the centrality and power of the GVSc intermediate goods network were differentiated into China, the United States, and the EU due to the advancement of industrial structure in Asia. In the 2000 network, the United States and Japan had a very strong influence in all aspects, including connectivity and strength. However, in 2017, China's power index rose to number one among 62 countries in the network. Furthermore, this study presented strategic implications of the Korean electrical and electronic industries to respond to the reorganization of GVSs based on the analysis results.

An Estimated Closeness Centrality Ranking Algorithm for Large-Scale Workflow Affiliation Networks (대규모 워크플로우 소속성 네트워크를 위한 근접 중심도 랭킹 알고리즘)

  • Lee, Do-kyong;Ahn, Hyun;Kim, Kwang-hoon Pio
    • 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%.

Monitoring social networks based on transformation into categorical data

  • Lee, Joo Weon;Lee, Jaeheon
    • 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.