• 정보학연구
• /
• 제9권3호
• /
• pp.27-32
• /
• 2006

If is interested and create rule between it in item that association rules buys, by negative association rules is interested to item that do not buy, it is attempt to do data Maining more effectively. It is difficult that existent methods to find negative association rules find one part of rule, or negative association rules because use more complicated algorithm than algorithm that find association rules. Therefore, this paper presents method to create negative association rules by simpler process using Boolean Analyzer that use dependency between items. And as Boolean Analyzer through an experiment, show that can find negative association rules and more various rule through comparison with other algorithm.

• 한국중재학회지:중재연구
• /
• 제29권2호
• /
• pp.133-159
• /
• 2019

This paper reviews 2019 new arbitration rules of Japan Commercial Arbitration Association (JCAA). JCAA has amended its Commercial Arbitration Rules, and its Administrative Rules for UNCITRAL Arbitration. Also, it has introduced a new Interactive Arbitrations Rules. These new rules take effect from 1 January 2019. First, principal amendments of JCAA Commercial Arbitration Rules are such as arbitrator impartiality, tribunal secretaries, no dissenting opinions, expedited proceedings, arbitrator fees, administrative fees. Second, JCAA's new Interactive Arbitration Rules compel communication from the arbitral tribunal to the Parties and introduce a system of fixed compensation for arbitrators. Third, JCAA's Administrative Rules for UNCITRAL Arbitration are designed to provide the minimum essentials to allow the UNCITRAL Rules to be overseen by an institution. The only significant updates focus on arbitrator remuneration. This paper presents the intent and some implications of JACC's 2019 new rules for Korean Commercial Arbitration Board (KCAB) arbitration rules. Also, it seeks to provide a meaningful discussion and improvement on the facilitating of arbitration system in Korea.

• Journal of the Korean Data and Information Science Society
• /
• 제17권4호
• /
• pp.1077-1083
• /
• 2006

Association rule mining searches for interesting relationships among items in a given database. Association rules are frequently used by retail stores to assist in marketing, advertising, floor placement, and inventory control. There are three primary quality measures for association rule, support and confidence and lift. In this paper we present association rule mining based antecedent variables. We call these rules to antecedent association rules. An antecedent variable is a variable that occurs before the independent variable and the dependent variable.

• 한국데이터정보과학회:학술대회논문집
• /
• 한국데이터정보과학회 2005년도 추계학술대회
• /
• pp.177-188
• /
• 2005

Association rule mining searches for interesting relationships among items in a given large data set. Association rules are frequently used by retail stores to assist in marketing, advertising, floor placement, and inventory control. There are three primary threshold measures in association rule; support and confidence and lift. In the case of appling real world to association rules, we have some difficulties in data interpretation because we obtain many rules. In this paper, we develop the model of association rules using latent variables for environmental survey data.

• Journal of the Korean Data and Information Science Society
• /
• 제17권1호
• /
• pp.149-160
• /
• 2006

Association rule mining searches for interesting relationships among items in a given large data set. Association rules are frequently used by retail stores to assist in marketing, advertising, floor placement, and inventory control. There are three primary threshold measures in association rule; support and confidence and lift. In the case of appling real world to association rules, we have some difficulties in data interpretation because we obtain many rules. In this paper, we develop the model of association rules using latent variables for environmental survey data.

• 한국산학기술학회:학술대회논문집
• /
• 한국산학기술학회 2003년도 Proceeding
• /
• pp.149-154
• /
• 2003

Credit scoring system (CSS) starts from an analysis of delinquency trend of each individual or industry. This paper conducts a research on credit card delinquency of bank customers as a preliminary step for building effective credit scoring system to prevent excess loan or bad credit status. To serve this purpose, we use association rules that ore generating method. Specifically, we generate sets of rules of customers who are in bad credit status because of delinquency by using association rules. We expect that the sets of rules generated by association rules could act as an estimator of good or bad credit status classifier.

• 한국항만경제학회지
• /
• 제18권1호
• /
• pp.27-41
• /
• 2002

