• Title, Summary, Keyword: Association rules

Search Result 1,165, Processing Time 0.034 seconds

Temporal Association Rules with Exponential Smoothing Method (지수 평활법을 적용한 시간 연관 규칙)

  • Byon, Lu-Na;Park, Byoung-Sun;Han, Jeong-Hye;Jeong, Han-Il;Leem, Choon-Seong
    • The KIPS Transactions:PartD
    • /
    • v.11D no.3
    • /
    • pp.741-746
    • /
    • 2004
  • As electronic commerce progresses, the temporal association rule is developed from partitioned data sets by time to offer personalized services for customer's interest. In this paper, we proposed a temporal association rule with exponential smoothing method that is giving higher weights to recent data than past data. Through simulation and case study, we confirmed that it is more precise than existing temporal association rules but consumes running time.

Design and Implementation of a Personalized e-Mall with Association Rules based on View History of Excellent Customers (우수고객의 이력 뷰를 이용한 연관규칙 개별화 전자상점 설계 및 구현)

  • Jeong Kyeong-Ja;Han Jeong-Hye
    • Journal of Digital Contents Society
    • /
    • v.2 no.2
    • /
    • pp.117-127
    • /
    • 2001
  • Since the number of e-malls is increased by the rapidly Progress of internet, most e-malls are trying to increase customers' interests by providing personalized services. To Provide this service for CRM, the e-mall must use the personalized rules calculated from customer transaction database. The more filtered transaction data are, the more the e-mall services efficiently and exactly to customer's need. The filtered transaction database is necessary to obtain the food personalized rules. In this paper we propose and develope a personalized e-mall with association rules based on view history of excellent customers who have good transaction data. Association rules based on view history of excellent customers reduce the access time and computing costs. The e-mall with them can provide personalized services more efficiently and exactly.

  • PDF

A Efficient Rule Extraction Method Using Hidden Unit Clarification in Trained Neural Network (인공 신경망에서 은닉 유닛 명확화를 이용한 효율적인 규칙추출 방법)

  • Lee, Hurn-joo;Kim, Hyeoncheol
    • The Journal of Korean Association of Computer Education
    • /
    • v.21 no.1
    • /
    • pp.51-58
    • /
    • 2018
  • Recently artificial neural networks have shown excellent performance in various fields. However, there is a problem that it is difficult for a person to understand what is the knowledge that artificial neural network trained. One of the methods to solve these problems is an algorithm for extracting rules from trained neural network. In this paper, we extracted rules from artificial neural networks using ordered-attribute search(OAS) algorithm, which is one of the methods of extracting rules, and analyzed result to improve extracted rules. As a result, we have found that the distribution of output values of the hidden layer unit affects the accuracy of rules extracted by using OAS algorithm, and it is suggested that efficient rules can be extracted by binarizing hidden layer output values using hidden unit clarification.

Association rule thresholds considering the number of possible rules of interest items (관심 항목의 발생 가능한 규칙의 수를 고려한 연관성 평가기준)

  • Park, Hee-Chang
    • Journal of the Korean Data and Information Science Society
    • /
    • v.23 no.4
    • /
    • pp.717-725
    • /
    • 2012
  • Data mining is a method to find useful information for large amounts of data in database. One of the well-studied problems in data mining is exploration for association rules. Association rule mining searches for interesting relationships among items in a given database by support, confidence, and lift. If we use the existing association rules, we can commit some errors by information loss not to consider the size of occurrence frequency. In this paper, we proposed a new association rule thresholds considering the number of possible rules of interest items and compare with existing association rule thresholds by example and real data. As the results, the new association rule thresholds were more useful than existing thresholds.

