The classification tries to assign the best category to given unknown records based on previous observations. It is clear that with the growing amount of data, any classification algorithm can be very slow. The learning speed of many developed state-of-the-art algorithms like deep neural networks or support vector machines is very low. Evolutionary-based approaches in classification have the same problem.This paper describes five different evolutionary-based approaches that solve the classification problem and run in real time. This was achieved by using GPU parallelization. These classifiers are evaluated on two collections that contains millions of records. The proposed parallel approach is much faster and preserve the same precision as a serial version.
CITATION STYLE
Ježowicz, T., Buček, P., Platoš, J., & Snášel, V. (2016). Evolutionary algorithms for fast parallel classification. In Advances in Intelligent Systems and Computing (Vol. 403, pp. 659–670). Springer Verlag. https://doi.org/10.1007/978-3-319-26227-7_62
Mendeley helps you to discover research relevant for your work.