• Title/Summary/Keyword: association-rule

Search Result 1,233, Processing Time 0.04 seconds

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

  • Lee, Young-Chan;Shin, Soo-Il
    • Journal of Intelligence and Information Systems
    • /
    • v.9 no.2
    • /
    • pp.135-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 as a rule generating data mining technique. Specifically, we generate sets of rules of customers who are in bad credit status because of delinquency by association rule mining. We expect that the sets of rules generated by association rule mining could act as an estimator of good or bad credit status classifier and basic component of early warning system.

  • PDF

An Empirical Study of Qualities of Association Rules from a Statistical View Point

  • Dorn, Maryann;Hou, Wen-Chi;Che, Dunren;Jiang, Zhewei
    • Journal of Information Processing Systems
    • /
    • v.4 no.1
    • /
    • pp.27-32
    • /
    • 2008
  • Minimum support and confidence have been used as criteria for generating association rules in all association rule mining algorithms. These criteria have their natural appeals, such as simplicity; few researchers have suspected the quality of generated rules. In this paper, we examine the rules from a more rigorous point of view by conducting statistical tests. Specifically, we use contingency tables and chi-square test to analyze the data. Experimental results show that one third of the association rules derived based on the support and confidence criteria are not significant, that is, the antecedent and consequent of the rules are not correlated. It indicates that minimum support and minimum confidence do not provide adequate discovery of meaningful associations. The chi-square test can be considered as an enhancement or an alternative solution.

Association Rule Mining Considering Strategic Importance (전략적 중요도를 고려한 연관규칙 탐사)

  • Choi, Doug-Won;Shin, Jin-Gyu
    • Annual Conference of KIPS
    • /
    • 2007.05a
    • /
    • pp.443-446
    • /
    • 2007
  • A new association rule mining algorithm, which reflects the strategic importance of associative relationships between items, was developed and presented in this paper. This algorithm exploits the basic framework of Apriori procedures and TSAA(transitive support association Apriori) procedure developed by Hyun and Choi in evaluating non-frequent itemsets. The algorithm considers the strategic importance(weight) of feature variables in the association rule mining process. Sample feature variables of strategic importance include: profitability, marketing value, customer satisfaction, and frequency. A database with 730 transaction data set of a large scale discount store was used to compare and verify the performance of the presented algorithm against the existing Apriori and TSAA algorithms. The result clearly indicated that the new algorithm produced substantially different association itemsets according to the weights assigned to the strategic feature variables.

Limitation of Protein Half-life Prediction in Computational Approach Based on N-end Rule (N-end rule 기반 단백질 수명 예측 프로그램의 한계)

  • Ryu, Jea Woon;Kim, Hak Yong
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2011.05a
    • /
    • pp.339-340
    • /
    • 2011
  • 본 연구는 N말단 아미노산 종류에 따라 단백질의 수명(half-life)이 결정된다는 N-end rule을 기반으로 단백질 수명을 예측해주는 프로그램인 protparam의 결과와 bleach-chase를 이용한 실험 데이터를 비교 분석하였다. 단백질 수명을 결정하는 여러 요인들을 고려하지 않고 한 가지 요인만을 반영한 protparam의 결과는 실제 측정값과 현격한 차이를 나타낸다. 특히 실제 단백질은 NME(N-terminal Methionine Excision) 현상이 일어나는데 이를 고려하지 않고 유전체에서 번역한 그대로의 아미노산 서열을 가지고 단백질 수명을 계산하는 한계를 가지고 있다. 이에 본 연구에서 N말단 아미노산을 순차적으로 제거하여 N-end rule을 적용한 결과도 실험 데이터와 일치하지 않는 결과를 보여주고 있음을 확인하였다. 따라서 현재 사용되고 있는 단백질 수명 예측 프로그램은 이런 문제점을 가지고 있기 때문에 새로운 예측 알고리즘의 개발이 요구된다.

  • PDF

A Post-analysis of the Association Rule Mining Applied to Internee Shopping Mall

  • Kim, Jae-Kyeong;Song, Hee-Seok
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2001.06a
    • /
    • pp.253-260
    • /
    • 2001
  • Understanding and adapting to changes of customer behavior is an important aspect for a company to survive in continuously changing environment. The aim of this paper is to develop a methodology which detects changes of customer behavior automatically from customer profiles and sales data at different time snapshots. For this purpose, we first define three types of changes as emerging pattern, unexpected change and the added / perished rule. Then we develop similarity and difference measures for rule matching to detect all types of change. Finally, the degree of change is evaluated to detect significantly changed rules. Our proposed methodology can evaluate degree of changes as well as detect all kinds of change automatically from different time snapshot data. A case study for evaluation and practical business implications for this methodology are also provided.

  • PDF

