Mining associative classification rules with stock trading data – A GA-based method

2010 ◽  
Vol 23 (6) ◽  
pp. 605-614 ◽  
Author(s):  
Ya-Wen Chang Chien ◽  
Yen-Liang Chen
2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Zhongmei Zhou

A good classifier can correctly predict new data for which the class label is unknown, so it is important to construct a high accuracy classifier. Hence, classification techniques are much useful in ubiquitous computing. Associative classification achieves higher classification accuracy than some traditional rule-based classification approaches. However, the approach also has two major deficiencies. First, it generates a very large number of association classification rules, especially when the minimum support is set to be low. It is difficult to select a high quality rule set for classification. Second, the accuracy of associative classification depends on the setting of the minimum support and the minimum confidence. In comparison with associative classification, some improved traditional rule-based classification approaches often produce a classification rule set that plays an important role in prediction. Thus, some improved traditional rule-based classification approaches not only achieve better efficiency than associative classification but also get higher accuracy. In this paper, we put forward a new classification approach called CMR (classification based on multiple classification rules). CMR combines the advantages of both associative classification and rule-based classification. Our experimental results show that CMR gets higher accuracy than some traditional rule-based classification methods.


Big Data is a current burning challenge for the data analytics research community. Many conventional data analytics techniques have been extended to the MapReduce framework to process Big Data. But in our literature review, we find that for the MapReduce system there is an absolute lack of rough setbased technique. To facilitate this and recognize the importance of the rule-based classification techniques, we suggest a roughset associative classification rules extraction process for the MapReduce framework. The implementation and evaluation of the Big Data Standard data set demonstrated the efficiency of our suggested approach.


Author(s):  
Sung Ho Ha

Hospital information systems have been frustrated by problems that include congestion, long wait time, and delayed patient care over decades. To solve these problems, data mining techniques have been used in medical research for many years and are known to be effective. Therefore, this study examines building a hybrid data mining methodology, combining medical domain knowledge and associative classification rules. Real world emergency data are collected from a hospital and the methodology is evaluated by comparing it with other techniques. The methodology is expected to help physicians to make rapid and accurate diagnosis of chest diseases.


Author(s):  
Madhabananda Das ◽  
Rahul Roy ◽  
Satchidananda Dehuri ◽  
Sung-Bae Cho

Associative classification rule mining (ACRM) methods operate by association rule mining (ARM) to obtain classification rules from a previously classified data. In ACRM, classifiers are designed through two phases: rule extraction and rule selection. In this paper, the ACRM problem is treated as a multi-objective problem rather than a single objective one. As the problem is a discrete combinatorial optimization problem, it was necessary to develop a binary multi-objective particle swarm optimization (BMOPSO) to optimize the measure like coverage and confidence of association rule mining (ARM) to extract classification rules in rule extraction phase. In rule selection phase, a small number of rules are targeted from the extracted rules by BMOPSO to design an accurate and compact classifier which can maximize the accuracy of the rule sets and minimize their complexity simultaneously. Experiments are conducted on some of the University of California, Irvine (UCI) repository datasets. The comparative result of the proposed method with other standard classifiers confirms that the new proposed approach can be a suitable method for classification.


2011 ◽  
Vol 2 (2) ◽  
pp. 51-73 ◽  
Author(s):  
Madhabananda Das ◽  
Rahul Roy ◽  
Satchidananda Dehuri ◽  
Sung-Bae Cho

Associative classification rule mining (ACRM) methods operate by association rule mining (ARM) to obtain classification rules from a previously classified data. In ACRM, classifiers are designed through two phases: rule extraction and rule selection. In this paper, the ACRM problem is treated as a multi-objective problem rather than a single objective one. As the problem is a discrete combinatorial optimization problem, it was necessary to develop a binary multi-objective particle swarm optimization (BMOPSO) to optimize the measure like coverage and confidence of association rule mining (ARM) to extract classification rules in rule extraction phase. In rule selection phase, a small number of rules are targeted from the extracted rules by BMOPSO to design an accurate and compact classifier which can maximize the accuracy of the rule sets and minimize their complexity simultaneously. Experiments are conducted on some of the University of California, Irvine (UCI) repository datasets. The comparative result of the proposed method with other standard classifiers confirms that the new proposed approach can be a suitable method for classification.


Sign in / Sign up

Export Citation Format

Share Document