IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v276y2019i1d10.1007_s10479-017-2674-1.html
   My bibliography  Save this article

Semi-supervised generalized eigenvalues classification

Author

Listed:
  • Marco Viola

    (Sapienza University of Rome)

  • Mara Sangiovanni

    (National Research Council of Italy)

  • Gerardo Toraldo

    (University of Naples Federico II)

  • Mario R. Guarracino

    (National Research Council of Italy)

Abstract

Supervised classification is one of the most powerful techniques to analyze data, when a-priori information is available on the membership of data samples to classes. Since the labeling process can be both expensive and time-consuming, it is interesting to investigate semi-supervised algorithms that can produce classification models taking advantage of unlabeled samples. In this paper we propose LapReGEC, a novel technique that introduces a Laplacian regularization term in a generalized eigenvalue classifier. As a result, we produce models that are both accurate and parsimonious in terms of needed labeled data. We empirically prove that the obtained classifier well compares with other techniques, using as little as 5% of labeled points to compute the models.

Suggested Citation

  • Marco Viola & Mara Sangiovanni & Gerardo Toraldo & Mario R. Guarracino, 2019. "Semi-supervised generalized eigenvalues classification," Annals of Operations Research, Springer, vol. 276(1), pages 249-266, May.
  • Handle: RePEc:spr:annopr:v:276:y:2019:i:1:d:10.1007_s10479-017-2674-1
    DOI: 10.1007/s10479-017-2674-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-017-2674-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10479-017-2674-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Birgin, Ernesto G. & Martínez, Jose Mario & Raydan, Marcos, 2014. "Spectral Projected Gradient Methods: Review and Perspectives," Journal of Statistical Software, Foundation for Open Access Statistics, vol. 60(i03).
    2. Roberta De Asmundis & Daniela di Serafino & William Hager & Gerardo Toraldo & Hongchao Zhang, 2014. "An efficient gradient method using the Yuan steplength," Computational Optimization and Applications, Springer, vol. 59(3), pages 541-563, December.
    3. S. Cafieri & M. D’Apuzzo & V. Simone & D. Serafino & G. Toraldo, 2007. "Convergence Analysis of an Inexact Potential Reduction Method for Convex Quadratic Programming," Journal of Optimization Theory and Applications, Springer, vol. 135(3), pages 355-366, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jamal Al Qundus & Kosai Dabbour & Shivam Gupta & Régis Meissonier & Adrian Paschke, 2022. "Wireless sensor network for AI-based flood disaster detection," Annals of Operations Research, Springer, vol. 319(1), pages 697-719, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. di Serafino, Daniela & Ruggiero, Valeria & Toraldo, Gerardo & Zanni, Luca, 2018. "On the steplength selection in gradient methods for unconstrained optimization," Applied Mathematics and Computation, Elsevier, vol. 318(C), pages 176-195.
    2. Harry Fernando Oviedo Leon, 2019. "A delayed weighted gradient method for strictly convex quadratic minimization," Computational Optimization and Applications, Springer, vol. 74(3), pages 729-746, December.
    3. Roberto Andreani & Marcos Raydan, 2021. "Properties of the delayed weighted gradient method," Computational Optimization and Applications, Springer, vol. 78(1), pages 167-180, January.
    4. Crisci, Serena & Ruggiero, Valeria & Zanni, Luca, 2019. "Steplength selection in gradient projection methods for box-constrained quadratic programs," Applied Mathematics and Computation, Elsevier, vol. 356(C), pages 312-327.
    5. Yu-Hong Dai & Yakui Huang & Xin-Wei Liu, 2019. "A family of spectral gradient methods for optimization," Computational Optimization and Applications, Springer, vol. 74(1), pages 43-65, September.
    6. Andrej Čopar & Blaž Zupan & Marinka Zitnik, 2019. "Fast optimization of non-negative matrix tri-factorization," PLOS ONE, Public Library of Science, vol. 14(6), pages 1-15, June.
    7. Pospíšil, Lukáš & Dostál, Zdeněk, 2018. "The projected Barzilai–Borwein method with fall-back for strictly convex QCQP problems with separable constraints," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 145(C), pages 79-89.
    8. Serena Crisci & Federica Porta & Valeria Ruggiero & Luca Zanni, 2023. "Hybrid limited memory gradient projection methods for box-constrained optimization problems," Computational Optimization and Applications, Springer, vol. 84(1), pages 151-189, January.
    9. Na Zhao & Qingzhi Yang & Yajun Liu, 2017. "Computing the generalized eigenvalues of weakly symmetric tensors," Computational Optimization and Applications, Springer, vol. 66(2), pages 285-307, March.
    10. Stefania Corsaro & Valentina Simone, 2019. "Adaptive $$l_1$$ l 1 -regularization for short-selling control in portfolio selection," Computational Optimization and Applications, Springer, vol. 72(2), pages 457-478, March.
    11. Corsaro, Stefania & De Simone, Valentina & Marino, Zelda, 2021. "Split Bregman iteration for multi-period mean variance portfolio optimization," Applied Mathematics and Computation, Elsevier, vol. 392(C).
    12. J. Martínez & M. Raydan, 2015. "Separable cubic modeling and a trust-region strategy for unconstrained minimization with impact in global optimization," Journal of Global Optimization, Springer, vol. 63(2), pages 319-342, October.
    13. V. S. Amaral & R. Andreani & E. G. Birgin & D. S. Marcondes & J. M. Martínez, 2022. "On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization," Journal of Global Optimization, Springer, vol. 84(3), pages 527-561, November.
    14. Na Huang, 2022. "On R-linear convergence analysis for a class of gradient methods," Computational Optimization and Applications, Springer, vol. 81(1), pages 161-177, January.
    15. Wolfgang Schadner, 2021. "Feasible Implied Correlation Matrices from Factor Structures," Papers 2107.00427, arXiv.org.
    16. Stefania Corsaro & Valentina De Simone & Zelda Marino, 2021. "Fused Lasso approach in portfolio selection," Annals of Operations Research, Springer, vol. 299(1), pages 47-59, April.
    17. Milagros Loreto & Hugo Aponte & Debora Cores & Marcos Raydan, 2017. "Nonsmooth spectral gradient methods for unconstrained optimization," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(4), pages 529-553, December.
    18. E. Loli Piccolomini & V. L. Coli & E. Morotti & L. Zanni, 2018. "Reconstruction of 3D X-ray CT images from reduced sampling by a scaled gradient projection algorithm," Computational Optimization and Applications, Springer, vol. 71(1), pages 171-191, September.
    19. Behzad Azmi & Karl Kunisch, 2020. "Analysis of the Barzilai-Borwein Step-Sizes for Problems in Hilbert Spaces," Journal of Optimization Theory and Applications, Springer, vol. 185(3), pages 819-844, June.
    20. O. P. Ferreira & M. Lemes & L. F. Prudente, 2022. "On the inexact scaled gradient projection method," Computational Optimization and Applications, Springer, vol. 81(1), pages 91-125, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:276:y:2019:i:1:d:10.1007_s10479-017-2674-1. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.