• Title, Summary, Keyword: Association rules

Search Result 1,158, Processing Time 0.054 seconds

Association Rules and Application Study in The Digital Library

  • Yu, Jian-Kun;Zeng, Zhi-Yong;Zhang, Wen-Bin
    • Proceedings of the Korea Society for Industrial Systems Conference
    • /
    • /
    • 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.

  • PDF

Finding Negative Association Rules in Implicit Knowledge Domain (함축적 지식 영역에서 부 연관규칙의 발견)

  • Park, Yang-Jae
    • The Journal of Information Technology
    • /
    • v.9 no.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.

  • PDF

2019 Reform of Japan Commercial Arbitration Association (JCAA) Arbitration Rules (2019년 일본상사중재협회(JCAA) 중재제도의 개혁동향)

  • Kim, Young-Ju
    • Journal of Arbitration Studies
    • /
    • v.29 no.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.

Discovery of Association Rules Using Latent Variables

  • Park, Hee-Chang;Cho, Kwang-Hyun
    • 한국데이터정보과학회:학술대회논문집
    • /
    • /
    • 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.

  • PDF

Discovery of Association Rules Using Latent Variables

  • Park, Hee-Chang;Cho, Kwang-Hyun
    • Journal of the Korean Data and Information Science Society
    • /
    • v.17 no.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.

  • PDF

A Study for Antecedent Association Rules

  • Park, Hee-Chang;Cho, Kwang-Hyun
    • Journal of the Korean Data and Information Science Society
    • /
    • v.17 no.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.

  • PDF

Mining Association Rules of Credit Card Delinquency of Bank Customers in Large Databases

  • Lee, Young-chan;Shin, Soo-il
    • Proceedings of the KAIS Fall Conference
    • /
    • /
    • 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.

  • PDF

Evaluation of Operational Rules for Container Terminals Using Simulation Techniques (시뮬레이션 기법을 이용한 컨테이너터미널 운영규칙의 평가)

  • 장성용;이원영
    • Journal of Korea Port Economic Association
    • /
    • v.18 no.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.

  • PDF

Mining Quantitative Association Rules using Commercial Data Mining Tools (상용 데이타 마이닝 도구를 사용한 정량적 연관규칙 마이닝)

  • Kang, Gong-Mi;Moon, Yang-Sae;Choi, Hun-Young;Kim, Jin-Ho
    • Journal of KIISE:Databases
    • /
    • v.35 no.2
    • /
    • pp.97-111
    • /
    • 2008
  • Commercial data mining tools basically support binary attributes only in mining association rules, that is, they can mine binary association rules only. In general, however. transaction databases contain not only binary attributes but also quantitative attributes. Thus, in this paper we propose a systematic approach to mine quantitative association rules---association rules which contain quantitative attributes---using commercial mining tools. To achieve this goal, we first propose an overall working framework that mines quantitative association rules based on commercial mining tools. The proposed framework consists of two steps: 1) a pre-processing step which converts quantitative attributes into binary attributes and 2) a post-processing step which reconverts binary association rules into quantitative association rules. As the pre-processing step, we present the concept of domain partition, and based on the domain partition, we formally redefine the previous bipartition and multi-partition techniques, which are mean-based or median-based techniques for bipartition, and are equi-width or equi-depth techniques for multi-partition. These previous partition techniques, however, have the problem of not considering distribution characteristics of attribute values. To solve this problem, in this paper we propose an intuitive partition technique, named standard deviation minimization. In our standard deviation minimization, adjacent attributes are included in the same partition if the change of their standard deviations is small, but they are divided into different partitions if the change is large. We also propose the post-processing step that integrates binary association rules and reconverts them into the corresponding quantitative rules. Through extensive experiments, we argue that our framework works correctly, and we show that our standard deviation minimization is superior to other partition techniques. According to these results, we believe that our framework is practically applicable for naive users to mine quantitative association rules using commercial data mining tools.

IMTAR: Incremental Mining of General Temporal Association Rules

  • Dafa-Alla, Anour F.A.;Shon, Ho-Sun;Saeed, Khalid E.K.;Piao, Minghao;Yun, Un-Il;Cheoi, Kyung-Joo;Ryu, Keun-Ho
    • Journal of Information Processing Systems
    • /
    • v.6 no.2
    • /
    • pp.163-176
    • /
    • 2010
  • Nowadays due to the rapid advances in the field of information systems, transactional databases are being updated regularly and/or periodically. The knowledge discovered from these databases has to be maintained, and an incremental updating technique needs to be developed for maintaining the discovered association rules from these databases. The concept of Temporal Association Rules has been introduced to solve the problem of handling time series by including time expressions into association rules. In this paper we introduce a novel algorithm for Incremental Mining of General Temporal Association Rules (IMTAR) using an extended TFP-tree. The main benefits introduced by our algorithm are that it offers significant advantages in terms of storage and running time and it can handle the problem of mining general temporal association rules in incremental databases by building TFP-trees incrementally. It can be utilized and applied to real life application domains. We demonstrate our algorithm and its advantages in this paper.