Research of mining meta-association rules for dynamic association rule based on model of Grey-Markov

2009 ◽  
Vol 28 (9) ◽  
pp. 2353-2356 ◽  
Author(s):  
Jun LIU ◽  
Yan-feng XIE ◽  
Zhong-lin ZHANG ◽  
Li-min JIA
2011 ◽  
Vol 317-319 ◽  
pp. 1868-1871
Author(s):  
Jian Hong Li

This paper focuses on an important research topic in data mining (DM) which heavily replies on the association rules. In order to deal with the maintenance issues within the background of the static transaction database, there are some minor changes to minimum support and confidence coefficient. A novel algorithm based on incremental updated is proposed, which is termed as NIUA (Novel Incremental Updating Algorithm). IUA uses association rules to mining the database, aiming at finding the potential information or finding the reasons from massive data.


2014 ◽  
Vol 8 (1) ◽  
pp. 303-307 ◽  
Author(s):  
Zhonglin Zhang ◽  
Zongcheng Liu ◽  
Chongyu Qiao

A method of tendency mining in dynamic association rule based on compatibility feature vector SVM classifier is proposed. Firstly, the class association rule set named CARs is mined by using the method of tendency mining in dynamic association rules. Secondly, the algorithm of SVM is used to construct the classifier based on compatibility feature vector to classify the obtained CARs taking advantage when dealing with high complex data. It uses a method based on judging rules’ weight to construct the model. At last, the method is compared with the traditional methods with respect to the mining accuracy. The method can solve the problem of high time complexity and have a higher accuracy than the traditional methods which is helpful to make mining dynamic association rules more accurate and effective. By analyzing the final results, it is proved that the method has lower complexity and higher classification accuracy.


2019 ◽  
Vol 9 (22) ◽  
pp. 4962
Author(s):  
Chao Ou-Yang ◽  
Chandrawati Putri Wulandari ◽  
Mohammad Iqbal ◽  
Han-Cheng Wang ◽  
Chiehfeng Chen

Today, patients generate a massive amount of health records through electronic health records (EHRs). Extracting usable knowledge of patients’ pathological conditions or diagnoses is essential for the reasoning process in rule-based systems to support the process of clinical decision making. Association rule mining is capable of discovering hidden interesting knowledge and relations among attributes in datasets, including medical datasets, yet is more likely to produce many anomalous rules (i.e., subsumption and circular redundancy) depends on the predefined threshold, which lead to logical errors and affects the reasoning process of rule-based systems. Therefore, the challenge is to develop a method to extract concise rule bases and improve the coverage of non-anomalous rule bases, i.e., one that not only reduces anomalous rules but also finds the most comprehensive rules from the dataset. In this study, we generated non-anomalous association rules (NAARs) from a cerebrovascular examination dataset through several steps: obtaining a frequent closed itemset, generating association rule bases, subsumption checking, and circularity checking, to fit production rules (PRs) in rule-based systems. Toward the end, the rule inferencing part was performed by PROLOG to obtain possible conclusions toward a specific query given by a user. The experiment shows that compared with the traditional method, the proposed method eliminated a significant number of anomalous rules while improving computational time.


2018 ◽  
Vol 2018 ◽  
pp. 1-16 ◽  
Author(s):  
Zhicong Kou ◽  
Lifeng Xi

An effective data mining method to automatically extract association rules between manufacturing capabilities and product features from the available historical data is essential for an efficient and cost-effective product development and production. This paper proposes a new binary particle swarm optimization- (BPSO-) based association rule mining (BPSO-ARM) method for discovering the hidden relationships between machine capabilities and product features. In particular, BPSO-ARM does not need to predefine thresholds of minimum support and confidence, which improves its applicability in real-world industrial cases. Moreover, a novel overlapping measure indication is further proposed to eliminate those lower quality rules to further improve the applicability of BPSO-ARM. The effectiveness of BPSO-ARM is demonstrated on a benchmark case and an industrial case about the automotive part manufacturing. The performance comparison indicates that BPSO-ARM outperforms other regular methods (e.g., Apriori) for ARM. The experimental results indicate that BPSO-ARM is capable of discovering important association rules between machine capabilities and product features. This will help support planners and engineers for the new product design and manufacturing.


Sign in / Sign up

Export Citation Format

Share Document