• Title/Summary/Keyword: Association rule mining

Search Result 351, Processing Time 0.029 seconds

Study of Temporal Data Mining for Transformer Load Pattern Analysis (변압기 부하패턴 분석을 위한 시간 데이터마이닝 연구)

  • Shin, Jin-Ho;Yi, Bong-Jae;Kim, Young-Il;Lee, Heon-Gyu;Ryu, Keun-Ho
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.11
    • /
    • pp.1916-1921
    • /
    • 2008
  • This paper presents the temporal classification method based on data mining techniques for discovering knowledge from measured load patterns of distribution transformers. Since the power load patterns have time-varying characteristics and very different patterns according to the hour, time, day and week and so on, it gives rise to the uninformative results if only traditional data mining is used. Therefore, we propose a temporal classification rule for analyzing and forecasting transformer load patterns. The main tasks include the load pattern mining framework and the calendar-based expression using temporal association rule and 3-dimensional cube mining to discover load patterns in multiple time granularities.

A study on insignificant rules discovery in association rule mining (연관성규칙에서 의미 없는 규칙의 발견에 관한 연구)

  • Cho, Kwang-Hyun;Park, Hee-Chang
    • Journal of the Korean Data and Information Science Society
    • /
    • v.22 no.1
    • /
    • pp.81-88
    • /
    • 2011
  • Association rule mining searches for interesting relationships among items in a given database. There are three primary quality measures for association rule, support and confidence and lift. In order to improve the efficiency of existing mining algorithms, constraints were applied during the mining process to generate only those association rules that are interesting to users instead of all the association rules. When we create relation rule, we can often find a lot of rules. This can find rule that direct relativity by intervening variable does not exist. In this study we try to discovery an insignificant rule in association rules by intervening variable. Result of this study can understand relativity about rule that is created in relation rule more exactly.

Industrial Waste Database Analysis Using Data Mining Techniques

  • Cho, Kwang-Hyun;Park, Hee-Chang
    • Journal of the Korean Data and Information Science Society
    • /
    • v.17 no.2
    • /
    • pp.455-465
    • /
    • 2006
  • 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, and relation to new rule. The methods of data mining are decision tree, association rules, clustering, neural network and so on. We analyze industrial waste database using data mining technique. We use k-means algorithm for clustering and C5.0 algorithm for decision tree and Apriori algorithm for association rule. We can use these outputs for environmental preservation and environmental improvement.

  • PDF

Industrial Waste Database Analysis Using Data Mining

  • Cho, Kwang-Hyun;Park, Hee-Chang
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 2006.04a
    • /
    • pp.241-251
    • /
    • 2006
  • 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 decision tree, association rules, clustering, neural network and so on. We analyze industrial waste database using data mining technique. We use k-means algorithm for clustering and C5.0 algorithm for decision tree and Apriori algorithm for association rule. We can use these analysis outputs for environmental preservation and environmental improvement.

  • PDF

A New Association Rule Mining based on Coverage and Exclusion for Network Intrusion Detection (네트워크 침입 탐지를 위한 Coverage와 Exclusion 기반의 새로운 연관 규칙 마이닝)

  • Tae Yeon Kim;KyungHyun Han;Seong Oun Hwang
    • Journal of Internet of Things and Convergence
    • /
    • v.9 no.1
    • /
    • pp.77-87
    • /
    • 2023
  • Applying various association rule mining algorithms to the network intrusion detection task involves two critical issues: too large size of generated rule set which is hard to be utilized for IoT systems and hardness of control of false negative/positive rates. In this research, we propose an association rule mining algorithm based on the newly defined measures called coverage and exclusion. Coverage shows how frequently a pattern is discovered among the transactions of a class and exclusion does how frequently a pattern is not discovered in the transactions of the other classes. We compare our algorithm experimentally with the Apriori algorithm which is the most famous algorithm using the public dataset called KDDcup99. Compared to Apriori, the proposed algorithm reduces the resulting rule set size by up to 93.2 percent while keeping accuracy completely. The proposed algorithm also controls perfectly the false negative/positive rates of the generated rules by parameters. Therefore, network analysts can effectively apply the proposed association rule mining to the network intrusion detection task by solving two issues.

Exploration of Association Rules for Social Survey Data

  • Park, Hee-Chang;Cho, Kwang-Hyun
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 2005.04a
    • /
    • 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

Application of k-means Clustering for Association Rule Using Measure of Association

  • Lee, Keun-Woo;Park, Hee-Chang
    • 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.

  • PDF

A Study for Antecedent Association Rules

  • Park, Hee-Chang;Cho, Kwang-Hyun
    • Journal of the Korean Data and Information Science Society
    • /
    • v.17 no.4
    • /
    • pp.1077-1083
    • /
    • 2006
  • 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 association rule mining based antecedent variables. We call these rules to antecedent association rules. An antecedent variable is a variable that occurs before the independent variable and the dependent variable.

  • PDF

Discovery of Association Rules Using Latent Variables

  • Park, Hee-Chang;Cho, Kwang-Hyun
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 2005.10a
    • /
    • pp.177-188
    • /
    • 2005
  • 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 threshold measures in association rule; support and confidence and lift. In the case of appling real world to association rules, we have some difficulties in data interpretation because we obtain many rules. In this paper, we develop the model of association rules using latent variables for environmental survey data.

  • PDF

Discovery of Association Rules Using Latent Variables

  • Park, Hee-Chang;Cho, Kwang-Hyun
    • Journal of the Korean Data and Information Science Society
    • /
    • v.17 no.1
    • /
    • pp.149-160
    • /
    • 2006
  • 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 threshold measures in association rule; support and confidence and lift. In the case of appling real world to association rules, we have some difficulties in data interpretation because we obtain many rules. In this paper, we develop the model of association rules using latent variables for environmental survey data.

  • PDF