• Communications for Statistical Applications and Methods
• /
• v.7 no.3
• /
• pp.937-943
• /
• 2000

Data mining usually deal with undesigned massive data containing many variables for which their characteristics and association rules are unknown, therefore it is actually not easy to interpret the results of analysis. In this paper, it is shown that decision tree can be very useful in interpreting data mining prediction model using two real examples.

• Journal of the Korea Society for Simulation
• /
• v.19 no.4
• /
• pp.59-66
• /
• 2010

We present a personalized clothing recommender system - one that mines association rules from transaction described in ontologies and infers a recommendation from the rules. The recommender system can forecast frequently changing trends of clothing using the Onto-Apriori algorithm, and it makes appropriate recommendations for each users possible through the inference marked as meta nodes. We simulates the rule generator and the inferential search engine of the system with focus on accuracy and efficiency, and our results validate the system.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.4
• /
• pp.895-907
• /
• 1997

The mining of assciation rules disovers the trndency of events ocuring simultaneously in large databases. Previous announced research on association rules deals with associations with associations with respect to the whole transaction. However, xome association rules could have very high confidence in a sub-range of the time domain, even though they do not have quite high confidence in the whole time domain. Such kind of association rules are ecpected to be very usdful in various decion making problems.In this paper, we define transient association rule, as an association with high cimfidence worthy of special attention in a partial time interval, and propose an dfficeint algorithm wich finds out the time intervals appropriate to transient association rules from large-databases.We propose the data-driven retrival method excluding unecessary interval search, and design an effective data structure manageable in main memory obtined by one scanning of database, which offers the necessary information to next retrieval phase. In addition, our simulation shows that the suggested algorithm has reliable performance at the time cost acceptable in application areas.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.1
• /
• pp.60-64
• /
• 2010

To discover association rules from nontransactional data, there have been many studies on discretization of attribute values. These studies do not reflect the change of discovered rules' confidence according to the change of the ranges of the discretized attributes, and perform the discretization stage and the rule discovery stage independently. This causes the ranges of attributes not properly discretized, thereby making the rules having high confidence excluded in the result set. To solve this problem, we propose a novel method that performs the discretization and rule discovery stages simultaneously in order to discretize ranges of attributes in such a way that the rules having high confidence are discovered well. To the end, we perform hierarchical clustering on the attributes in the right hand side of rules, then do characterization on every cluster thus obtained. The experimental result demonstrates that our method discovers the rules having high confidence better than existing methods.

• The Journal of Information Systems
• /
• v.31 no.3
• /
• pp.177-195
• /
• 2022

Purpose This paper aims to prepare a full operational readiness by establishing an optimal flight plan considering the weather conditions in order to effectively perform the mission and operation of military aircraft. This paper suggests a flight prediction model and rules by analyzing the correlation between flight implementation and cancellation according to weather conditions by using big data collected from historical flight information of military aircraft supplied by Korean manufacturers and meteorological information from the Korea Meteorological Administration. In addition, by deriving flight rules according to weather information, it was possible to discover an efficient flight schedule establishment method in consideration of weather information. Design/methodology/approach This study is an analytic study using data mining techniques based on flight historical data of 44,558 flights of military aircraft accumulated by the Republic of Korea Air Force for a total of 36 months from January 2013 to December 2015 and meteorological information provided by the Korea Meteorological Administration. Four steps were taken to develop optimal flight prediction models and to derive rules for flight implementation and cancellation. First, a total of 10 independent variables and one dependent variable were used to develop the optimal model for flight implementation according to weather condition. Second, optimal flight prediction models were derived using algorithms such as logistics regression, Adaboost, KNN, Random forest and LightGBM, which are data mining techniques. Third, we collected the opinions of military aircraft pilots who have more than 25 years experience and evaluated importance level about independent variables using Python heatmap to develop flight implementation and cancellation rules according to weather conditions. Finally, the decision tree model was constructed, and the flight rules were derived to see how the weather conditions at each airport affect the implementation and cancellation of the flight. Findings Based on historical flight information of military aircraft and weather information of flight zone. We developed flight prediction model using data mining techniques. As a result of optimal flight prediction model development for each airbase, it was confirmed that the LightGBM algorithm had the best prediction rate in terms of recall rate. Each flight rules were checked according to the weather condition, and it was confirmed that precipitation, humidity, and the total cloud had a significant effect on flight cancellation. Whereas, the effect of visibility was found to be relatively insignificant. When a flight schedule was established, the rules will provide some insight to decide flight training more systematically and effectively.

• 한국데이터정보과학회:학술대회논문집
• /
• 2004.04a
• /
• 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.

• Journal of the Korean Data and Information Science Society
• /
• v.21 no.6
• /
• pp.1147-1154
• /
• 2010

One of the important goals in data mining is to discover and decide the relationships between different variables. Association rules are required for this technique and it find meaningful rules by quantifying the relationship between two items based on association measures such as support, confidence, and lift. In this paper, we presented the evaluation criteria of weighted association rule considering item RFM scores as importance of items. Original RFM technique has been used most widely applied method using customer information to find the most profitable customers. And then we compared general association rule technique with weighted association rule technique through the simulation data.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.43
• /
• pp.265-276
• /
• 1997

There have been many studies on efficient discovery of association rules in large databases. However, it is nontrivial to maintain such discovered rules in large databases because a database may allow frequent or occasional updates and such updates may not only invalidate some existing strong association rules but also turn some weak rules into strong ones. The major idea of updating algorithm is to resuse the information of the old large itemsets and to integrate the support information of the new large itemsets in order to substantially reduce the pool of candidate sets to be re-exmained. In this paper, an updating algorithm is proposed for efficient maintenance of discovered assocation rules when new transaction data are added to a transaction database. And superiority of the proposed updating algorithm will be shown by comparing with FUP algorithm that was already proposed.

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

• 한국데이터정보과학회:학술대회논문집
• /
• 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.