• The Journal of the Korea Contents Association
• /
• v.17 no.6
• /
• pp.153-168
• /
• 2017

Existing researches on movie genre have been focusing on the relationship between a specific genre and performance of a movie. However, most of films cross into multiple genres and new approach is needed for analyzing a genre network. In this study social network analysis was used to analyze the genre centrality and its relationship with movie performance by developing a genre network, i.e. network among multiple genres constructed via genre co-occurrence pattern in a specific movie. Three index of genre centrality, eigenvector centrality, degree centrality, and bonacich power centrality, were tested for the valued genre network. Results showed that the relationship between genre centrality and movie performance appeared to be inverted U-shaped. This empirical finding is in line with the theory of ambidexterity which emphasizes the balance of exploration and exploitation. In addition, this study can provide practical implications for movie producers, distributors, and theaters that need to develop genre strategies.

• Culinary science and hospitality research
• /
• v.23 no.3
• /
• pp.257-270
• /
• 2017

The purpose of this study was to visualize the semantic network with big data related to food exhibition at convention center. For this, this study collected data containing 'coex food exhibition/bexco food exhibition' keywords from web pages and news on Google during one year from January 1 to December 31, 2016. Data were collected by using TEXTOM, a data collecting and processing program. From those data, degree centrality, closeness centrality, betweenness centrality and eigenvector centrality were analyzed by utilizing packaged NetDraw along with UCINET 6. The result showed that the web visibility of hospitality and destinations was high. In addition, the web visibility was also high for convention center programs, such as festival, exhibition, k-pop and event; hospitality related words, such as tourists, service, hotel, cruise, cuisine, travel. Convergence of iterated correlations showed 4 clustered named "Coex", "Bexco", "Nations" and "Hospitality". It is expected that this diagnosis on food exhibition at convention center according to changes in domestic environment by using these web information will be a foundation of baseline data useful for establishing convention marketing strategies.

• Fashion & Textile Research Journal
• /
• v.20 no.5
• /
• pp.533-547
• /
• 2018

The objective of this study is to examine the perception of golfwear and related trends based on major keywords and associated words related to golfwear utilizing big data. For this study, the data was collected from blogs, Jisikin and Tips, news articles, and web $caf{\acute{e}}$ from two of the most commonly used search engines (Naver & Daum) containing the keywords, 'Golfwear' and 'Golf clothes'. For data collection, frequency and matrix data were extracted through Textom, from January 1, 2016 to December 31, 2017. From the matrix created by Textom, Degree centrality, Closeness centrality, Betweenness centrality, and Eigenvector centrality were calculated and analyzed by utilizing Netminer 4.0. As a result of analysis, it was found that the keyword 'brand' showed the highest rank in web visibility followed by 'woman', 'size', 'man', 'fashion', 'sports', 'price', 'store', 'discount', 'equipment' in the top 10 frequency rankings. For centrality calculations, only the top 30 keywords were included because the density was extremely high due to high frequency of the co-occurring keywords. The results of centrality calculations showed that the keywords on top of the rankings were similar to the frequency of the raw data. When the frequency was adjusted by subtracting 100 and 500 words, it showed different results as the low-ranking keywords such as J. Lindberg in the frequency analysis ranked high along with changes in the rankings of all centrality calculations. Such findings of this study will provide basis for marketing strategies and ways to increase awareness and web visibility for Golfwear brands.

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

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

• Culinary science and hospitality research
• /
• v.24 no.2
• /
• pp.34-43
• /
• 2018