Negatively attributable and pure confidence for generation of negative association rules (음의 연관성 규칙 생성을 위한 음의 기여 순수 신뢰도의 제안)

  • Park, Hee-Chang
    • Journal of the Korean Data and Information Science Society
    • /
    • v.23 no.5
    • /
    • pp.939-948
    • /
    • 2012
  • The most widely used data mining technique is to explore association rules. This technique has been used to find the relationship between items in a massive database based on the interestingness measures such as support, confidence, lift, etc. Association rules are frequently used by retail stores to assist in marketing, advertising, floor placement, and inventory control.In general, association rule technique generates the rule, 'If A, then B.', whereas negative association rule technique generates the rule, 'If A, then not B.', or 'If not A, then B.'. We can determine whether we promote other products in addition to promote its products only if we add negative association rules to existing association rules. In this paper, we proposed the negatively attributable and pure confidence to overcome the problems faced by negative association rule technique, and then we checked three conditions for interestingness measure. The comparative studies with negative confidence, negatively pure confidence, and negatively attributable and pure confidence are shown by numerical examples. The results show that the negatively attributable and pure confidence is better than negative confidence and negatively pure confidence.

A Study on the Draft and Issues for the Revision of UNCITRAL Arbitration Rules (UNCITRAL 중재규칙 개정안의 내용과 쟁점에 관한 연구)

  • Lee, Kang-Bin
    • Journal of Arbitration Studies
    • /
    • v.17 no.2
    • /
    • pp.43-70
    • /
    • 2007
  • The purpose of this paper is to make research on the contents and discussions of the draft of revised UNCITRAL Arbitration Rules that have been discussed and considered by the Working Group. At its thirty-ninth session (New York, 19 June-7 July 2006), the Commission agreed that, in respect of future work of the Working Group, priority be given to a revision of the UNCITRAL Arbitration Rules (1976). At its forty-fifth session (Vienna, 11-15 September 2006), the Working Group undertook to identify areas where a revision of the UNCITRAL Arbitration Rules might be useful. At that session, it was considered that the focus of the revision should be on updating the Rules to meet changes that had taken place over the last thirty years in arbitral practice. The largely amended provisions of the draft of revised UNCITRAL Arbitration Rules are as follows : Notice of arbitration and response to the notice of arbitration (Article 3), Designating and appointing authorities (Article 4 bis), November of arbitrators (Article 5), Appointment of arbitrations (Article 6), Appointment of arbitrators in multi-party arbitration (Article 7 bis), Challenge of arbitrators (Article 9), Replacement of an arbitrator (Article 13), Pleas as to the jurisdiction of the arbitral tribunal (Article 21), Interim measures (Article 26), Form and effect of the award (Article 32), and Liability of arbitrators (Proposed additional provisions). There are some differences between the draft of revised UNCITRAL Arbitration Rules and the KCAB Arbitration Rules. In order to jnternationalize the Korea's commercial arbitration system, it is desirable that the main articles of the draft of revised UNCITRAL Arbitration Rules should be admitted to the KCAB Arbitration Rules. In conclusion, the Commission was generally of the view of any revision of the UNCITRAL Arbitration Rules should not alter the structure of the text, its spirit, its drafting style, and should respect the flexibility of the text rather than make it more complex. The Working Group agreed that harmonizing the provisions of the UNCITRAL Model Law should not be automatic but rather considered only where appropriate.

  • PDF

Recent Developments : The Third Reading of the Revised Version of the UNCITRAL Arbitration Rules of 1976 (UNCITRAL의 최근 동향 : 1976년 UNCITRAL 중재규칙 개정안의 제3회독을 중심으로)

  • Kang, Pyoung-Keun
    • Journal of Arbitration Studies
    • /
    • v.20 no.2
    • /
    • pp.3-26
    • /
    • 2010
  • In 2006, the UNCITRAL Working Group II started a new project on the revision of the UNCITRAL Arbitration Rules of 1976. Ever since that time, 9 sessions of the Working Group II were devoted to the discussions on such topic. The Arbitration Rules has been acknowledged to be used for settling international disputes involving various disputing parties. In recent years, many treaty-based arbitrations have been subject to the Arbitration Rules. This article focuses on the discussions made in the 52nd session of the Working Group II where the third reading of the revised draft of the Arbitration Rules was completed except for a few provisions. Among the draft rules, the delegations were hardly able to reach an agreement with regard to Articles 2(2), 34(2), 41(3), (4), and (6). It is expected that those provisions would be agreed in the coming 43rd plenary session of the UNCITRAL. The use of the Arbitration Rules is dependent on the agreement by the disputing parties. It is not like the UNCITRAL Model Law on International Commercial Arbitration which was adopted in Korean legal system in 1999. However, the proper functioning of arbitration rules is essential for the efficient and successful operation of the arbitration system in a particular country. That is the reason why we should keep close attention on the discussions of the UNCITRAL with regard to the revision of the Arbitration Rules.

  • PDF

