Abstract

The large-scale data parallelism processing is an inherent characteristic of artificial neural networks, but the networks bring the efficiency problems of data processing. As one of the artificial neural networks, Radial Basis Function (RBF) neural networks have the same problem. Therefore, how to reduce the scale of data to improve the efficiency of data processing has been a hot issue among the artificial intelligence scholars. Based on the traditional RBF neural networks, this paper puts forward a method which determines the important degree of the sample attributes based on knowledge entropy of Rough set by analyzing the relationship between the knowledge entropy and the weight of the sample attributes, and assesses the importance of the sample attributes between the input layer and the hidden layer, namely the attribution reduction, so as to achieve reduce the scale of data processing. The ultimate aim of training RBF neural networks is to seek a set of suitable networks parameters which makes the sample output error achieve the minimum or required accuracy, while Genetic Algorithm (GA) has the properties of finding out the optimal solution through multiplepoint random search in the solution space, so Genetic Algorithm is used to optimize the centers, the widths and the weights between the hidden layer and the output layer of RBF neural networks in training the networks. Finally, a model about A Rough RBF Neural Networks Optimized by the Genetic Algorithm (GA-RS-RBF) is proposed in this paper. The simulation results show that the rough RBF neural network optimized by the Genetic Algorithm is better than the traditional RBF neural networks in classification about Iris datasets.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.