参考文献:1.Bishop, C.: Pattern recognition and machine learning. Springer (2006) 2.Cordón, O., Herrera, F., Hoffmann, F., Magdalena, L.: Genetic Fuzzy Systems: Evolutionary Tuning and Learning of Fuzzy Knowledge Bases. World Scientific, Singapore (2001)View Article 3.Herrera, F.: Genetic Fuzzy Systems: Taxonomy, Current Research Trends and Prospects. Evol. Intel. 1(1), 27-6 (2008)View Article MathSciNet 4.Semenkina, M., Semenkin, E.: Hybrid self-configuring evolutionary algorithm for automated design of fuzzy classifier. In: Tan, Y., Shi, Y., Coello, C.A. (eds.) ICSI 2014, Part I. LNCS, vol. 8794, pp. 310-17. Springer, Heidelberg (2014)View Article 5.Johansson, U., Lofstrom, T., Konig, R., Niklasson, L.: Building neural network ensembles using genetic programming. In: International Joint Conference on Neural Networks (2006) 6.Poli R., Langdon W.B., McPhee N.F.: A Field Guide to Genetic Programming. Published via http://?lulu.?com and freely available at http://?www.?gp-field-guide.?org.?uk (2008) 7.Semenkina, M., Semenkin, E.: Classifier ensembles integration with self-configuring genetic programming algorithm. In: Tomassini, M., Antonioni, A., Daolio, F., Buesser, P. (eds.) ICANNGA 2013. LNCS, vol. 7824, pp. 60-9. Springer, Heidelberg (2013)View Article 8.Z-Flores, E., Trujillo, L., Schütze, O., Legrand, P.: Evaluating the Effects of Local Search in Genetic Programming. In: Tantar, A.-A., et al (eds.) EVOLVE - A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation V. AISC, vol. 288, pp. 213-28. Springer, Heidelberg (2014) 9.Eskridge, B., Hougen, D.: Imitating success: A memetic crossover operator for genetic programming. In: Proceedings of the 2004 IEEE Congress on Evolutionary Computation (CEC 2004), pp. 809-15. IEEE Press (2004) 10.Wang, P., Tang, K., Tsang, E. P. K., Yao, X.: A memetic genetic programming with decision tree-based local search for classification problems. In: Proceedings of the 2011 IEEE Congress on Evolutionary Computation, pp. 917-24 (2011) 11.Semenkin, E., Semenkina, M.: Self-configuring genetic algorithm with modified uniform crossover operator. In: Tan, Y., Shi, Y., Ji, Z. (eds.) ICSI 2012, Part I. LNCS, vol. 7331, pp. 414-21. Springer, Heidelberg (2012)View Article 12.Finck, S., et al.: Real-Parameter Black-Box Optimization Benchmarking. Presentation of the noiseless functions. Technical Report Research Center PPE (2009) 13.Frank, A., Asuncion, A.: UCI Machine Learning Repository. University of California, School of Information and Computer Science, Irvine (2010). http://?archive.?ics.?uci.?edu/?ml 14.Huang, J.-J., Tzeng, G.-H., Ong, C.-S.: Two-Stage Genetic Programming (2SGP) for the Credit Scoring Model. Applied Mathematics and Computation 174, 1039-053 (2006)View Article MATH MathSciNet 15.Sergienko, R., Semenkin, E.: Michigan and pittsburgh methods combination for fuzzy classifier design with coevolutionary algorithm. In: IEEE Congress on Evolutionary Computation (CEC 2013), pp. 3252-259 (2013)
作者单位:Maria Semenkina (19) Eugene Semenkin (19)
19. Siberian State Aerospace University, Krasnoyarsk, Russia
丛书名:Advances in Swarm and Computational Intelligence
ISBN:978-3-319-20466-6
刊物类别:Computer Science
刊物主题:Artificial Intelligence and Robotics Computer Communication Networks Software Engineering Data Encryption Database Management Computation by Abstract Devices Algorithm Analysis and Problem Complexity
出版者:Springer Berlin / Heidelberg
ISSN:1611-3349
文摘
For a fuzzy classifier automated design a hybrid self-configuring evolutionary algorithm is implemented. For the tuning of linguistic variables a self-configuring genetic algorithm is used. Ensemble members and the ensembling method are generated automatically with the self-configuring genetic programming algorithm that does not need preliminary adjusting. A hybridization of self-configuring genetic programming algorithms with a local search in the space of trees is fulfilled to improve their performance for fuzzy rule bases and ensembles automated design. The local search is implemented with two neighbourhood systems, three strategies of tree scanning (“full- “incomplete-and “truncated- and two ways of movement between adjacent trees (transition by the first improvement and the steepest descent). The performance of all developed memetic algorithms is estimated on a representative set of test problems of the function approximation as well as on real-world classification problems. The numerical experiment results show the competitiveness of the approach proposed.