• 제목/요약/키워드: Association rule mining

검색결과 351건 처리시간 0.029초

The Proposition of Conditionally Pure Confidence in Association Rule Mining

  • Park, Hee-Chang
    • Journal of the Korean Data and Information Science Society
    • /
    • 제19권4호
    • /
    • pp.1141-1151
    • /
    • 2008
  • Data mining is the process of sorting through large amounts of data and picking out useful information. One of the well-studied problems in data mining is the exploration of association rules. An association rule technique finds the relation among each items in massive volume database. Some interestingness measures have been developed in association rule mining. Interestingness measures are useful in that it shows the causes for pruning uninteresting rules statistically or logically. This paper propose a conditional pure confidence to evaluate association rules and then describe some properties for a proposed measure. The comparative studies with confidence and pure confidence are shown by numerical example. The results show that the conditional pure confidence is better than confidence or pure confidence.

  • PDF

Criteria of Association Rule based on Chi-Square for Nominal Database

  • 박희창;이호순
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 한국데이터정보과학회 2004년도 춘계학술대회
    • /
    • pp.25-38
    • /
    • 2004
  • 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 the relation between the measure of association based on chi square statistic and the criteria of association rule for nominal database and propose the objective criteria for association.

  • PDF

Relation for the Measure of Association and the Criteria of Association Rule in Ordinal Database

  • Park, Hee-Chang;Lee, Ho-Soon
    • Journal of the Korean Data and Information Science Society
    • /
    • 제16권2호
    • /
    • pp.207-216
    • /
    • 2005
  • One of the well-studied problems in data mining is the search for association rules. Association rules are useful for determining correlations between attributes of a relation and have applications in marketing, financial and retail sectors. There are three criteria of association rule; support, confidence, lift. The goal of association rule mining is to find all the rules with support and confidence exceeding some user specified thresholds. We can know there is association between two items by the criteria of association rules. But we can not know the degree of association between two items. In this paper we examine the relation between the measures of association and the criteria of association rule for ordinal data.

  • PDF

연관규칙을 이용한 데이터 분석에 관한 연구 (A Study on the Analysis of Data Using Association Rule)

  • 임영문;최영두
    • 산업경영시스템학회지
    • /
    • 제23권61호
    • /
    • pp.115-126
    • /
    • 2000
  • In General, data mining is defined as the knowledge discovery or extracting hidden necessary information from large databases. Its technique can be applied into decision making, prediction, and information analysis through analyzing of relationship and pattern among data. One of the most important works is to find association rules in data mining. Association Rule is mainly being used in basket analysis. In addition, it has been used in the analysis of web-log and user-pattern. This paper provides the application method in the field of marketing through the analysis of data using association rule as a technique of data mining.

  • PDF

전략적 중요도를 고려한 연관규칙의 발견: WARM (Association Rule Discovery Considering Strategic Importance: WARM)

  • 최덕원
    • 정보처리학회논문지D
    • /
    • 제17D권4호
    • /
    • pp.311-316
    • /
    • 2010
  • 본 논문은 가중치를 고려한 연관규칙탐사 알고리즘(WARM)을 제시한다. 각 전략적 요소항목에 가중치를 부여하는 것과, 각 전략요소 항목별로 원시 자료값을 정규화하는 것이 이 논문에서 제시하는 알고리즘의 중요한 내용을 구성하고 있다. 본 논문은 TSAA 알고리즘을 확장 발전 시킨 연구로서 전략적 중요도를 반영하는 항목으로는 각 품목의 이익기여도, 마케팅 가치, 고객만족도 등을 사용하였다. 한 대형할인점의 실제 거래자료를 사용하여 알고리즘의 성능을 검사하였으며, Apriori, TSAA 및 WARM의 세 가지 알고리즘을 사용한 탐사결과를 비교 분석하였다. 분석의 결과 세 가지 알고리즘은 연관분석 행태에 있어서 각각 독특한 탐사행태를 보이는 것으로 나타났다.

