• Title/Summary/Keyword: Association rules

Search Result 1,380, Processing Time 0.032 seconds

Non-linear regression model considering all association thresholds for decision of association rule numbers (기본적인 연관평가기준 전부를 고려한 비선형 회귀모형에 의한 연관성 규칙 수의 결정)

  • Park, Hee Chang
    • Journal of the Korean Data and Information Science Society
    • /
    • v.24 no.2
    • /
    • pp.267-275
    • /
    • 2013
  • Among data mining techniques, the association rule is the most recently developed technique, and it finds the relevance between two items in a large database. And it is directly applied in the field because it clearly quantifies the relationship between two or more items. When we determine whether an association rule is meaningful, we utilize interestingness measures such as support, confidence, and lift. Interestingness measures are meaningful in that it shows the causes for pruning uninteresting rules statistically or logically. But the criteria of these measures are chosen by experiences, and the number of useful rules is hard to estimate. If too many rules are generated, we cannot effectively extract the useful rules.In this paper, we designed a variety of non-linear regression equations considering all association thresholds between the number of rules and three interestingness measures. And then we diagnosed multi-collinearity and autocorrelation problems, and used analysis of variance results and adjusted coefficients of determination for the best model through numerical experiments.

Adaptive Customer Relation Management Strategies using Association Rules (연관 규칙을 이용한 적응적 고객 관계 관리 전략)

  • Han, Ki-Tae;Chung, Kyung-Yong;Baek, Jun-Ho;Kim, Jong-Hun;Ryu, Joong-Kyung;Lee, Jung-Hyun
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2008.05a
    • /
    • pp.84-86
    • /
    • 2008
  • The customer relation marketing in which companies can utilize to control and to get the filtered information efficiently has appeared. It is applying data mining to build the management that can even predict and recommend products to customers. In this paper, we proposed the adaptive customer relation management strategies using the association rules of data mining. The proposed method uses the association rules composes frequent customers with occurrence of candidate customer set creates the rules of associative customers. We analyzed the efficient feature of purchase customers using the hyper graph partition according to the lift of creative association rules. Therefore, we discovered strategies of the cross-selling and the up-selling about customers.

  • PDF

Analysis of Deliberations by UNCITRAL Working Group on the Draft Revised Version of UNCITRAL Arbitration Rules (UNCITRAL 중재규칙(仲裁規則) 개정초안(改正草案) 내용(內容)의 분석(分析)과 방향검토(方向檢討))

  • Kang, Pyoung-Keun
    • Journal of Arbitration Studies
    • /
    • v.18 no.2
    • /
    • pp.3-31
    • /
    • 2008
  • At its thirty-ninth session(New York, 19 June - 7 July 2006), United Nations Commission on International Trade Law(hereinafter referred to as the Commission) agreed to give priority to the topic of revising the UNCITRAL Arbitration Rules. From the forty-fifth through the forty-seventh session, the Working Group checked various issues based on the draft revised version of the UNCITRAL Arbitration Rules prepared by the Secretariat. At its forty-eighth session, the Working Group is going to finish its first reading of articles 38 to 41 of the draft revised version of the UNCITRAL Arbitration Rules, and to commence its second reading of the draft revised version of UNCITRAL Arbitration Rules. Korea is keen on enticing foreign direct investment into its territory. From the 1960s, Korea has concluded more than 80 BITs. Korea is making efforts to conclude FTAs with its trading partners. As of January, 2008, 3 FTAs have taken into effect with respect to Korea. According to provisions on dispute settlement found in such BITs and FTAs involving Korea, the Rules can be chosen for Investor-State Arbitration. Furthermore, the Rules is followed by the arbitration rules for domestic and international arbitrations administered by the Korean Commercial Arbitration Board. If the Commission adopts the revised version of UNCITRAL Arbitration Rules, the Rules will be able to give impact on the arbitration law and practice around the world of arbitration. That is the reason why we should keep attention to the development of the deliberations of the Working Group.

  • PDF

Applicability of Overriding Mandatory Rules in International Arbitration (국제중재에서 국제적 강행법규의 적용가능성)

  • Chung, Hong-Sik
    • Journal of Arbitration Studies
    • /
    • v.23 no.4
    • /
    • pp.3-27
    • /
    • 2013
  • Overriding Mandatory rules are laws that purport to apply irrespective of the law chosen by the parties to govern their contractual relations. This article examines their role and applicability in international arbitration. The overriding mandatory rules pose a complex and continuing problem for arbitrators because they put the interests of states and parties in direct competition. When a law says that arbitrators must apply it, yet the parties' contract excludes it, what should the arbitrators do? Where should their allegiance lie? The answer depends on the underlying nature of arbitration - and since that can be legitimately conceptualized in different ways, a principled approach to overriding mandatory rules seems to be impossible to provide. Nevertheless, a practical solution is required, because there were European cases in which courts voided valid arbitration agreements made, reasoning that arbitrators certainly would not apply and/or take into account its overriding mandatory rules of indemnity right granted to commercial agent and distributor in Europe. Therefore, this paper first examines status of overriding mandatory rules of another law in international litigation and then explores any possibility of application of overriding mandatory rules of another law in international commercial arbitration. With this analysis, the author reaches into a conclusion that the arbitrator should and/or take into account overriding mandatory rules of another law, yet should limit to them of the country where characteristic performance is made under the contract.

  • PDF

