• 제목/요약/키워드: data association

검색결과 33,078건 처리시간 0.054초

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

Exploration of Association Rules for Social Survey Data

  • Park, Hee-Chang;Cho, Kwang-Hyun
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 한국데이터정보과학회 2005년도 춘계학술대회
    • /
    • pp.18-24
    • /
    • 2005
  • The methods of data mining are decision tree, association rules, clustering, neural network and so on. Data mining is the method to find useful information for large amounts of data in database. It is used to find hidden knowledge by massive data, unexpectedly pattern, relation to new rule. We analyze Gyeongnam social indicator survey data by 2003 using association rule technique for environment information. Association rules are useful for determining correlations between attributes of a relation and have applications in marketing, financial and retail sectors. We can use association rule outputs in environmental preservation and environmental improvement.

  • PDF

Hybrid Intelligent Web Recommendation Systems Based on Web Data Mining and Case-Based Reasoning

  • Kim, Jin-Sung
    • 한국지능시스템학회논문지
    • /
    • 제13권3호
    • /
    • pp.366-370
    • /
    • 2003
  • In this research, we suggest a hybrid intelligent Web recommendation systems based on Web data mining and case-based reasoning (CBR). One of the important research topics in the field of Internet business is blending artificial intelligence (AI) techniques with knowledge discovering in database (KDD) or data mining (DM). Data mining is used as an efficient mechanism in reasoning for association knowledge between goods and customers' preference. In the field of data mining, the features, called attributes, are often selected primary for mining the association knowledge between related products. Therefore, most of researches, in the arena of Web data mining, used association rules extraction mechanism. However, association rules extraction mechanism has a potential limitation in flexibility of reasoning. If there are some goods, which were not retrieved by association rules-based reasoning, we can't present more information to customer. To overcome this limitation case, we combined CBR with Web data mining. CBR is one of the AI techniques and used in problems for which it is difficult to solve with logical (association) rules. A Web-log data gathered in real-world Web shopping mall was given to illustrate the quality of the proposed hybrid recommendation mechanism. This Web shopping mall deals with remote-controlled plastic models such as remote-controlled car, yacht, airplane, and helicopter. The experimental results showed that our hybrid recommendation mechanism could reflect both association knowledge and implicit human knowledge extracted from cases in Web databases.

측정치 개수 제한기법을 이용한 HPDA 알고리즘 성능향상 연구 (The Improvement of the Highest Probability Data Association algorithm with Limited Measurement Numbers(HPDA-LIMN) in the Validation Gate)

  • 임영택;홍영기
    • 한국군사과학기술학회지
    • /
    • 제14권5호
    • /
    • pp.812-817
    • /
    • 2011
  • In this paper, we propose new data association method called the Highest Probability Data Association with Limited Measurement Numbers(HPDA-LIMN) using a Signal Itensity Ordering method applied to tracking in clutter environment. The performance of HPDA-LIMN algorithm is tested in a series of Monte Carlo simulations runs and is compared with the exiting data association method in cluttered environment.

