Classifier Ensembles Integration with Self-configuring Genetic Programming Algorithm

Author(s):  
Maria Semenkina ◽  
Eugene Semenkin
2018 ◽  
Vol 47 (4) ◽  
Author(s):  
Krzysztof Cpalka ◽  
Krystian Łapa ◽  
Andrzej Przybył

2012 ◽  
Vol 03 (03) ◽  
pp. 601-609 ◽  
Author(s):  
Seyed Morteza Marandi ◽  
Seyed Mahmood VaeziNejad ◽  
Elyas Khavari

Author(s):  
Sanhita Das ◽  
Narayana Raju ◽  
Akhilesh Kumar Maurya ◽  
Shriniwas Arkatkar

Complex maneuvering patterns are typical of motorized two-wheelers (MTWs), and their widespread adoption in many countries has spurred a growing response from transport researchers to model their dynamic behavior realistically. Considering the increased vulnerability of MTW drivers in dense urban mixed traffic systems, proper evaluation and modeling of lateral interactions between the drivers/riders moving abreast need to be addressed. A proper investigation can essentially help in understanding the behavioral aspects of riders in accepting shorter lateral clearances, design of exclusive motorcycle lanes, improved reliability of microsimulation models, and safety evaluation of the riders in a cognitive architecture. The current study therefore attempts to develop a novel symbolic regression model using a multigene genetic programming algorithm to generate and evaluate lateral clearance models naturally from field data for MTW interactions at mid-block sections, data being collected using video recorders. A binary logit model is initially developed to investigate the factors associated with the riders’ decisions to accept critical lateral clearances. Considering highly non-linear variations in data, the symbolic regression models were further developed and a comparison with the existing linear regression based lateral clearance models indicated that the symbolic model could generalize the non-linear structure of the data realistically and performed significantly better than the existing models.


Author(s):  
ZAHRA NIKDEL ◽  
HAMID BEIGY

In this paper, we introduce a new hybrid learning algorithm, called DTGP, to construct cost-sensitive classifiers. This algorithm uses a decision tree as its basic classifier and the constructed decision tree will be pruned by a genetic programming algorithm using a fitness function that is sensitive to misclassification costs. The proposed learning algorithm has been examined through six cost-sensitive problems. The experimental results show that the proposed learning algorithm outperforms in comparison to some other known learning algorithms like C4.5 or naïve Bayesian.


2001 ◽  
Vol 133 (3-4) ◽  
pp. 175-194 ◽  
Author(s):  
Yun Seog Yeun ◽  
Kyung Ho Lee ◽  
Sang Min Han ◽  
Young Soon Yang

Sign in / Sign up

Export Citation Format

Share Document