Optimization of Machine Learning Process Using Parallel Computing

• Autorzy: Grzeszczyk Michał K.

Identyfikatory

DOI

10.12913/22998624/100341

• Języki publikacji: EN

Abstrakty

EN

The aim of this paper is to discuss the use of parallel computing in the supervised machine learning processes in order to reduce the computation time. This way of computing has gained popularity because sequential computing is often insufficient for large scale problems like complex simulations or real time tasks. After presenting the foundations of machine learning and neural network algorithms as well as three types of parallel models, the author briefly characterized the development of the experiments carried out and the results obtained. The experiments on image recognition, ran on five sets of empirical data, prove a significant reduction in calculation time compared to classical algorithms. At the end, possible directions of further research concerning parallel optimization of calculation time in the supervised perceptron learning processes were shortly outlined.

Słowa kluczowe

EN

parallel computing; machine learning; perceptron; neural networks; OpenMP

• Wydawca: Lublin University of Technology ; Polish Society of Ecological Engineering (PTIE), Branch of PTIE in Lublin
• Czasopismo: Advances in Science and Technology. Research Journal
• Rocznik: 2018
• Tom: Vol. 12, no 4
• Strony: 81--87
• Opis fizyczny: Bibliogr. 20 poz., fig., tab.

Twórcy

autor

Grzeszczyk Michał K.

• Faculty of Electronics and Information Technology, Warsaw University of Technology, Nowowiejska 15/19, 00-665 Warsaw, Poland

Bibliografia

• 1. Abu-Aisheh Z., Raveaux R., Ramel J. -Y., Martineau P., A parallel graph edit distance algorithm Expert Systems with Applications, Volume 94, 15 March 2018, 41–57.
• 2. Akhter S., Roberts J., OpenMP: A Portable Solution for Threading. OpenMP provides an easy method for threading applications without burdening the programmer, 2010, http://drdobbs.com/ high-performance-computing/225702895 (access: September 2018).
• 3. Bernstein A. J., Program Analysis for Parallel Processing, IEEE Transactions on Electronic Computers, EC-15, 1996, 757–762.
• 4. Bhugul A. M., International Journal of Computer Science and Mobile Computing, Vol. 6, Issue2, February, 2017, 90–94.
• 5. Colombet L., Desbat L., Speedup and efficiency of large-size applications on heterogeneous networks, Theoretical Computer Science, Volume 196, Issues 1–2, 6 April 1998, 31–44.
• 6. Devroye, L., Gyorfi, L., Lugosi, G., A probabilistic theory of pattern recognition. Springer: New York, 1996.
• 7. Duda R. O., Stork D. G., Hart P. E., Pattern Classification, New York: John Wiley & Sons 2001.
• 8. Freund, Y., Schapire, R. E., Large margin classification using the perceptron algorithm. Machine Learning. 37 (3), 1999, 277–296.
• 9. Głowacz A., Pietroń M., Implementation of Digital Watermarking Algorithms in Parallel Hardware Accelerators, International Journal of Parallel Programming, October 2017, Volume 45, Issue 5, 2017, 1108–1127.
• 10. Gropp W., Lusk E., Doss N., Skjellum A., A high-performance, portable implementation of the MPI message passing interface standard, Parallel Computing. Volume 22, Issue 6, September, 1996, 789–828.
• 11. Grzeszczyk T. A., Neural Networks Usage in the Evaluation of European Union Cofinanced Projects, Foundations of Management, Volume 2, Issue 1, 2010, 7–20.
• 12. Inderpal S., Review on parallel and distributed computing. Scholars Journal of Engineering and Technology, 1(4), 2013, 218–25.
• 13. Kang S. J., Lee S. Y., Lee K. M., Performance comparison of OpenMP, MPI, and MapReduce in practical problems, Adv. Multimedia, 2015, 1–9.
• 14. Mohri M., Rostamizadeh A., Perceptron Mistake Bounds, 2013, arXiv preprint, https://arxiv.org/ abs/1305.0208 (access: September 2018).
• 15. Moore R. K. Nicolao M., Toward a Needs-Based Architecture for ‘Intelligent’ Communicative Agents: Speaking with Intention, Frontiers in Robotics and AI, Volume: 4, Article Number: 66, Dec 2017.
• 16. Rosenblatt, F., The perceptron: A probabilistic model for information storage and organization in the brain. Psychological Review, 65(6), 1958, 386–408.
• 17. Russo A., Sabelfeld, A., Securing Interaction between Threads and the Scheduler in the Presence of Synchronization, The Journal of Logic and Algebraic Programming, Volume 78, Issue 7, August– September 2009, 593–618.
• 18. Sathya, R. and Abraham, A., Comparison of Supervised and Unsupervised Learning Algorithms for Pattern Classification. International Journal of Advanced Research in Artificial Intelligence, 2, 2013, 34–38.
• 19. Stilgoe J., Machine learning, social learning and the governance of self-driving cars, Social Studies of Science, February 2018, Volume: 48, Issue: 1, 25–56.
• 20. Xian-He Sun, Lionel M. Ni, Another view on parallel speedup, Proceedings of the 1990 ACM/IEEE conference on Supercomputing, October 1990, New York, USA, 324–333.

Uwagi

Opracowanie rekordu w ramach umowy 509/P-DUN/2018 ze środków MNiSW przeznaczonych na działalność upowszechniającą naukę (2018).