연관규칙을 이용한 데이터 분석에 관한 연구 (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

목표 속성을 고려한 연관규칙과 분류 기법 (Directed Association Rules Mining and Classification)

  • 한경록;김재련
    • 산업경영시스템학회지
    • /
    • 제24권63호
    • /
    • pp.23-31
    • /
    • 2001
  • Data mining can be either directed or undirected. One way of thinking about it is that we use undirected data mining to recognize relationship in the data and directed data mining to explain those relationships once they have been found. Several data mining techniques have received considerable research attention. In this paper, we propose an algorithm for discovering association rules as directed data mining and applying them to classification. In the first phase, we find frequent closed itemsets and association rules. After this phase, we construct the decision trees using discovered association rules. The algorithm can be applicable to customer relationship management.

  • PDF

데이터마이닝과 사례기반추론 기법에 기반한 인터넷 구매지원 시스템 구축에 관한 연구 (A Study on the Development of Internet Purchase Support Systems Based on Data Mining and Case-Based Reasoning)

  • 김진성
    • 한국경영과학회지
    • /
    • 제28권3호
    • /
    • pp.135-148
    • /
    • 2003
  • In this paper we introduce the Internet-based purchase support systems using data mining and case-based reasoning (CBR). Internet Business activity that involves the end user is undergoing a significant revolution. The ability to track users browsing behavior has brought the vendor and end customer's closer than ever before. It is now possible for a vendor to personalize his product message for individual customers at massive scale. Most of former researchers, in this research arena, used data mining techniques to pursue the customer's future behavior and to improve the frequency of repurchase. The area of data mining can be defined as efficiently discovering association rules from large collections of data. However, the basic association rule-based data mining technique was not flexible. If there were no inference rules to track the customer's future behavior, association rule-based data mining systems may not present more information. To resolve this problem, we combined association rule-based data mining with CBR mechanism. CBR is used in reasoning for customer's preference searching and training through the cases. Data mining and CBR-based hybrid purchase support mechanism can reflect both association rule-based logical inference and case-based information reuse. A Web-log data gathered in the real-world Internet shopping mall is given to illustrate the quality of the proposed systems.

Statistical Decision making of Association Threshold in Association Rule Data Mining

  • 박희창;송금민
    • Journal of the Korean Data and Information Science Society
    • /
    • 제13권2호
    • /
    • pp.115-128
    • /
    • 2002
  • One of the well-studied problems in data mining is the search for association rules. In this paper we consider the statistical decision making of association threshold in association rule. A chi-squared statistic is used to find minimum association threshold. We calculate the range of the value that two item sets are occurred simultaneously, and find the minimum confidence threshold values.

  • PDF

연관규칙을 이용한 고객의 구매경향에 관한 연구 (A Study on Customer's Purchase Trend Using Association Rule)

  • 임영문;최영두
    • 대한안전경영과학회:학술대회논문집
    • /
    • 대한안전경영과학회 2000년도 추계학술발표논문집
    • /
    • pp.299-306
    • /
    • 2000
  • General definition of data mining is the knowledge discovery or is to extract 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 work is to find association rules in data mining. The objective of this paper is to find customer's trend using association rule from analysis of database and the result can be used as fundamental data for CRM(Customer Relationship Management). This paper uses Apriori algorithm and FoodMart data in order to find association rules.

  • PDF

고밀도 클러터 환경에서 비선형 표적추적에 강인한 자료결합 게이트 기법 (A robust data association gate method of non-linear target tracking in dense cluttered environment)

  • 김성원;권택익;조현덕
    • 한국음향학회지
    • /
    • 제40권2호
    • /
    • pp.109-120
    • /
    • 2021
  • 본 논문은 고밀도 클러터 환경 비선형 표적에 대해서 수동소나 자동표적추적 자료결합 게이트를 강인하게 적용하기 위한 H∞ 놈 기반의 자료결합 게이트 기법을 제안한다. 표적추적을 위한 자료결합 기법은 유효 측정 범위인 유효 게이트 내에 있는 측정치를 자료결합의 후보대상으로 선택한다. 자료결합에서의 유효 게이트 범위가 적정하지 않거나 고밀도 클러터 환경에서 자료결합이 수행되면, 클러터 측정치의 간섭을 더욱 받게 되어 표적추적의 강인성을 유지하기 어렵다. 이러한 문제를 해결하기 위해서, 본 논문은 가우시안 분포 가정 및 추적 오차 공분산 기반의 기존 3-σ 게이트 기법에 H∞ 놈 기반의 이분법 알고리즘을 결합하여 적용한 새로운 게이팅 기법을 제안한다. 제안 기법은 클러터의 간섭을 완화시키고, 비선형 기동표적을 견실하게 추적하게 한다. 해석적인 분석 방법과 수평방위 및 수직방위의 측정치를 모의한 신호를 활용한 시뮬레이션을 통해 자료결합의 강인함이 기존 기법에 대비하여 향상됨을 확인하였다.