Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Soft Computing
Erschienen in: Soft Computing 23/2020

07.10.2020 | Focus

Spherical separation with infinitely far center

verfasst von: Annabella Astorino, Antonio Fuduli

Erschienen in: Soft Computing | Ausgabe 23/2020

Einloggen

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

search-config
loading …

Abstract

We tackle the problem of separating two finite sets of samples by means of a spherical surface, focusing on the case where the center of the sphere is fixed. Such approach reduces to the minimization of a convex and nonsmooth function of just one variable (the radius), revealing very effective in terms of computational time. In particular, we analyze the case where the center of the sphere is selected far from both the two sets, embedding the grossone idea and obtaining a kind of linear separation. Some numerical results are presented on classical binary data sets drawn from the literature.
Vorheriger Artikel On the topological convergence of multi-rule sequences of sets and fractal patterns
Nächster Artikel Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming

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!

Jetzt informieren

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!

Jetzt informieren

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!

Jetzt informieren
Literatur
Andrews S, Tsochantaridis I, Hofmann T (2003) Support vector machines for multiple-instance learning. In: Becker S, Thrun S, Obermayer K (eds) Advances in neural information processing systems. MIT Press, Cambridge, pp 561–568
Astorino A, Fuduli A (2007) Nonsmooth optimization techniques for semisupervised classification. IEEE Trans Pattern Anal Mach Intell 29(12):2135–2142
Astorino A, Fuduli A (2016) The proximal trajectory algorithm in SVM cross validation. IEEE Trans Neural Netw Learn Syst 27(5):966–977MathSciNet
Astorino A, Gaudioso M (2009) A fixed-center spherical separation algorithm with kernel transformations for classification problems. Comput Manag Sci 6(3):357–372MathSciNetMATH
Astorino A, Fuduli A, Gorgone E (2008) Non-smoothness in classification problems. Optim Methods Softw 23(5):675–688MathSciNetMATH
Astorino A, Fuduli A, Gaudioso M (2010) DC models for spherical separation. J Glob Optim 48(4):657–669MathSciNetMATH
Astorino A, Bomze I, Brito P, Gaudioso M (2012a) Two spherical separation procedures via non-smooth convex optimization. In: Simone VD, Serafino DD, Toraldo G (eds) Recent advances in nonlinear optimization and equilibrium problems: a tribute to Marco D’Apuzzo, Quaderni di Matematica, Dipartimento di Matematica della Seconda Universitá di Napoli, vol 27, pp 1–16. Aracne
Astorino A, Fuduli A, Gaudioso M (2012b) Margin maximization in spherical separation. Comput Optim Appl 53(2):301–322MathSciNetMATH
Astorino A, Gaudioso M, Khalaf W (2014a) Edge detection by spherical separation. Comput Manag Sci 11(4):517–530MATH
Astorino A, Gaudioso M, Seeger A (2014b) Conic separation of finite sets. I. The homogeneous case. J Convex Anal 21(1):1–28MathSciNetMATH
Astorino A, Gaudioso M, Seeger A (2014c) Conic separation of finite sets. II. The nonhomogeneous case. J Convex Anal 21(3):819–831MathSciNetMATH
Astorino A, Fuduli A, Gaudioso M (2016) Nonlinear programming for classification problems in machine learning. In: AIP conference proceedings, vol 1776, 040004
Astorino A, Bomze I, Fuduli A, Gaudioso M (2017) Robust spherical separation. Optimization 66(6):925–938MathSciNetMATH
Astorino A, Fuduli A, Gaudioso M (2019a) A Lagrangian relaxation approach for binary multiple instance classification. IEEE Trans Neural Netw Learn Syst 30(9):2662–2671MathSciNet
Astorino A, Fuduli A, Giallombardo G, Miglionico G (2019b) SVM-based multiple instance classification via DC optimization. Algorithms 12(12):249MathSciNet
Astorino A, Fuduli A, Veltri P, Vocaturo E (2020) Melanoma detection by means of multiple instance learning. Interdiscip Sci Comput Life Sci 12(1):24–31
Caldarola F (2018) The Sierpinski curve viewed by numerical computations with infinities and infinitesimals. Appl Math Comput 318:321–328MATH
Celebi ME (ed) (2015) Partitional clustering algorithms. Springer, BerlinMATH
Chapelle O, Schölkopf B, Zien A (eds) (2006) Semi-supervised learning. MIT Press, Cambridge
Chapelle O, Zien A (2005) Semi-supervised classification by low density separation. In: Proceedings of the tenth international workshop on artificial intelligence and statistics, pp 57–64
Cococcioni M, Cudazzo A, Pappalardo M, Sergeyev Y.D (2020) Solving the lexicographic multi-objective mixed-integer linear programming problem using branch-and-bound and grossone methodology. Communications in Nonlinear Science and Numerical Simulation p. in Press . https://​doi.​org/​10.​1016/​j.​cnsns.​2020.​105177
Cristianini N, Shawe-Taylor J (2000) An introduction to support vector machines and other kernel-based learning methods. Cambridge University Press, CambridgeMATH
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 Leone R (2018) Nonlinear programming and grossone: quadratic programming and the role of constraint qualifications. Appl Math Comput 318:290–297MATH
De Leone R, Fasano G, Sergeyev YD (2018) Planar methods and grossone for the conjugate gradient breakdown in nonlinear programming. Comput Optim Appl 71:73–93MathSciNetMATH
De Leone R, Fasano G, Roma M, Sergeyev Y (2020) Iterative grossone-based computation of negative curvature directions in large-scale optimization. J Optim Theory Appl 186(2):554–589MathSciNetMATH
Falcone A, Garro A, Mukhametzhanov MS, Sergeyev YD (2020) A simulink-based infinity computer simulator and some applications. In: Sergeyev YD, Kvasov DE (eds) Numerical computations: theory and algorithms. Springer, Cham, pp 362–369MATH
Gaudioso M, Giallombardo G, Mukhametzhanov MS (2018) Numerical infinitesimals in a variable metric method for convex nonsmooth optimization. Appl Math Comput 318:312–320MATH
Gaudioso M, Giallombardo G, Miglionico G, Vocaturo E (2020) Classification in the multiple instance learning framework via spherical separation. Soft Comput 24(7):5071–5077
Herrera F, Ventura S, Bello R, Cornelis C, Zafra A, Sánchez-Tarragó D, Vluymans S (2016) Multiple instance learning: foundations and algorithms. Springer, BerlinMATH
Le Thi HA, Minh LH, Pham Dinh T, Ngai VH (2013) Binary classification via spherical separator by DC programming and DCA. J Glob Optim 56:1393–1407MathSciNetMATH
Lolli G (2015) Metamathematical investigations on the theory of grossone. Appl Math Comput 255:3–14MathSciNetMATH
Mangasarian OL (1965) Linear and nonlinear separation of patterns by linear programming. Oper Res 13(3):444–452MathSciNetMATH
Margenstern M (2011) Using grossone to count the number of elements of infinite sets and the connection with bijections. p-Adic numbers. Ultrametric Anal Appl 3(3):196–204MathSciNetMATH
Montagna F, Simi G, Sorbi A (2015) Taking the Pirahã seriously. Commun Nonlinear Sci Numer Simul 21(1–3):52–69MathSciNetMATH
Odewahn S, Stockwell E, Pennington R, Humphreys R, Zumach W (1992) Automated star/galaxy discrimination with neural networks. Astronom J 103(1):318–331
Plastria F, Carrizosa E, Gordillo J (2014) Multi-instance classification through spherical separation and VNS. Comput Oper Res 52:326–333MathSciNetMATH
Sergeyev YD (2003) Arithmetic of Infinity. Edizioni Orizzonti Meridionali, CS (2003, 2nd ed. 2013)
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–e1707MathSciNetMATH
Sergeyev YD (2010a) Computer system for storing infinite, infinitesimal, and finite quantities and executing arithmetical operations with them. USA patent 7,860,914
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 (2011) Higher order numerical differentiation on the infinity computer. Optim Lett 5(4):575–585MathSciNetMATH
Sergeyev YD (2015) Un semplice modo per trattare le grandezze infinite ed infinitesime. Matematica nella Società e nella Cultura: Rivista della Unione Matematica Italiana 8(1): 111–147
Sergeyev YD (2017) Numerical infinities and infinitesimals: methodology, applications, and repercussions on two Hilbert problems. EMS Surv Math Sci 4:219–320MathSciNetMATH
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–170MATH
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–330MathSciNetMATH
Tax DMJ, Duin RPW (1999) Data domain description using support vectors. In: ESANN’1999 proceedings Bruges, pp 251–256. Belgium
Vapnik V (1995) The nature of the statistical learning theory. Springer, New YorkMATH
Zhigljavsky A (2012) Computing sums of conditionally convergent and divergent series using the concept of grossone. Appl Math Comput 218(16):8064–8076MathSciNetMATH
Metadaten
Titel
Spherical separation with infinitely far center
verfasst von
Annabella Astorino
Antonio Fuduli
Publikationsdatum
07.10.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-05352-2

Weitere Artikel der Ausgabe 23/2020

Soft Computing 23/2020 Zur Ausgabe

Methodologies and Application

Solving differential equations with artificial bee colony programming

Methodologies and Application

Real power loss reduction by Duponchelia fovealis optimization and enriched squirrel search optimization algorithms

Methodologies and Application

A novel multi-attribute decision-making framework based on Z-RIM: an illustrative example of cloud service selection

Focus

Ritz-like values in steplength selections for stochastic gradient methods

Focus

Soft clustering by convex electoral model

Methodologies and Application

A two-stage density clustering algorithm