The objective of this study was to acquire a general and text-based awareness and recognition of cruise food hygiene through big data analytics. For the purpose, this study collected data with conducting the keyword "food hygiene, cruise" on the web pages and news on Google, during October 1st, 2015 to October 1st, 2017 (two years). The data collection was processed by SCTM which is a data collecting and processing program and eventually, 899 kb, approximately 20,000 words were collected. For the data analysis, UCINET 6.0 packaged with visualization tool-Netdraw was utilized. As a result of the data analysis, the words such as jobs, news, showed the high frequency while the results of centrality (Freeman's degree centrality and Eigenvector centrality) and proximity indicated the distinct rank with the frequency. Meanwhile, as for the result of CONCOR analysis, 4 segmentations were created as "food hygiene group", "person group", "location related group" and "brand group". The diagnosis of this study for the food hygiene in cruise industry through big data is expected to provide instrumental implications both for academia research and empirical application.

• The Research Journal of the Costume Culture
• /
• v.27 no.3
• /
• pp.274-284
• /
• 2019

Research on cosmetic behavior has developed significantly since the 2000s. Reviewing cosmetic behavior research can be meaningful because it can grasp trends in the domestic cosmetics market, and it can also illuminate how domestic consumers' interest in makeup has changed over time. The purpose of this study is to investigate the links between major keywords and the keywords which affect makeup behavior of different age groups through network analysis. In this study we analyzed thesis and journal data based on makeup behavior through network analysis using Nodexl. We analyzed 10 years of journals and theses - from 2000 to 2017, and investigated age-related differences in variables related to makeup behavior. Research subjects were divided into age-based groups: 10, 20-40, and over 50. The total number of theses collected was 82. In order to perform network analysis using the Nodexl program, we extracted the frequency of representative words using the KrKwic program. The extracted core words were analyzed for degree centrality, betweenness centrality and eigenvector centrality using Nodexl. The expected result is that the network analysis using keywords will lead to different variables depending on age and the main goal of the cosmetics market, and it is expected to be used as the basis for follow-up research related to cosmetic behavior.

• Journal of Information Technology Services
• /
• v.22 no.1
• /
• pp.57-74
• /
• 2023

It has been pointed out as a limitation that the rank of some efficient DMUs(decision making units) cannot be discriminated due to the relativity nature of efficiency measured by DEA(data envelopment analysis), comparing the production structure. Recently, to solve this problem, a DEA-SNA(social network analysis) model that combines SNA techniques with data envelopment analysis has been studied intensively. Several models have been proposed using techniques such as eigenvector centrality, pagerank centrality, and hypertext induced topic selection(HITS) algorithm, but DMUs that cannot be ranked still remain. Moreover, in the process of extracting latent information within the DMU group to build effective network, a problem that violates the basic assumptions of the DEA also arises. This study is meaningful in finding the cause of the limitations by comparing and analyzing the characteristics of the DEA-SNA model proposed so far, and based on this, suggesting the direction and possibility to develop more advanced model. Through the results of this study, it will be enable to further expand the field of research related to DEA.

• Asia pacific journal of information systems
• /
• v.29 no.3
• /
• pp.448-467
• /
• 2019

In a new age of smart tourism, free independent travelers (FITs) choose their travel routes in a more diversified and less predictable way with the aid of smart services. This paper focuses on the movements of Chinese outbound FITs in the U.S. in the year of 2018. 110 places to visit (destinations) extracted from 122 travel routes recommendations on Qyer.com, a major online travel community in China, are analyzed with social network analysis (SNA). Based on the results of SNA, employing degree centrality, eigenvector centrality, betweenness centrality, network visualization, and cluster diagram methods, some preferred cities and natural attractions outside city centers (i.e., New York City (NYC), Los Angeles, San Francisco, Washington D.C., and Niagara Falls) are identified. Moreover, it is found that NYC in the East and Los Angeles in the West play a major role in the movements of Chinese FITs. This study contributes to the body of knowledge on tourist destination movements and provides valuable implications for smart service development in the tourism and hospitality industry.

• Journal of Intelligence and Information Systems
• /
• v.27 no.1
• /
• pp.23-46
• /
• 2021

Collaborative filtering, which is often used in personalization recommendations, is recognized as a very useful technique to find similar customers and recommend products to them based on their purchase history. However, the traditional collaborative filtering technique has raised the question of having difficulty calculating the similarity for new customers or products due to the method of calculating similaritiesbased on direct connections and common features among customers. For this reason, a hybrid technique was designed to use content-based filtering techniques together. On the one hand, efforts have been made to solve these problems by applying the structural characteristics of social networks. This applies a method of indirectly calculating similarities through their similar customers placed between them. This means creating a customer's network based on purchasing data and calculating the similarity between the two based on the features of the network that indirectly connects the two customers within this network. Such similarity can be used as a measure to predict whether the target customer accepts recommendations. The centrality metrics of networks can be utilized for the calculation of these similarities. Different centrality metrics have important implications in that they may have different effects on recommended performance. In this study, furthermore, the effect of these centrality metrics on the performance of recommendation may vary depending on recommender algorithms. In addition, recommendation techniques using network analysis can be expected to contribute to increasing recommendation performance even if they apply not only to new customers or products but also to entire customers or products. By considering a customer's purchase of an item as a link generated between the customer and the item on the network, the prediction of user acceptance of recommendation is solved as a prediction of whether a new link will be created between them. As the classification models fit the purpose of solving the binary problem of whether the link is engaged or not, decision tree, k-nearest neighbors (KNN), logistic regression, artificial neural network, and support vector machine (SVM) are selected in the research. The data for performance evaluation used order data collected from an online shopping mall over four years and two months. Among them, the previous three years and eight months constitute social networks composed of and the experiment was conducted by organizing the data collected into the social network. The next four months' records were used to train and evaluate recommender models. Experiments with the centrality metrics applied to each model show that the recommendation acceptance rates of the centrality metrics are different for each algorithm at a meaningful level. In this work, we analyzed only four commonly used centrality metrics: degree centrality, betweenness centrality, closeness centrality, and eigenvector centrality. Eigenvector centrality records the lowest performance in all models except support vector machines. Closeness centrality and betweenness centrality show similar performance across all models. Degree centrality ranking moderate across overall models while betweenness centrality always ranking higher than degree centrality. Finally, closeness centrality is characterized by distinct differences in performance according to the model. It ranks first in logistic regression, artificial neural network, and decision tree withnumerically high performance. However, it only records very low rankings in support vector machine and K-neighborhood with low-performance levels. As the experiment results reveal, in a classification model, network centrality metrics over a subnetwork that connects the two nodes can effectively predict the connectivity between two nodes in a social network. Furthermore, each metric has a different performance depending on the classification model type. This result implies that choosing appropriate metrics for each algorithm can lead to achieving higher recommendation performance. In general, betweenness centrality can guarantee a high level of performance in any model. It would be possible to consider the introduction of proximity centrality to obtain higher performance for certain models.