• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.04a
• /
• pp.333-336
• /
• 2001

본 논문에서는 웹에서 온라인상으로 발생되는 기록 데이터들의 연관 규칙을 구성할 수 있는 효과적인 기법을 제안하고 있다. 기본적으로, 온라인상에서 연관 규칙을 추출하는 방법은 Carma 알고리즘을 바탕으로 하였기 때문에 최대 데이터의 scan 회수를 2회로 유지하였다. 각 사용자가 방문한 웹 사이트의 수에 대하여 정규 분포를 따르는 가중치를 Phase I 알고리즘의 지지도 관련 변수에 영향을 줌으로써, lattice 의 크기를 조절하는 요소로 사용하여 처리 시간을 단축시키고 있다. 기존의 Carma 알고리즘과 제안하는 W-Carma(Weighted-Carma) 알고리즘과 처리 시간을 비교하였으며, 대량의 데이터일 경우 좋은 성능을 보이고 있다.

• Proceedings of the KIEE Conference
• /
• 2008.10b
• /
• pp.247-248
• /
• 2008

본 논문에서는 TYPE-2 퍼지 추론 기반의 RBF 뉴럴 네트워크(TYPE-2 Radial Basis Function Neural Network, T2RBFNN)를 설계하고 PSO(Particle Swarm Optimization) 알고리즘을 이용하여 모델의 파라미터를 동정한다. 제안된 모델의 은닉층은 TYPE-2 가우시안 활성 함수로 구성되며, 출력층은 Interval set 형태의 연결가중치를 갖는다. 여기에서 규칙 전반부 활성함수의 중심 선택은 C-means 클러스터링 알고리즘을 이용하고, 규칙 후반부 Interval set 형태의 연결가중치 결정에는 경사 하강법(Gradient descent method)을 이용한 오류 역전파 알고리즘을 사용하여 학습한다. 또한, 최적의 모델을 설계하기 위한 학습율 및 활성함수의 활성화 영역 결정에는 입자 군집 최적화(PSO; Particle Swarm Optimization) 알고리즘으로 동조한다. 마지막으로, 제안된 모델의 평가를 위하여 모의 데이터 집합(Synthetic dadaset)을 적용하고 근사화 및 일반화 능력에 대하여 토의한다.

• Journal of Digital Contents Society
• /
• v.17 no.5
• /
• pp.359-366
• /
• 2016

In order to provide useful services for user in ubiquitous environment, a technique that can get the helpful information considering user activity and preference is needed and also user's interest actually changes as time passes. Therefore, the discovering method which reflects the concern degree of service information is needed. In this paper, we present the finding method of frequent pattern with dynamic weight on individual item based on service ontology we design. Our method can be applied to provide interested service information for user depending on context.

• The KIPS Transactions:PartB
• /
• v.8B no.6
• /
• pp.625-632
• /
• 2001

The electronic stores have realized that they need to understand their customers and to quickly response their wants and needs. To be successful in increasingly competitive Internet marketplace, recommender systems are adapting data mining techniques. One of most successful recommender technologies is collaborative filtering (CF) algorithm which recommends products to a target customer based on the information of other customers and employ statistical techniques to find a set of customers known as neighbors. However, the application of the systems, however, is not very suitable for seasonal products which are sensitive to time or season such as refrigerator or seasonal clothes. In this paper, we propose a new adjusted item-based recommendation generation algorithms called the exponentially weighted collaborative filtering recommendation (EWCFR) one that computes item-item similarities regarding seasonal products. Finally, we suggest the recommendation system with relatively high quality computing time on main memory database (MMDB) in XML since the collaborative filtering systems are needed that can quickly produce high quality recommendations with very large-scale problems.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2011.06a
• /
• pp.218-219
• /
• 2011

This paper focuses on dispatching strategy for AGVs(Automated Guided Vehicle). The goal of AGV dispatching problem is allocating jobs to AGVs to minimizing QC delay and AGV total travel distance. Due to the highly dynamic nature of container terminal environment, the effect of dispatching is hard to predict thus it leads to frequent modification of dispatching results. Given this situation, single rule-based approach is widely used due to its simplicity and small computational cost. However, single rule-based approach has a limitation that cannot guarantee a satisfactory performance for the various performance measures. In this paper, dispatching strategy based on multicriteria heuristics is proposed. Proposed strategy consists of multiple decision criteria. A muti-objective evolutionary algorithm is applied to optimize weights of those criteria. The result of simulation experiment shows that the proposed approach outperforms single rule-based dispatching approaches.

