• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2007년도 춘계학술발표대회
• /
• pp.443-446
• /
• 2007

A new association rule mining algorithm, which reflects the strategic importance of associative relationships between items, was developed and presented in this paper. This algorithm exploits the basic framework of Apriori procedures and TSAA(transitive support association Apriori) procedure developed by Hyun and Choi in evaluating non-frequent itemsets. The algorithm considers the strategic importance(weight) of feature variables in the association rule mining process. Sample feature variables of strategic importance include: profitability, marketing value, customer satisfaction, and frequency. A database with 730 transaction data set of a large scale discount store was used to compare and verify the performance of the presented algorithm against the existing Apriori and TSAA algorithms. The result clearly indicated that the new algorithm produced substantially different association itemsets according to the weights assigned to the strategic feature variables.

• 산업공학
• /
• 제16권2호
• /
• pp.117-124
• /
• 2003

This study focuses on the detailed explanation of the strategic allocation algorithm which can be used as an ATP(Available To Promise) from the perspective of customers, and as a sales plan for sales organizations. A strategic allocation algorithm includes three methods depending on FIXED RATIO, RANK and DEMAND BASIS. In addition, further topics would be discussed regarding the method of system implementation utilizing strategic allocation algorithms and information flow with an aim to integrate such a sales plan into the e-Biz. This study aims to provide a new solution in order to secure emerging competitive factors in today's enterprise world; that is, an achievement of faster business processes. It is suggested that this new solution be implemented in order to achieve an efficient business environment by systemizing the decision making process which in the past was manually conducted.

• 정보처리학회논문지D
• /
• 제17D권4호
• /
• pp.311-316
• /
• 2010

본 논문은 가중치를 고려한 연관규칙탐사 알고리즘(WARM)을 제시한다. 각 전략적 요소항목에 가중치를 부여하는 것과, 각 전략요소 항목별로 원시 자료값을 정규화하는 것이 이 논문에서 제시하는 알고리즘의 중요한 내용을 구성하고 있다. 본 논문은 TSAA 알고리즘을 확장 발전 시킨 연구로서 전략적 중요도를 반영하는 항목으로는 각 품목의 이익기여도, 마케팅 가치, 고객만족도 등을 사용하였다. 한 대형할인점의 실제 거래자료를 사용하여 알고리즘의 성능을 검사하였으며, Apriori, TSAA 및 WARM의 세 가지 알고리즘을 사용한 탐사결과를 비교 분석하였다. 분석의 결과 세 가지 알고리즘은 연관분석 행태에 있어서 각각 독특한 탐사행태를 보이는 것으로 나타났다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.330-330
• /
• 2000

In this paper, as an entertainment robot the implementation of boxing robot system is presented for mechatronics education. In order for students to learn robot as a mechatronics system, boxing robot is a good model. The boxing robot consists of three parts: two link arms for punching, controller for actuating wheeled mobile robot, infrared rays sensors for the detection of he other robot and ring. The strategic algorithm for playing boxing is presented as wel as simple game rules.

• 한국항해항만학회지
• /
• 제37권3호
• /
• pp.321-327
• /
• 2013

As the market of express delivery services expands rapidly, delivery service companies are exposed to severe competition. As a result of the surplus of delivery companies, they are struggling with remaining competitive at a reasonable price with appropriate level of customer satisfaction. To cope with competition pressures, a strategic alliance is suggested as an effective solution to the challenges faced by small and medium enterprises (SMEs) in express delivery services. Therefore, this study suggests a combined optimization and simulation approach to the reconfiguration of an express delivery service network for strategic alliance with respect to strategy partnership of closing/keeping service centers among companies involved and adjustments of their cutoff times. An illustrative numerical example is presented to demonstrate the practicality and efficiency of the approach.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2005년도 추계종합학술대회
• /
• pp.495-498
• /
• 2005

