• Journal of the Korean Data and Information Science Society
• /
• v.16 no.3
• /
• pp.529-538
• /
• 2005

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. The methods of data mining are association rules, decision tree, clustering, neural network and so on. Association rule mining searches for interesting relationships among items in a riven large data set. 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. We analyze Gyeongnam social indicator survey data using association rule technique for environmental information discovery. We can use to environmental preservation and environmental improvement by association rule outputs.

• 한국데이터정보과학회:학술대회논문집
• /
• 2004.10a
• /
• pp.115-124
• /
• 2004

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. The methods of data mining are association rules, decision tree, clustering, neural network and so on. Association rule mining searches for interesting relationships among items in a given large data set. 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. We analyze Gyeongnam social indicator survey data using association rule technique for environmental information discovery. We can use to environmental preservation and environmental improvement by association rule outputs.

• 한국데이터정보과학회:학술대회논문집
• /
• 2003.10a
• /
• pp.197-213
• /
• 2003

One of the well-studied problems in data mining is the search for association rules. The goal of association rule mining is to find all the rules with support and confidence exceeding some user specified thresholds. In this paper we consider the relation between the measure of association and the criteria of association rule for ordinal data.

• The KIPS Transactions:PartD
• /
• v.8D no.4
• /
• pp.339-346
• /
• 2001

A problem for mining association rules under the interactive environments is to mine repeatedly association rules with the different minimum support. This problem includes all subproblems except on the facts that mine repeatedly association rules with the s믇 database. This paper proposed the efficient algorithms to improve the performance by using the information of the candidate large itemsets which calculate the previous association rules. The proposed algorithms were compared with the conventional algorithm with respect to the execution time. The comparisons show that the proposed algorithms achieve 10∼30% more gain than the conventional algorithm.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.577-586
• /
• 2001

Recently data mining, which is analyzing the stored data and discovering potential knowledge and information in large database is a key research topic in database research data In this paper, we study methods of discovering association rules which are one of data mining techniques. And we propose a technique of discovering association rules using the relative support to consider significant rare data which have the high relative support among some data. And we compare and evaluate existing methods and the proposed method of discovering association rules for discovering significant rare data.

• Proceedings of the IEEK Conference
• /
• 2003.07c
• /
• pp.2561-2564
• /
• 2003

Data mining is an effective method of the discovery of useful information such as rules and previously unknown patterns existing in large databases. The discovery of association rules is an important data mining problem. We have developed a new parallel mining called Distributed Frequent Pattern Tree (abbreviated by DFPT) algorithm on a distributed shared nothing parallel system to detect association rules. DFPT algorithm is devised for parallel execution of the FP-growth algorithm. It needs only two full disk data scanning of the database by eliminating the need for generating the candidate items. We have achieved good workload balancing throughout the mining process by distributing the work equally to all processors. We implemented the algorithm on a PC cluster system, and observed that the algorithm outperformed the Improved Count Distribution scheme.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2003.11a
• /
• pp.621-626
• /
• 2003

Mining association rules in web log files can be divided into two steps: 1) discovering frequent item sets in web data; 2) extracting association rules from the frequent item sets found in the previous step. This paper suggests an algorithm for finding frequent item sets efficiently The essence of the proposed algorithm is to transform transaction data files into matrix format. Our experimental results show that the suggested algorithm outperforms the Apriori algorithm, which is widely used to discover frequent item sets, in terms of scan frequency and execution time.

• The KIPS Transactions:PartD
• /
• v.11D no.3
• /
• pp.545-552
• /
• 2004

Association rules mining, which is one of data mining technologies, searches data among which are frequent and related to each other in database. But, although the data are not of frequent and rare in database, they have the enough worth of business information if the data ares important and strongly related to each other, In this paper, we propose the algorithm discovering association rules that consist of data, which are rare but, important and strongly related to each other in database. The proposed algorithm was evaluated through simulation. We found that the proposed algorithm discovered efficiently association rules among data, which are not frequent but, important.

• 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.

• Journal of the Korean Data and Information Science Society
• /
• v.19 no.3
• /
• pp.925-936
• /
• 2008

An association rule mining finds the relation among each items in massive volume database. In generating association rules, the researcher specifies the measurements randomly such as support, confidence and lift, and produces the rules. The rule is not produced if it is not suitable to the one any condition which is given value. For example, in case of a little small one than the value which a confidence value is specified but a support and lift's value is very high, this rule is meaningful rule. But association rule mining can not produce the meaningful rules in this case because it is not suitable to a given condition. Consequently, we creat insignificant error which is not selected to the meaningful rules. In this paper, we suggest clustering technique to association rule measures for finding effective association rules using measure of association.