• Journal of Navigation and Port Research
• /
• v.35 no.6
• /
• pp.501-507
• /
• 2011

This paper focuses on dispatching strategy for AGVs(Automated Guided Vehicle). The goal of AGV dispatching is assigning AGVs to requested job to minimizing the delay of QCs and the travel distance of AGVs. Due to the high dynamic nature of container terminal environment, the effect of dispatching is hard to predict thus it leads to frequent modification of dispatching decisions. In this situation, approaches based on a single rule are widely used due to its simplicity and small computational cost. However, these approaches have a limitation that cannot guarantee a satisfactory performance for the various performance measures. In this paper, dispatching strategy based on multicriteria heuristics is proposed. The Proposed strategy consists of multiple decision criteria. A multi-objective evolutionary algorithm is applied to optimize weights of those criteria. The result of simulation experiment shows that the proposed approach outperforms single rule-based dispatching approaches.

• The Journal of the Korea Contents Association
• /
• v.8 no.1
• /
• pp.282-289
• /
• 2008

Although there were some technological developments in improving the collaborative filtering, they have yet to fully reflect the actual relation of the items. In this paper, we propose the recommendation system using associative web document classification by word frequency and ${\alpha}$-cut to address the short comings of the collaborative filtering. The proposed method extracts words from web documents through the morpheme analysis and accumulates the weight of term frequency. It makes associative rules and applies the weight of term frequency to its confidence by using Apriori algorithm. And it calculates the similarity among the words using the hypergraph partition. Lastly, it classifies related web document by using ${\alpha}$-cut and calculates similarity by using adjusted cosine similarity. The results show that the proposed method significantly outperforms the existing methods.

• The Journal of Bigdata
• /
• v.7 no.1
• /
• pp.75-87
• /
• 2022

This study investigates a dynamic flexible flow shop scheduling problem under uncertain rework operations for an automobile pipe production line. We propose a weighted dispatching rule (WDR) based on the multiple dispatching rules to minimize the weighted sum of average flowtime and tardiness. The set of weights in WDR should be carefully determined because it significantly affects the performance measures. We build a discrete-event simulation model and propose a genetic algorithm to optimize the set of weights considering complex and variant operations. The simulation experiments demonstrate that WDR outperforms the baseline dispatching rules in average flowtime and tardiness.

• Journal of KIISE
• /
• v.45 no.1
• /
• pp.22-29
• /
• 2018

Over the decades, neural networks have been successfully used in numerous applications from speech recognition to image classification. However, these neural networks cannot explain their results and one needs to know how and why a specific conclusion was drawn. Most studies focus on extracting binary rules from neural networks, which is often impractical to do, since data sets used for machine learning applications contain continuous values. To fill the gap, this paper presents an algorithm to extract logic rules from a trained neural network for data with continuous attributes. It uses hyperplane-based linear classifiers to extract rules with numeric values from trained weights between input and hidden layers and then combines these classifiers with binary rules learned from hidden and output layers to form non-linear classification rules. Experiments with different datasets show that the proposed approach can accurately extract logical rules for data with nonlinear continuous attributes.

• Journal of Korea Multimedia Society
• /
• v.3 no.2
• /
• pp.201-208
• /
• 2000

In this paper We describe an algorithm which is devised for 4he partition o# the input space and the generation of fuzzy rules by the fuzzy entropy and tested with the time series prediction problem using Mackey-Glass chaotic time series. This method divides the input space into several fuzzy regions and assigns a degree of each of the generated rules for the partitioned subspaces from the given data using the Shannon function and fuzzy entropy function generating the optimal knowledge base without the irrelevant rules. In this scheme the basic idea of the fuzzy neural network is to realize the fuzzy rules base and the process of reasoning by neural network and to make the corresponding parameters of the fuzzy control rules be adapted by the steepest descent algorithm. The Proposed algorithm has been naturally derived by means of the synergistic combination of the approximative approach and the descriptive approach. Each output of the rule's consequences has expressed with its connection weights in order to minimize the system parameters and reduce its complexities.