본 연구에서는 전략적 마케팅을 위한 지능형 인터넷 쇼핑몰을 설계하고 구현하기 위해 고객들의 접속 기록과 상품 구매 기록 및 신상정보를 데이터마이닝 기법에 의해 통계적으로 분석하고 고객을 세분화하여, 고객이 상품에 대한 인기도에 따라 상품 진열을 자동적으로 구성할 수 있는 알고리즘 향상에 관한 연구이다. 본 시스템을 통하여 쇼핑몰 관리자의 주관적인 판단에 의해 수작업으로 이루어지는 기존의 쇼핑몰 관리 업무를 자동화 할 수 있으며, 또한 최근에 급격하게 증가하고 있는 전자상거래 시장에서 경쟁력을 강화할 수 있는 새로운 형태의 마케팅 기법을 제시할 수 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권2호
• /
• pp.577-594
• /
• 2020

Service Function Chaining (SFC) supports services through linking an ordered list of functions. There may be multiple instances of the same function, which provides a challenge to select available instances for all the functions in an SFC and generate a specific Service Function Path (SFP). Aiming to solve the problem of SFP selection, we propose an architecture consisting of distributed SFP algorithm and central control mechanism. Nodes generate distributed routings based on the first function and destination node in each service request. Controller supervises all of the distributed routing tables and modifies paths as required. The architecture is scalable, robust and quickly reacts to failures because of distributed routings. Besides, it enables centralized and direct control of the forwarding behavior with the help of central control mechanism. Simulation results show that distributed routing tables can generate efficient SFP and the average cost is acceptable. Compared with other algorithms, our design has a good performance on average cost of paths and load balancing, and the response delay to service requests is much lower.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권4호
• /
• pp.1128-1145
• /
• 2022

Owing to the rapid development of information science, data analysis based on machine learning has become an interdisciplinary and strategic area. Marine predators algorithm (MPA) is a novel metaheuristic algorithm inspired by the foraging strategies of marine organisms. Considering the randomness of these strategies, an improved algorithm called co-evolutionary cultural mechanism-based marine predators algorithm (CECMPA) is proposed. Through this mechanism, search agents in different spaces can share knowledge and experience to improve the performance of the native algorithm. More specifically, CECMPA has a higher probability of avoiding local optimum and can search the global optimum quickly. In this paper, it is the first to use CECMPA to perform feature subset selection and optimize hyperparameters in support vector machine (SVM) simultaneously. For performance evaluation the proposed method, it is tested on twelve datasets from the university of California Irvine (UCI) repository. Moreover, the coronavirus disease 2019 (COVID-19) can be a real-world application and is spreading in many countries. CECMPA is also applied to a COVID-19 dataset. The experimental results and statistical analysis demonstrate that CECMPA is superior to other compared methods in the literature in terms of several evaluation metrics. The proposed method has strong competitive abilities and promising prospects.

• 한국게임학회 논문지
• /
• 제16권4호
• /
• pp.79-86
• /
• 2016

몬테카를로 트리탐색은 최대우선탐색 알고리즘이며, 많은 게임 특히 바둑 게임에 성공적으로 적용되어 왔다. 삼목 게임에서 MCTS 간의 대국을 통해 성능을 평가하고자 했다. 첫 번째 대국자는 항상 두 번째 대국자에 비해 압도적인 우위를 보였으며, 최선의 게임 결과가 무승부가 됨에도 불구하고 첫 번째 대국자가 두 번째 대국자에 비해 우월한 이유를 찾고자 했다. MCTS는 반복적인 무작위 샘플링을 기반으로 하는 통계적 알고리즘이기 때문에, 특히 두 번째 대국자를 위해 전략을 요하는 시급한 문제를 적절히 대처하지 못한다. 이를 위해 전략적 MCTS(S-MCTS)를 제안하며, S-MCTS는 결코 삼목 게임에서 지지 않는다는 것을 보였다.

• 제어로봇시스템학회논문지
• /
• 제11권4호
• /
• pp.322-329
• /
• 2005

This paper considers the application of mobile robot to the herding problem. The herding problem involves a ‘pursuer’ trying to herd a moving ‘evader’ to a predefined location. In this paper, two mobile robots act as pursuer and evader in the fenced area, where the pursuer robot uses a fuzzy cooperative decision strategy (FCDS) in the herding algorithm. To herd evader robot to a predefined position, the pursuer robot calculates strategic herding point and then navigates to that point using FCDS. FCDS consists of a two-level hierarchy: low level motion descriptors and a high level coordinator. In order to optimize the FCDS, we use the multi­thread evolutionary programming algorithm. The proposed algorithm is implemented in the real mobile robot system and its performance is demonstrated using experimental results.