An Efficient Tree Structure Method for Mining Association Rules (트리 구조를 이용한 연관규칙의 효율적 탐색)

  • Kim, Chang-Oh;Ahn, Kwang-Il;Kim, Seong-Jip;Kim, Jae-Yearn
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.27 no.1
    • /
    • pp.30-36
    • /
    • 2001
  • We present a new algorithm for mining association rules in the large database. Association rules are the relationships of items in the same transaction. These rules provide useful information for marketing. Since Apriori algorithm was introduced in 1994, many researchers have worked to improve Apriori algorithm. However, the drawback of Apriori-based algorithm is that it scans the transaction database repeatedly. The algorithm which we propose scans the database twice. The first scanning of the database collects frequent length l-itemsets. And then, the algorithm scans the database one more time to construct the data structure Common-Item Tree which stores the information about frequent itemsets. To find all frequent itemsets, the algorithm scans Common-Item Tree instead of the database. As scanning Common-Item Tree takes less time than scanning the database, the algorithm proposed is more efficient than Apriori-based algorithm.

  • PDF

Children's Ideas about Self-Regulation by Situational Characteristics (상황의 특성에 따른 아동의 자기 규제에 대한 판단)

  • Cho, Sung Min;Yi, Soon Hyung
    • Korean Journal of Child Studies
    • /
    • v.19 no.2
    • /
    • pp.147-157
    • /
    • 1998
  • The purpose of this study was to investigate children's ideas about self-regulation in such situational variables as the presence of explicit rules and the domains of social rules. The subjects were 6-, 9-, and 12-year-old children (344). To assess children's ideas about self-regulation, a procedure was devised in which children were presented with stories portraying a protagonist in a conflict between an implicit or an explicit rule and a personal desire. The children were asked to make a choice for the protagonist and to give reasons for their choice. Major findings as follows: (1) There was significant difference in children's self-regulation depending on the presence of explicit rules. (2) There was significant difference in children's self-regulation depending on the domains of social rules. In situations that involved no explicit rules for behaviors, there were significant differences depending on the domains. In situations that involved explicit rules for behaviors, for 6- and 9-year-old children, there was no significant difference depending on the domains. (3) Children's use of justifications for their choice of action varied as a function of the characteristics of the social rules.

  • PDF

Personalized e-Commerce Recommendation System using RFM method and Association Rules (RFM 기법과 연관성 규칙을 이용한 개인화된 전자상거래 추천시스템)

  • Jin, Byeong-Woon;Cho, Young-Sung;Ryu, Keun-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.12
    • /
    • pp.227-235
    • /
    • 2010
  • This paper proposes the recommendation system which is advanced using RFM method and Association Rules in e-Commerce. Using a implicit method which is not used user's profile for rating, it is necessary for user to keep the RFM score and Association Rules about users and items based on the whole purchased data in order to recommend the items. This proposing system is possible to advance recommendation system using RFM method and Association Rules for cross-selling, and also this system can avoid the duplicated recommendation by the cross comparison with having recommended items before. And also, it's efficient for them to build the strategy for marketing and crm(customer relationship management). It can be improved and evaluated according to the criteria of logicality through the experiment with dataset collected in a cosmetic cyber shopping mall. Finally, it is able to realize the personalized recommendation system for one to one web marketing in e-Commerce.

An Efficient Algorithm for Mining Frequent Closed Itemsets Using Transaction Link Structure (트랜잭션 연결 구조를 이용한 빈발 Closed 항목집합 마이닝 알고리즘)

  • Han, Kyong Rok;Kim, Jae Yearn
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.32 no.3
    • /
    • pp.242-252
    • /
    • 2006
  • Data mining is the exploration and analysis of huge amounts of data to discover meaningful patterns. One of the most important data mining problems is association rule mining. Recent studies of mining association rules have proposed a closure mechanism. It is no longer necessary to mine the set of all of the frequent itemsets and their association rules. Rather, it is sufficient to mine the frequent closed itemsets and their corresponding rules. In the past, a number of algorithms for mining frequent closed itemsets have been based on items. In this paper, we use the transaction itself for mining frequent closed itemsets. An efficient algorithm is proposed that is based on a link structure between transactions. Our experimental results show that our algorithm is faster than previously proposed methods. Furthermore, our approach is significantly more efficient for dense databases.

An Efficient Search Method for High Confidence Association Rules Using CP(Confidence Pattern)-Tree Structure (CP-Tree구조를 이용한 높은 신뢰도를 갖는 연관 규칙의 효율적 탐색 방법)

  • 송한규;김재련
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.25 no.1
    • /
    • pp.1-8
    • /
    • 2002
  • The traditional approaches of association rule mining have relied on high support condition to find interesting rules. However, in some application such as analyzing the web page link and discovering some unusual combinations of some factors that have always caused some disease, we are interested in rules with high confidence that have very low support or need not have high support. In these cases, the traditional algorithms are not suitable since it relies on first satisfying high support. In this paper, we propose a new model, CP(Confidence Pattern)-Tree, to identify high confidence rule between 2-items without support constraint. constraint. In addition, we discuss confidence association rule between two more items without support constraint.

A Study on the Advanced Association Rules Algorithm of n-Items (개선된 n-항목 연관 규칙 알고리즘 연구)

  • 황현숙;어윤양
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.27 no.4
    • /
    • pp.29-39
    • /
    • 2002
  • The transaction tables of the existing association algorithms have two column attributes : It is composed of transaction identifier (Transaction_id) and an item identifier (item). In this kind of structure, as the volume of data becomes larger, the performance for the SQL query statements came applicable decreases. Therefore, we propose advanced association rules algorithm of n-items which can transact multiple items (Transaction_id, Item 1, Item 2…, Item n). In this structure, performance hours can be contracted more than the single item structures, because count can be computed by query of the input transaction tables. Our experimental results indicate that performance of the n items structure is up to 2 times better than the single item. As a result of this paper, the proposed algorithm can be applied to internet shopping, searching engine and etc.