Pattern Analysis of Nonconforming Farmers in Residual Pesticides using Exploratory Data Analysis and Association Rule Analysis (탐색적 자료 분석 및 연관규칙 분석을 활용한 잔류농약 부적합 농업인 유형 분석)

  • Kim, Sangung;Park, Eunsoo;Cho, Hyunjeong;Hong, Sunghie;Sohn, Byungchul;Hong, Jeehwa
    • Journal of Korean Society for Quality Management
    • /
    • v.49 no.1
    • /
    • pp.81-95
    • /
    • 2021
  • Purpose: The purpose of this study was to analysis pattern of nonconforming farmers who is one of the factors of unconformity in residual pesticides. Methods: Pattern analysis of nonconforming farmers were analyzed through convergence of safety data and farmer's DB data. Exploratory data analysis and association rule analysis were used for extracting factors related to unconformity. Results: The results of this study are as follows; regarding the exploratory data analysis, it was found that factors of farmers influencing unconformity in residual pesticides by total 9 factors; sampling time, gender, age, cultivation region, farming career, agricultural start form, type of agriculture, cultivation area, classification of agricultural products. Regarding the association rule analysis, non-conformity association rules were found over the past three years. There was a difference in the pattern of nonconforming farmers depending on the cultivation period. Conclusion: Exploratory data analysis and association rule analysis will be useful tools to establish more efficient and economical safety management plan for agricultural products.

Statistical Decision making of Association Threshold in Association Rule Data Mining

  • Park, Hee-Chang;Song, Geum-Min
    • Journal of the Korean Data and Information Science Society
    • /
    • v.13 no.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

Statistical Decision making of Association Threshold in Association Rule Data Mining

  • Park, Hee-Chang;Song, Geum-Min
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 2002.06a
    • /
    • pp.169-182
    • /
    • 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 can calculate the range of the value that two item sets are occurred simultaneously, and can find the minimum confidence threshold values.

  • PDF

Comparison of Association Rule Learning and Subgroup Discovery for Mining Traffic Accident Data (교통사고 데이터의 마이닝을 위한 연관규칙 학습기법과 서브그룹 발견기법의 비교)

  • Kim, Jeongmin;Ryu, Kwang Ryel
    • Journal of Intelligence and Information Systems
    • /
    • v.21 no.4
    • /
    • pp.1-16
    • /
    • 2015
  • Traffic accident is one of the major cause of death worldwide for the last several decades. According to the statistics of world health organization, approximately 1.24 million deaths occurred on the world's roads in 2010. In order to reduce future traffic accident, multipronged approaches have been adopted including traffic regulations, injury-reducing technologies, driving training program and so on. Records on traffic accidents are generated and maintained for this purpose. To make these records meaningful and effective, it is necessary to analyze relationship between traffic accident and related factors including vehicle design, road design, weather, driver behavior etc. Insight derived from these analysis can be used for accident prevention approaches. Traffic accident data mining is an activity to find useful knowledges about such relationship that is not well-known and user may interested in it. Many studies about mining accident data have been reported over the past two decades. Most of studies mainly focused on predict risk of accident using accident related factors. Supervised learning methods like decision tree, logistic regression, k-nearest neighbor, neural network are used for these prediction. However, derived prediction model from these algorithms are too complex to understand for human itself because the main purpose of these algorithms are prediction, not explanation of the data. Some of studies use unsupervised clustering algorithm to dividing the data into several groups, but derived group itself is still not easy to understand for human, so it is necessary to do some additional analytic works. Rule based learning methods are adequate when we want to derive comprehensive form of knowledge about the target domain. It derives a set of if-then rules that represent relationship between the target feature with other features. Rules are fairly easy for human to understand its meaning therefore it can help provide insight and comprehensible results for human. Association rule learning methods and subgroup discovery methods are representing rule based learning methods for descriptive task. These two algorithms have been used in a wide range of area from transaction analysis, accident data analysis, detection of statistically significant patient risk groups, discovering key person in social communities and so on. We use both the association rule learning method and the subgroup discovery method to discover useful patterns from a traffic accident dataset consisting of many features including profile of driver, location of accident, types of accident, information of vehicle, violation of regulation and so on. The association rule learning method, which is one of the unsupervised learning methods, searches for frequent item sets from the data and translates them into rules. In contrast, the subgroup discovery method is a kind of supervised learning method that discovers rules of user specified concepts satisfying certain degree of generality and unusualness. Depending on what aspect of the data we are focusing our attention to, we may combine different multiple relevant features of interest to make a synthetic target feature, and give it to the rule learning algorithms. After a set of rules is derived, some postprocessing steps are taken to make the ruleset more compact and easier to understand by removing some uninteresting or redundant rules. We conducted a set of experiments of mining our traffic accident data in both unsupervised mode and supervised mode for comparison of these rule based learning algorithms. Experiments with the traffic accident data reveals that the association rule learning, in its pure unsupervised mode, can discover some hidden relationship among the features. Under supervised learning setting with combinatorial target feature, however, the subgroup discovery method finds good rules much more easily than the association rule learning method that requires a lot of efforts to tune the parameters.

Association rule mining for intertransactions with considering fairly data semantics (데이터의 의미적 정보를 공정하게 반영한 인터트랜잭션들에 대한 연관규칙 탐사)

  • Ceong, Hyi-Thaek
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.9 no.3
    • /
    • pp.359-368
    • /
    • 2014
  • Recently, to reflect the context between transactions, the intertransaction association rule mining has been study. In this study, we present two problems that is within intertransaction association rule mining method and suggest the methods to solve this problems. First, we suggest an algorithm to reflect changes on data between transactions. Second, we propose the method to solve the unfairly considered frequency of data when intertransactions is generate with transactions. We make more meaningful rules than previous researches. We present the experiment result with measured data from the marine environment.