Acquisition of optimal attribute subset through genetic algorithm using GNP-based class association rule mining

2014 ◽  
Vol 9 (4) ◽  
pp. 398-406 ◽  
Author(s):  
Rong Zhang ◽  
Kaoru Shimada ◽  
Shingo Mabu ◽  
Kotaro Hirasawa
2012 ◽  
Vol 629 ◽  
pp. 730-734 ◽  
Author(s):  
Cun Liang Yan ◽  
Wei Feng Shi

Job shop scheduling problem (JSP) is the most typical scheduling problem, In the process of JSP based on genetic algorithm (GA), large amounts of data will be produced. Mining them to find the useful information is necessary. In this paper dividing, hashing and array (DHA) association rule mining algorithm is used to find the frequent itemsets which contained in the process, and extract the corresponding association rules. Concept hierarchy is used to interpret the rules, and lots of useful rules appeared. It provides a new way for JSP study.


Author(s):  
Leila Hamdad ◽  
Zakaria Ournani ◽  
Karima Benatchba ◽  
Ahcène Bendjoudi

2011 ◽  
Vol 4 (4) ◽  
pp. 295-304 ◽  
Author(s):  
Xianneng LI ◽  
Shingo MABU ◽  
Huiyu ZHOU ◽  
Kaoru SHIMADA ◽  
Kotaro HIRASAWA

2022 ◽  
Vol 13 (1) ◽  
pp. 0-0

Associative Classification (AC) or Class Association Rule (CAR) mining is a very efficient method for the classification problem. It can build comprehensible classification models in the form of a list of simple IF-THEN classification rules from the available data. In this paper, we present a new, and improved discrete version of the Crow Search Algorithm (CSA) called NDCSA-CAR to mine the Class Association Rules. The goal of this article is to improve the data classification accuracy and the simplicity of classifiers. The authors applied the proposed NDCSA-CAR algorithm on eleven benchmark dataset and compared its result with traditional algorithms and recent well known rule-based classification algorithms. The experimental results show that the proposed algorithm outperformed other rule-based approaches in all evaluated criteria.


Author(s):  
Huaifeng Zhang ◽  
Yanchang Zhao ◽  
Longbing Cao ◽  
Chengqi Zhang ◽  
Hans Bohlscheid

In this chapter, the authors propose a novel framework for rare class association rule mining. In each class association rule, the right-hand is a target class while the left-hand may contain one or more attributes. This algorithm is focused on the multiple imbalanced attributes on the left-hand. In the proposed framework, the rules with and without imbalanced attributes are processed in parallel. The rules without imbalanced attributes are mined through a standard algorithm while the rules with imbalanced attributes are mined based on newly defined measurements. Through simple transformation, these measurements can be in a uniform space so that only a few parameters need to be specified by user. In the case study, the proposed algorithm is applied in the social security field. Although some attributes are severely imbalanced, rules with a minority of imbalanced attributes have been mined efficiently.


Sign in / Sign up

Export Citation Format

Share Document