Skip to main content
Erschienen in: Soft Computing 23/2020

25.07.2020 | Focus

The use of grossone in elastic net regularization and sparse support vector machines

verfasst von: Renato De Leone, Nadaniela Egidi, Lorella Fatone

Erschienen in: Soft Computing | Ausgabe 23/2020

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

New algorithms for the numerical solution of optimization problems involving the \(l_{0}\) pseudo-norm are proposed. They are designed to use a recently proposed computational methodology that is able to deal numerically with finite, infinite and infinitesimal numbers. This new methodology introduces an infinite unit of measure expressed by the numeral \(\textcircled {1}\) (grossone) and indicating the number of elements of the set \({\text {I}}\!{\text {N}}\), of natural numbers. We show how the numerical system built upon \(\textcircled {1}\) and the proposed approximation of the \(l_0\) pseudo-norm in terms of \(\textcircled {1}\) can be successfully used in the solution of elastic net regularization problems and sparse support vector machines classification problems.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Anhänge
Nur mit Berechtigung zugänglich
Literatur
Zurück zum Zitat Amaldi E, Kann V (1998) On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems. Theoret Comput Sci 209(1–2):237–260MathSciNetCrossRef Amaldi E, Kann V (1998) On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems. Theoret Comput Sci 209(1–2):237–260MathSciNetCrossRef
Zurück zum Zitat Amodio P, Iavernaro F, Mazzia F, Mukhametzhanov MS, Sergeyev YD (2017) A generalized Taylor method of order three for the solution of initial value problems in standard and infinity floating-point arithmetic. Math Comput Simul 141:24–39MathSciNetCrossRef Amodio P, Iavernaro F, Mazzia F, Mukhametzhanov MS, Sergeyev YD (2017) A generalized Taylor method of order three for the solution of initial value problems in standard and infinity floating-point arithmetic. Math Comput Simul 141:24–39MathSciNetCrossRef
Zurück zum Zitat Bradley PS, Mangasarian OL (1998) Feature selection via concave minimization and support vector machines. In: Proceedings of the fifteenth international conference on machine learning, ICML’98. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, pp 82–90 Bradley PS, Mangasarian OL (1998) Feature selection via concave minimization and support vector machines. In: Proceedings of the fifteenth international conference on machine learning, ICML’98. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, pp 82–90
Zurück zum Zitat Burdakov O, Kanzow C, Schwartz A (2016) Mathematical programs with cardinality constraints: reformulation by complementarity-type conditions and a regularization method. SIAM J Optim 26(1):397–425MathSciNetCrossRef Burdakov O, Kanzow C, Schwartz A (2016) Mathematical programs with cardinality constraints: reformulation by complementarity-type conditions and a regularization method. SIAM J Optim 26(1):397–425MathSciNetCrossRef
Zurück zum Zitat Caldarola F (2018) The Sierpinski curve viewed by numerical computations with infinities and infinitesimals. Appl Math Comput 318:321–328MATH Caldarola F (2018) The Sierpinski curve viewed by numerical computations with infinities and infinitesimals. Appl Math Comput 318:321–328MATH
Zurück zum Zitat Calude CS, Dumitrescu M (2020) Infinitesimal probabilities based on grossone. SN Comput Sci 1(1):36CrossRef Calude CS, Dumitrescu M (2020) Infinitesimal probabilities based on grossone. SN Comput Sci 1(1):36CrossRef
Zurück zum Zitat Cococcioni M, Pappalardo M, Sergeyev YD (2018) Lexicographic multi-objective linear programming using grossone methodology: theory and algorithm. Appl Math Comput 318:298–311MATH Cococcioni M, Pappalardo M, Sergeyev YD (2018) Lexicographic multi-objective linear programming using grossone methodology: theory and algorithm. Appl Math Comput 318:298–311MATH
Zurück zum Zitat Cortes C, Vapnik V (1995) Support-vector networks. Mach Learn 20(3):273–297MATH Cortes C, Vapnik V (1995) Support-vector networks. Mach Learn 20(3):273–297MATH
Zurück zum Zitat Cristianini N, Shawe-Taylor J (2000) An introduction to support vector machines and other kernel-based learning methods. Cambridge University Press, CambridgeCrossRef Cristianini N, Shawe-Taylor J (2000) An introduction to support vector machines and other kernel-based learning methods. Cambridge University Press, CambridgeCrossRef
Zurück zum Zitat D’Alotto L (2013) A classification of two-dimensional cellular automata using infinite computations. Indian J Math 55:143–158MathSciNetMATH D’Alotto L (2013) A classification of two-dimensional cellular automata using infinite computations. Indian J Math 55:143–158MathSciNetMATH
Zurück zum Zitat De Cosmis S, De Leone R (2012) The use of grossone in mathematical programming and operations research. Appl Math Comput 218(16):8029–8038MathSciNetMATH De Cosmis S, De Leone R (2012) The use of grossone in mathematical programming and operations research. Appl Math Comput 218(16):8029–8038MathSciNetMATH
Zurück zum Zitat De Leone R (2018) Nonlinear programming and grossone. Appl Math Comput 318(C):290–297MATH De Leone R (2018) Nonlinear programming and grossone. Appl Math Comput 318(C):290–297MATH
Zurück zum Zitat De Leone R, Fasano G, Sergeyev YD (2018) Planar methods and grossone for the conjugate gradient breakdown in nonlinear programming. Comput Optim Appl 71(1):73–93MathSciNetCrossRef De Leone R, Fasano G, Sergeyev YD (2018) Planar methods and grossone for the conjugate gradient breakdown in nonlinear programming. Comput Optim Appl 71(1):73–93MathSciNetCrossRef
Zurück zum Zitat Gaudioso M, Giallombardo G, Mukhametzhanov M (2018) Numerical infinitesimals in a variable metric method for convex nonsmooth optimization. Appl Math Comput 318:312–320MATH Gaudioso M, Giallombardo G, Mukhametzhanov M (2018) Numerical infinitesimals in a variable metric method for convex nonsmooth optimization. Appl Math Comput 318:312–320MATH
Zurück zum Zitat Gotoh J, Takeda A, Tono K (2018) DC formulations and algorithms for sparse optimization problems. Math Program 169:141–176MathSciNetCrossRef Gotoh J, Takeda A, Tono K (2018) DC formulations and algorithms for sparse optimization problems. Math Program 169:141–176MathSciNetCrossRef
Zurück zum Zitat Huang K, Zheng D, Sun J, Hotta Y, Fujimoto K, Naoi S (2010) Sparse learning for support vector classification. Pattern Recogn Lett 31(13):1944–1951CrossRef Huang K, Zheng D, Sun J, Hotta Y, Fujimoto K, Naoi S (2010) Sparse learning for support vector classification. Pattern Recogn Lett 31(13):1944–1951CrossRef
Zurück zum Zitat Iudin D, Sergeyev YD, Hayakawa M (2012) Interpretation of percolation in terms of infinity computations. Appl Math Comput 218(16):8099–8111MathSciNetMATH Iudin D, Sergeyev YD, Hayakawa M (2012) Interpretation of percolation in terms of infinity computations. Appl Math Comput 218(16):8099–8111MathSciNetMATH
Zurück zum Zitat Li S, Ye W (2017) A generalized elastic net regularization with smoothed \(l_0\) penalty. Adv Pure Math 7:66–74CrossRef Li S, Ye W (2017) A generalized elastic net regularization with smoothed \(l_0\) penalty. Adv Pure Math 7:66–74CrossRef
Zurück zum Zitat Lolli G (2015) Metamathematical investigations on the theory of grossone. Appl Math Comput 255:3–14MathSciNetMATH Lolli G (2015) Metamathematical investigations on the theory of grossone. Appl Math Comput 255:3–14MathSciNetMATH
Zurück zum Zitat Margenstern M (2012) An application of grossone to the study of a family of tilings of the hyperbolic plane. Appl Math Comput 218(16):8005–8018MathSciNetMATH Margenstern M (2012) An application of grossone to the study of a family of tilings of the hyperbolic plane. Appl Math Comput 218(16):8005–8018MathSciNetMATH
Zurück zum Zitat Pham DT, Le Thi HA (2014) Recent advances in DC programming and DCA. Springer, Berlin, pp 1–37 Pham DT, Le Thi HA (2014) Recent advances in DC programming and DCA. Springer, Berlin, pp 1–37
Zurück zum Zitat Rinaldi F, Schoen F, Sciandrone M (2010) Concave programming for minimizing the zero-norm over polyhedral sets. Comput Optim Appl 46:467–486MathSciNetCrossRef Rinaldi F, Schoen F, Sciandrone M (2010) Concave programming for minimizing the zero-norm over polyhedral sets. Comput Optim Appl 46:467–486MathSciNetCrossRef
Zurück zum Zitat Rizza D (2019) Numerical methods for infinite decision-making processes. Int J Unconv Comput 14(2):139–158 Rizza D (2019) Numerical methods for infinite decision-making processes. Int J Unconv Comput 14(2):139–158
Zurück zum Zitat Sergeyev YD (2001) Arithmetic of infinity. Edizioni Orizzonti Meridionali, CosenzaMATH Sergeyev YD (2001) Arithmetic of infinity. Edizioni Orizzonti Meridionali, CosenzaMATH
Zurück zum Zitat Sergeyev YD (2009) Numerical point of view on Calculus for functions assuming finite, infinite, and infinitesimal values over finite, infinite, and infinitesimal domains. Nonlinear Anal Ser A Theory Methods Appl 71(12):e1688–e1707MathSciNetCrossRef Sergeyev YD (2009) Numerical point of view on Calculus for functions assuming finite, infinite, and infinitesimal values over finite, infinite, and infinitesimal domains. Nonlinear Anal Ser A Theory Methods Appl 71(12):e1688–e1707MathSciNetCrossRef
Zurück zum Zitat Sergeyev YD (2010) Lagrange lecture: methodology of numerical computations with infinities and infinitesimals. Rendiconti del Seminario Matematico dell’Università e del Politecnico di Torino 68(2):95–113MATH Sergeyev YD (2010) Lagrange lecture: methodology of numerical computations with infinities and infinitesimals. Rendiconti del Seminario Matematico dell’Università e del Politecnico di Torino 68(2):95–113MATH
Zurück zum Zitat Sergeyev YD (2011a) Higher order numerical differentiation on the infinity computer. Optim Lett 5(4):575–585MathSciNetCrossRef Sergeyev YD (2011a) Higher order numerical differentiation on the infinity computer. Optim Lett 5(4):575–585MathSciNetCrossRef
Zurück zum Zitat Sergeyev YD (2011b) On accuracy of mathematical languages used to deal with the Riemann zeta function and the Dirichlet eta function. p-Adic Numbers Ultrametr Anal Appl 3(2):129–148MathSciNetCrossRef Sergeyev YD (2011b) On accuracy of mathematical languages used to deal with the Riemann zeta function and the Dirichlet eta function. p-Adic Numbers Ultrametr Anal Appl 3(2):129–148MathSciNetCrossRef
Zurück zum Zitat Sergeyev YD (2016) The exact (up to infinitesimals) infinite perimeter of the Koch snowflake and its finite area. Commun Nonlinear Sci Numer Simul 31(1–3):21–29MathSciNetCrossRef Sergeyev YD (2016) The exact (up to infinitesimals) infinite perimeter of the Koch snowflake and its finite area. Commun Nonlinear Sci Numer Simul 31(1–3):21–29MathSciNetCrossRef
Zurück zum Zitat Sergeyev YD (2017) Numerical infinities and infinitesimals: methodology, applications, and repercussions on two Hilbert problems. EMS Sur Math Sci 4:219–320MathSciNetCrossRef Sergeyev YD (2017) Numerical infinities and infinitesimals: methodology, applications, and repercussions on two Hilbert problems. EMS Sur Math Sci 4:219–320MathSciNetCrossRef
Zurück zum Zitat Sergeyev YD (2019) Independence of the grossone-based infinity methodology from non-standard analysis and comments upon logical fallacies in some texts asserting the opposite. Found Sci 24(1):153–170CrossRef Sergeyev YD (2019) Independence of the grossone-based infinity methodology from non-standard analysis and comments upon logical fallacies in some texts asserting the opposite. Found Sci 24(1):153–170CrossRef
Zurück zum Zitat Sergeyev YD, Mukhametzhanov M, Mazzia F, Iavernaro F, Amodio P (2016) Numerical methods for solving initial value problems on the infinity computer. Int J Unconv Comput 12(1):3–23 Sergeyev YD, Mukhametzhanov M, Mazzia F, Iavernaro F, Amodio P (2016) Numerical methods for solving initial value problems on the infinity computer. Int J Unconv Comput 12(1):3–23
Zurück zum Zitat Sergeyev YD, Kvasov DE, Mukhametzhanov MS (2018) On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales. Commun Nonlinear Sci Numer Simul 59:319–330MathSciNetCrossRef Sergeyev YD, Kvasov DE, Mukhametzhanov MS (2018) On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales. Commun Nonlinear Sci Numer Simul 59:319–330MathSciNetCrossRef
Metadaten
Titel
The use of grossone in elastic net regularization and sparse support vector machines
verfasst von
Renato De Leone
Nadaniela Egidi
Lorella Fatone
Publikationsdatum
25.07.2020
Verlag
Springer Berlin Heidelberg
Erschienen in
Soft Computing / Ausgabe 23/2020
Print ISSN: 1432-7643
Elektronische ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-020-05185-z

Weitere Artikel der Ausgabe 23/2020

Soft Computing 23/2020 Zur Ausgabe

Methodologies and Application

A two-stage density clustering algorithm