A Study on the Recent Amendment to the Arbitration Rules of the Korean Commercial Arbitration Board (대한상사중재원(KCAB) 중재규칙의 최근 개정내용에 관한 고찰)

  • Kim, Tae-Hoon;Cha, Kyung-Ja
    • Journal of Arbitration Studies
    • /
    • v.22 no.1
    • /
    • pp.3-22
    • /
    • 2012
  • The Korean Commercial Arbitration Board ("KCAB") recently amended its 'International Arbitration Rules' and the 'Arbitration Rules', which became effective on September 1, 2011. Under the amendment, the 'Arbitration Rules' will be referred to as the 'Domestic Arbitration Rules' and in principle apply only to domestic arbitration cases. Accordingly, the amendment removed all of the provisions relating to international arbitration cases. In addition, under the amendment, the 'International Arbitration Rules' will automatically apply to all international arbitration cases unless the parties agree otherwise. The amended 'International Arbitration Rules' establish new expedited procedures for the international arbitration cases before the KCAB. The KCAB has also instituted additional changes related to international arbitration cases including reduction in the filing and administrative fees and appointment of prominent international foreign arbitrators on its panel. The remuneration for arbitrators has also increased to bring them more in line with the fees provided by other leading international arbitration institutions. While several problems remain, these most recent revisions must be seen as a step in the right direction for the KCAB.

  • PDF

Discovering Association Rules using Item Clustering on Frequent Pattern Network (빈발 패턴 네트워크에서 아이템 클러스터링을 통한 연관규칙 발견)

  • Oh, Kyeong-Jin;Jung, Jin-Guk;Ha, In-Ay;Jo, Geun-Sik
    • Journal of Intelligence and Information Systems
    • /
    • v.14 no.1
    • /
    • pp.1-17
    • /
    • 2008
  • Data mining is defined as the process of discovering meaningful and useful pattern in large volumes of data. In particular, finding associations rules between items in a database of customer transactions has become an important thing. Some data structures and algorithms had been proposed for storing meaningful information compressed from an original database to find frequent itemsets since Apriori algorithm. Though existing method find all association rules, we must have a lot of process to analyze association rules because there are too many rules. In this paper, we propose a new data structure, called a Frequent Pattern Network (FPN), which represents items as vertices and 2-itemsets as edges of the network. In order to utilize FPN, We constitute FPN using item's frequency. And then we use a clustering method to group the vertices on the network into clusters so that the intracluster similarity is maximized and the intercluster similarity is minimized. We generate association rules based on clusters. Our experiments showed accuracy of clustering items on the network using confidence, correlation and edge weight similarity methods. And We generated association rules using clusters and compare traditional and our method. From the results, the confidence similarity had a strong influence than others on the frequent pattern network. And FPN had a flexibility to minimum support value.

  • PDF

Temporal Associative Classification based on Calendar Patterns (캘린더 패턴 기반의 시간 연관적 분류 기법)

  • Lee Heon Gyu;Noh Gi Young;Seo Sungbo;Ryu Keun Ho
    • Journal of KIISE:Databases
    • /
    • v.32 no.6
    • /
    • pp.567-584
    • /
    • 2005
  • Temporal data mining, the incorporation of temporal semantics to existing data mining techniques, refers to a set of techniques for discovering implicit and useful temporal knowledge from temporal data. Association rules and classification are applied to various applications which are the typical data mining problems. However, these approaches do not consider temporal attribute and have been pursued for discovering knowledge from static data although a large proportion of data contains temporal dimension. Also, data mining researches from temporal data treat problems for discovering knowledge from data stamped with time point and adding time constraint. Therefore, these do not consider temporal semantics and temporal relationships containing data. This paper suggests that temporal associative classification technique based on temporal class association rules. This temporal classification applies rules discovered by temporal class association rules which extends existing associative classification by containing temporal dimension for generating temporal classification rules. Therefore, this technique can discover more useful knowledge in compared with typical classification techniques.