• Journal of Korea Entertainment Industry Association
• /
• v.14 no.6
• /
• pp.139-150
• /
• 2020

The data processing of this study focuses on the textom and social media words about three areas: 'Corona 19 and professional baseball', 'Corona 19 and professional baseball', and 'Corona 19 and professional sports' The data was collected and refined in a web environment and then processed in batch, and the Ucinet6 program was used to visualize it. Specifically, the web environment was collected using Naver, Daum, and Google's channels, and was summarized into 30 words through expert meetings among the extracted words and used in the final study. 30 extracted words were visualized through a matrix, and a CONCOR analysis was performed to identify clusters of similarity and commonality of words. As a result of analysis, the clusters related to Corona 19 and Pro Baseball were composed of one central cluster and five peripheral clusters, and it was found that the contents related to the opening of professional baseball according to the corona 19 wave were mainly searched. The cluster related to Corona 19 and unrelated to professional baseball consisted of one central cluster and five peripheral clusters, and it was found that the keyword of the position of professional baseball related to the professional baseball game according to Corona 19 was mainly searched. Corona 19 and the cluster related to professional sports consisted of one central cluster and five peripheral clusters, and it was found that the keywords related to the start of professional sports according to the aftermath of Corona 19 were mainly searched.

• The Journal of the Korea Contents Association
• /
• v.21 no.4
• /
• pp.434-446
• /
• 2021

Recently, there has been a growing interest in the fourth industrial revolution, expected to have a significant impact on society. However, there are only a few studies on spatial distribution and location of the fourth industry. This study tried to classify the spatial distribution of the fourth industry by using LQ, a non-geographical method, and Getis-Ord's Gi^*, a geographical method. The results of the analysis are as follows. First, there are the specialized areas of the fourth industry in the non-Seoul metropolitan area as well as the Seoul metropolitan area. Second, industrial clusters and neighborhood areas of the fourth industry were located mostly in the Seoul metropolitan area. Third, industrial clusters were concentrated on the southern part of Gyeonggi Province and Seoul, and there are no industrial clusters in the northern part of the Seoul metropolitan area and the nature conservation area. This paper shows that the cluster area of the fourth industry is concentrated in the Seoul metropolitan area. Therefore, policies for the 4th industry are needed to solve this unbalanced spatial distribution of the fourth industry.

• Journal of the Korean Society of Industry Convergence
• /
• v.19 no.4
• /
• pp.167-175
• /
• 2016

We present a method for improving adaptability of Learning from Demonstration (LfD) strategy by combining the LfD and Particle Swarm Optimization (PSO). A trajectory generated from an LfD is modified with PSO by minimizing a fitness function that considers constraints. Finally, the final trajectory is suitable for a task and adapted for constraints. The effectiveness of the method is shown with a target reaching task with a manipulator in three-dimensional space.

• IE interfaces
• /
• v.15 no.2
• /
• pp.182-188
• /
• 2002

Clustering is widely used in various fields in order to investigate structural characteristics of the given data. One of the main tasks of clustering is to partition a set of objects into homogeneous groups for the purpose of data reduction. In this paper a simple but computationally efficient clustering procedure is devised and some statistical techniques to validate its clustered results are discussed. In the given procedure, the proper number of clusters and the clustered groups can be determined simultaneously. The whole procedure is applied to a practical clustering problem for the classification of reusable fuels in nuclear power plants.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.4
• /
• pp.447-456
• /
• 2007

The ant colony optimization (ACO) is a probabilistic Meta-heuristic algorithm which has been developed in recent years. Originally ACO was used for solving the well-known Traveling Salesperson Problem. More recently, ACO has been used to solve many difficult problems. In this paper, we develop an ant colony optimization method to solve the maximum independent set problem, which is known to be NP-hard. In this paper, we suggest a new method for local information of ACO. Parameters of the ACO algorithm are tuned by evolutionary operations which have been used in forecasting and time series analysis. To show the performance of the ACO algorithm, the set of instances from discrete mathematics and computer science (DIMACS)benchmark graphs are tested, and computational results are compared with a previously developed ACO algorithm and other heuristic algorithms.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.37 no.3
• /
• pp.89-98
• /
• 2014

Platform-based product family design is recognized as an effective method to satisfy the mass customization which is a current market trend. In order to design platform-based product family successfully, it is the key work to define a good product platform, which is to identify the common modules that will be shared among the product family. In this paper the clustering analysis using dendrogram is proposed to capture the common modules of the platform. The clustering variables regarding both marketing and engineering sides are derived from the view point of top-down product development. A case study of a cordless drill/drive product family is presented to illustrate the feasibility and validity of the overall procedure developed in this research.

• Journal of Korean Institute of Industrial Engineers
• /
• v.35 no.2
• /
• pp.160-170
• /
• 2009

This paper studies a vehicle routing problem variant which considers customers to require simultaneous delivery and pick-up under time windows(VRPSDP-TW). The objective of this paper is to minimize the total travel distance of routes that satisfy both the delivery and pick-up demand. We propose a heuristic algorithm for solving the VRPSDP-TW, based on the ant colony system(ACS). In route construction, an insertion algorithm based ACS is applied and the interim solution is improved by local search. Through iterative processes, the heuristic algorithm drives the best solution. Experiments are implemented to evaluate a performance of the algorithm on some test instances from literature.

• Journal of Korean Institute of Industrial Engineers
• /
• v.34 no.4
• /
• pp.460-469
• /
• 2008

Process mining aims at mining valuable information from process execution results (called "event logs"). Even though process mining techniques have proven to be a valuable tool, the mining results from real process logs are usually too complex to interpret. The main cause that leads to complex models is the diversity of process logs. To address this issue, this paper proposes a trace clustering approach that splits a process log into homogeneous subsets and applies existing process mining techniques to each subset. Based on log profiles from a process log, the approach uses existing clustering techniques to derive clusters. Our approach are implemented in ProM framework. To illustrate this, a real-life case study is also presented.

• IE interfaces
• /
• v.21 no.3
• /
• pp.254-261
• /
• 2008

Connected-(r,s)-out of-(m,n) : F system is an important topic in redundancy design of the complex system reliability and it's maintenance policy. Previous studies applied Monte Carlo simulation and genetic, simulated annealing algorithms to tackle the difficulty of maintenance policy problem. These algorithms suggested most suitable maintenance cycle to optimize maintenance pattern of connected-(r,s)-out of-(m,n) : F system. However, genetic algorithm is required long execution time relatively and simulated annealing has improved computational time but rather poor solutions. In this paper, we propose the ant colony optimization approach for connected-(r,s)-out of-(m,n) : F system that determines maintenance cycle and minimum unit cost. Computational results prove that ant colony optimization algorithm is superior to genetic algorithm, simulated annealing and tabu search in both execution time and quality of solution.

• Journal of Korean Institute of Industrial Engineers
• /
• v.29 no.1
• /
• pp.90-99
• /
• 2003

Object clustering, which makes classification for a set of objects into a number of groups such that objects included in a group have similar characteristic and objects in different groups have dissimilar characteristic each other, has been exploited in diverse area such as information retrieval, data mining, group technology, etc. In this study, an object-clustering problem with similarity coefficients between objects is considered. At first, an evaluation function for the optimization problem is defined. Then, a genetic algorithm and local optimization technique based on heuristic method are proposed and used in order to obtain near optimal solutions. Solutions from the genetic algorithm are improved by local optimization techniques based on object relocation and cluster merging. Throughout extensive experiments, the validity and effectiveness of the proposed algorithms are tested.