This paper deals with the development of a simulation model for the container terminal, which consists of 3 berths, 8 container cranes, and 16 yard blocks with each yard crane and 90 yard trucks in order to evaluate the various operational rules. The proposed operational rules are 3 ship-dispatching rules, 3 berth allocation rules, 2 crane allocation rules, 2 yard allocation rules, and 2 yard truck allocation rules. These rules are simulated using 4 performance measures, such as ship time in the terminal, ship time in the port, the number of ships processed, and the number of containers handled. The simulation result is as follows: 1) there is no difference among 3 ship-dispatching rules, 2) berth allocation rules depend on performance measures, 3) dynamic crane allocation is better than fixed policy, 4) pooling yard allocation is better than short distance yard allocation rules, and 5) fixed yard truck allocation by berth is a little better than pooling policy.

• 한국산업정보학회:학술대회논문집
• /
• 한국산업정보학회 2007년도 춘계학술대회
• /
• pp.61-71
• /
• 2007

The Association Rules is the most important method in technology of the data mining. This text further study The Association Rules, has analyzed and commented to Apriori algorithm of The Association Rules. Have realized Apriori algorithm base on Visual Basic 6.0, probe into Apriori algorithm application among the digital library, show with experimental data of application of Association Rules in borrow in the data analysis in readers finally.

• 한국정보과학회논문지:데이타베이스
• /
• 제35권2호
• /
• pp.97-111
• /
• 2008

상용 데이타 마이닝 도구에서는 기본적으로 이진 속성에 대한 연관규칙 마이닝만을 지원한다. 그러나, 일반적인 트랜잭션 데이타베이스는 이진 속성 뿐 아니라 정량적 속성을 포함한다. 이에 따라, 본 논문에서는 상용 데이타 마이닝 도구를 사용하여 정량적 연관규칙을 마이닝하는 체계적인 접근법을 제안한다. 이를 위해, 우선 상용 데이타 마이닝 도구를 사용하여 정량적 연관규칙을 찾아내기 위한 전체적인 프레임워크를 제안한다. 제안한 프레임워크는 정량적 속성을 이진 속성으로 변환하는 전처리 과정과 마이닝된 이진 연관규칙을 다시 정량적 연관규칙으로 변환하는 후처리 과정으로 구성된다. 다음으로, 전처리 과정을 위한 구간 분할의 개념을 제시하고, 기존의 평균 및 중앙치 기반 양분할 기법과 동일 너비 및 동일 깊이 기반 다분할 기법을 구간 분할의 개념으로 정형적으로 재정의한다. 그런데, 이들 기존 분할 기법은 속성 값의 분포를 고려하지 않은 문제점이 있다. 본 논문에서는 이를 해결하기 위하여 표준편차 최소화 기법을 제안한다. 표준편차 최소화 기법은 이웃한 속성 값의 표준편차 변화가 작다면 동일한 구간에 포함시키고, 표준편차 변화가 크다면 다른 구간으로 분할하는 매우 직관적인 분할 기법이다. 또한, 후처리 과정으로는 이진 연관규칙들을 통합하고 이를 다시 정량적 연관규칙으로 변환하는 방법을 제안한다. 마지막으로, 다양한 실험을 통하여 제안한 프레임워크가 바르게 동작함을 보이고, 표준편차 최소화 기법이 다른 기법에 비하여 우수함을 입증한다. 이 같은 결과를 볼 때, 제안한 프레임워크는 일반 사용자가 상용 데이타 마아닝 도구를 사용하여 정량적 연간규칙을 쉽게 마이닝 할 수 있는 매우 실용적인 접근법이라 생각한다.

• Journal of Information Processing Systems
• /
• 제4권1호
• /
• pp.27-32
• /
• 2008

Minimum support and confidence have been used as criteria for generating association rules in all association rule mining algorithms. These criteria have their natural appeals, such as simplicity; few researchers have suspected the quality of generated rules. In this paper, we examine the rules from a more rigorous point of view by conducting statistical tests. Specifically, we use contingency tables and chi-square test to analyze the data. Experimental results show that one third of the association rules derived based on the support and confidence criteria are not significant, that is, the antecedent and consequent of the rules are not correlated. It indicates that minimum support and minimum confidence do not provide adequate discovery of meaningful associations. The chi-square test can be considered as an enhancement or an alternative solution.