우수 의약품 제조 기준 위반 패턴 인식을 위한 연관규칙과 텍스트 마이닝 기반 t-SNE분석 (Violation Pattern Analysis for Good Manufacturing Practice for Medicine using t-SNE Based on Association Rule and Text Mining)

  • 이준오;손소영
    • 품질경영학회지
    • /
    • 제50권4호
    • /
    • pp.717-734
    • /
    • 2022
  • Purpose: The purpose of this study is to effectively detect violations that occur simultaneously against Good Manufacturing Practice, which were concealed by drug manufacturers. Methods: In this study, we present an analysis framework for analyzing regulatory violation patterns using Association Rule Mining (ARM), Text Mining, and t-distributed Stochastic Neighbor Embedding (t-SNE) to increase the effectiveness of on-site inspection. Results: A number of simultaneous violation patterns was discovered by applying Association Rule Mining to FDA's inspection data collected from October 2008 to February 2022. Among them there were 'concurrent violation patterns' derived from similar regulatory ranges of two or more regulations. These patterns do not help to predict violations that simultaneously appear but belong to different regulations. Those unnecessary patterns were excluded by applying t-SNE based on text-mining. Conclusion: Our proposed approach enables the recognition of simultaneous violation patterns during the on-site inspection. It is expected to decrease the detection time by increasing the likelihood of finding intentionally concealed violations.

빈발도와 가중치를 이용한 서비스 연관 규칙 마이닝 (Mining Association Rule on Service Data using Frequency and Weight)

  • 황정희
    • 디지털콘텐츠학회 논문지
    • /
    • 제17권2호
    • /
    • pp.81-88
    • /
    • 2016
  • 일반적인 빈발패턴 탐사 방법은 항목의 빈발도만을 고려한다. 그러나 유용한 정보를 추출하는 데 있어 빈발도와 더불어 고려해야 하는 것은 빈발항목이 아니더라도 연관된 항목이 주기적으로 함께 발생한다면 시기나 시간에 따라 관심의 중요도가 변화하는 것을 고려해야 한다. 즉, 시간에 따라 사용자가 요구하는 서비스의 중요도는 다르므로 각 서비스 항목에 대한 중요도의 값을 고려하여 마이닝 하는 방법이 필요하다. 본 논문에서는 서비스 온톨로지 기반으로 가중치를 이용한 서비스 빈발 패턴을 추출하는 마이닝 기법을 제안한다. 제안하는 기법은 시공간 상황을 기반으로 서비스의 중요도를 고려한 가중치를 부여하여 연관 서비스를 발견한다. 새롭게 탐사되는 서비스는 저장되어 있는 서비스 규칙과의 새로운 조합을 통해 사용자에게 최적의 서비스 정보를 제공할 수 있는 기반이 된다.

Application of Data Mining on Simultaneous Activities on the Time Use Survey

  • Nam, Ki-Seong;Kim, Hee-Jea
    • Journal of the Korean Data and Information Science Society
    • /
    • 제14권4호
    • /
    • pp.737-749
    • /
    • 2003
  • This Paper analyzed simultaneous activities of the time use survey by Korea National Statistical Office to use data mining's association rule. The survey of National Statistical Office in 1999 considered general analysis for main activities like that personal care(eating), employment and study, leisure, travel by purpose. But if we use the association rule, we can found the ratio of simultaneous activities at the same time. And also we can found the probability that another activities practise if we act one particular activity. Using this association rule of data mining we can do more developed and analytical sociological study.

  • PDF

Analysis of Simultaneous Activities on the Time Use Survey Using Data Mining

  • 남기성;김희재
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 한국데이터정보과학회 2003년도 춘계학술대회
    • /
    • pp.159-170
    • /
    • 2003
  • This Paper analyzed simultaneous activities of the time use survey by Korea National Statistical Office to use data mining‘s association rule. The survey of National Statistical Office in 1999 considered general analysis for simultaneous activities. But if we use the association rule, we can found the ratio of particular activities at the same time. And we found the probability that another activities practise if we act one particular activity. Using this association rule of data mining we can do more developed and analytical sociological study.

  • PDF

Enhancing Association Rule Mining with a Profit Based Approach

  • Li Ming-Lai;Kim Heung-Num;Jung Jason J.;Jo Geun-Sik
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2005년도 가을 학술발표논문집 Vol.32 No.2 (1)
    • /
    • pp.973-975
    • /
    • 2005
  • With the continuous growth of e-commerce there is a huge amount of products information available online. Shop managers expect to apply information techniques to increase profit and perfect service. Hence many e-commerce systems use association rule mining to further refine their management. However previous association rule algorithms have two limitations. Firstly, they only use the number to weight item's essentiality and ignore essentiality of item profit. Secondly, they did not consider the relationship between number and profit of item when they do mining. We address a novel algorithm, profit-based association rule algorithm that uses profit-based technique to generate 1-itemsets and the multiple minimum supports mining technique to generate N-items large itemsets.

  • PDF