Abstract :

Machine learning (ML) has grown at a remarkable rate, becoming one of the most popular research directions. It is widely applied in various fields, such as machine translation, speech recognition, image recognition, recommendation system, etc. Optimization  problems lie at the heart of most machine learning approaches. So, the essence of most ML algorithms is to build an optimization model and learn the parameters in the objective function from the given data. A series of effective optimization methods were put forward, in order to promote the development of ML. They have improved the performance and efficiency of ML methods. The aim of this paper is to show that, among many other fields, the grossone may be used successfully in the ML. The grossone, the infinite unit of measure, has been proposed by Professor Y. Sergeyev in a number of noticeable works, as the number of elements of the set, N, of natural numbers. It is expressed by the numeral . This new computational methodology would allow one to work with infinite and infinitesimal quantities in the ―same way‖ as that working with finite numbers  More details about it are given in Section 4. We analyze the SVM from the viewpoint of mathematical programming, solving a numerical example using the grossone. The Iris dataset was chosen for the implementation of the support vector method. This is a wellknown set of data used in the area of ML.

---

Keywords :

grossone, hyperplane., linear classifier, ML, Optimization, SVM

---

References :

1. Jaggi, Martin, 2011, Sparse Convex Optimization Methods for ML, https://doi.org/10.3929/ethz-a-007050453.
2. Kristin P. Bennett and Emilio Parrado-Hernández, 2006, The Interplay of Optimization and ML Research, Journal of ML Research 7, pp. 1265–1281.
3. Shiliang Sun, Zehui Cao, Han Zhu, and Jing Zhao, 2019,A Survey of Optimization Methods from a ML Perspective, arXiv:1906.06821v2 [cs.LG] 23.
4. Kim, 2014, Convolutional neural networks for sentence classification, in Conference on Empirical Methods in Natural Language Processing, pp. 1746–1751.
5. C. Ciresan, U. Meier, and J. Schmidhuber, 2012, Multi-column deep neural networks for image classification, in IEEE Conference on Computer Vision and Pattern Recognition, pp. 3642–3649.
6. A. Hartigan and M. A. Wong, 1979, Algorithm AS 136: A k-means clustering algorithm, Journal of the Royal Statistical Society. Series C (Applied Statistics), vol. 28, pp. 100–108.
7. Guo-Xun Yuan, Chia-Hua Ho, and Chih-Jen Lin, Recent Advances of Large-scale Linear Classification.
8. Witten, I., Frank, E., and Hall, M. 2011, Data Mining: Practical ML Tools and Techniques, The Morgan Kaufmann Series in Data Management Systems, Elsevier Science,.
9. Hamel, L. H. 2011, Knowledge discovery with support vector machines, vol. 3. John Wiley & Sons.
10. Rao, K., and Koolagudi, S. 2012, Emotion Recognition using Speech Features. SpringerBriefs in Electrical and Computer Engineering. Springer.
11. Fisher, R. A. 1936,The use of multiple measurements in taxonomic problems. Annals of eugenics 7, pp. 179-188.
12. Bache, K., and Lichman, M. 2013,Iris data set, http://archive.ics.uci.edu/ml/datasets/Iris.
13. Sonia De Cosmis, Renato De Leone, 2012, The use of Grossone in Mathematical Programming and Operations Research, arXiv:1107.5681v2 [math.OC].
14. Yaroslav D. Sergeyev. 2003, Arithmetic of Infinity. Edizioni Orizzonti Meridionali, CS.
15. Yaroslav D. Sergeyev. 2008, A new applied approach for executing computations with infinite and infinitesimal quantities. Informatica, 19(4), pp.

567–596.

16. Yaroslav D. Sergeyev. 2009, Numerical computations and mathematical modelling with infinite and infinitesimal numbers. Journal of Applied Mathematics and Computing, 29:177195.
17. Yaroslav D. Sergeyev.2009, Numerical point of view on calculus for functions assuming finite, infinite, and infinitesimal values over finite, infinite, and infinitesimal domains. Nonlinear Analysis Series A: Theory,Methods &Applications, 71(12):e1688e1707.
18. Nataliya Boyko and Rostyslav Hlynka, 2021, Application of Machine Algorithms for Classification and Formation of the Optimal Plan, COLINS-2021: 5th International Conference on Computational Linguistics and Intelligent Systems, April 22–23, 2021, Kharkiv, Ukraine.
19. https://svm.michalhaltuf.cz/linear-classifiers/
20. https://www.cs.cornell.edu/courses/cs4780/2018fa/lectures/lecturenote09.html
21. Bhaskaran, S.; Marappan, R.; Santhi, B. Design and Analysis of a Cluster-Based Intelligent Hybrid Recommendation System for E-Learning Applications. Mathematics 2021, 9, 197. https://doi.org/10.3390/math9020197
22. Marappan, R., Sethumadhavan, G. Solving Graph Coloring Problem Using Divide and Conquer-Based Turbulent Particle Swarm Optimization. Arab J Sci Eng (2021). https://doi.org/10.1007/s13369-021-06323-x
23. Bhaskaran, S.; Marappan, R.; Santhi, B. Design and Comparative Analysis of New Personalized Recommender Algorithms with Specific Features for Large Scale Datasets. Mathematics 2020, 8, 1106. https://doi.org/10.3390/math8071106
24. Marappan, R.; Sethumadhavan, G. Complexity Analysis and Stochastic Convergence of Some Well-known Evolutionary Operators for Solving Graph Coloring Problem. Mathematics 2020, 8, 303. https://doi.org/10.3390/math8030303
25. Marappan, R., Sethumadhavan, G. Solution to Graph Coloring Using Genetic and Tabu Search Procedures. Arab J Sci Eng 43, 525–542 (2018). https://doi.org/10.1007/s13369-017-2686-9
26. Marappan and G. Sethumadhavan, “Solving channel allocation problem using new genetic algorithm with clique partitioning method,” 2016 IEEE International Conference on Computational Intelligence and Computing Research (ICCIC), 2016, pp. 1-4, doi: 10.1109/ICCIC.2016.7919671.
27. Marappan and G. Sethumadhavan, “Solution to graph coloring problem using divide and conquer based genetic method,” 2016 International Conference on Information Communication and Embedded Systems (ICICES), 2016, pp. 1-5, doi: 10.1109/ICICES.2016.7518911.
28. Marappan and G. Sethumadhavan, “Divide and conquer based genetic method for solving channel allocation,” 2016 International Conference on Information Communication and Embedded Systems (ICICES), 2016, pp. 1-5, doi: 10.1109/ICICES.2016.7518914.
29. Raja Marappan, Gopalakrishnan Sethumadhavan , Solving Fixed Channel Allocation using Hybrid Evolutionary Method, MATEC Web of Conferences 57 02015 (2016) DOI: 10.1051/matecconf/20165702015
30. Sethumadhavan and R. Marappan, “A genetic algorithm for graph coloring using single parent conflict gene crossover and mutation with conflict gene removal procedure,” 2013 IEEE International Conference on Computational Intelligence and Computing Research, 2013, pp. 1-6, doi:

10.1109/ICCIC.2013.6724190.

31. Marappan and G. Sethumadhavan, “A New Genetic Algorithm for Graph Coloring,” 2013 Fifth International Conference on Computational Intelligence, Modelling and Simulation, 2013, pp. 49-54, doi: 10.1109/CIMSim.2013.17.