Using PSO and RST to Predict the Resistant Capacity of Connections in Composite Structures

In this paper, a method is proposed that combines the methaheuristic Particle Swarm Optimization (PSO) with the Rough Set Theory (RST) to carry out the prediction of the resistant capacity of connectors (Q) in the branch of Civil Engineering. The k-NN method is used to calculate this value. A feature selection process is performed in order to develop a more efficient process to recover the similar cases; in this case, the feature selection is done by finding the weights to be associated with the predictive features that appear in the weighted similarity function used for recovering. In this paper we propose a new alternative for calculating the weights of the features based on extended RST to the case of continuous decision features. Experimental results show that the algorithm k-NN, PSO and the method for calculating the weight of the attributes constitute an effective technique for the function approximation problem.

[1]  Belur V. Dasarathy,et al.  Nearest Neighbour Editing and Condensing Tools–Synergy Exploitation , 2000, Pattern Analysis & Applications.

[2]  M Reyes Sierra,et al.  Multi-Objective Particle Swarm Optimizers: A Survey of the State-of-the-Art , 2006 .

[3]  Janez Demsar,et al.  Statistical Comparisons of Classifiers over Multiple Data Sets , 2006, J. Mach. Learn. Res..

[4]  Martin A. Riedmiller,et al.  CBR for State Value Function Approximation in Reinforcement Learning , 2005, ICCBR.

[5]  Carlos García-Martínez,et al.  Global and local real-coded genetic algorithms based on parent-centric crossover operators , 2008, Eur. J. Oper. Res..

[6]  Luc Lamontagne,et al.  Case-Based Reasoning Research and Development , 1997, Lecture Notes in Computer Science.

[7]  Francisco Herrera,et al.  A taxonomy for the crossover operator for real‐coded genetic algorithms: An experimental study , 2003, Int. J. Intell. Syst..

[8]  James Kennedy,et al.  Particle swarm optimization , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.

[9]  Jerzy W. Grzymala-Busse,et al.  Rough Sets , 1995, Commun. ACM.

[10]  Michael N. Vrahatis,et al.  Recent approaches to global optimization problems through Particle Swarm Optimization , 2002, Natural Computing.

[11]  Armin Stahl,et al.  Using Evolution Programs to Learn Local Similarity Measures , 2003, ICCBR.

[12]  Ramón López de Mántaras,et al.  Machine Learning from Examples: Inductive and Lazy Methods , 1998, Data Knowl. Eng..