IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v299y2022i2p642-652.html
   My bibliography  Save this article

A maximum-margin multisphere approach for binary Multiple Instance Learning

Author

Listed:
  • Astorino, Annabella
  • Avolio, Matteo
  • Fuduli, Antonio

Abstract

We propose a heuristic approach for solving binary Multiple Instance Learning (MIL) problems, whose objective is to categorize bags of instances. Considering the case with two classes of instances, on the basis of the standard MIL assumption, a bag is classified positive if it contains at least a positive instance and negative if all its instances are negative. Inspired by a well-established MIL Support Vector Machine type approach, our technique is based on iteratively separating the bags by means of successive maximum-margin spheres. Such spheres, whose number is automatically determined, are generated by computing, for each of them, the optimal radius in correspondence to a prefixed center. Numerical results are presented on a set of benchmark test problems, showing the effectiveness of our approach.

Suggested Citation

  • Astorino, Annabella & Avolio, Matteo & Fuduli, Antonio, 2022. "A maximum-margin multisphere approach for binary Multiple Instance Learning," European Journal of Operational Research, Elsevier, vol. 299(2), pages 642-652.
    • Handle: RePEc:eee:ejores:v:299:y:2022:i:2:p:642-652
    DOI: 10.1016/j.ejor.2021.11.022
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221721009735
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2021.11.022?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. P. Tseng, 2001. "Convergence of a Block Coordinate Descent Method for Nondifferentiable Minimization," Journal of Optimization Theory and Applications, Springer, vol. 109(3), pages 475-494, June.
    2. Pierre Hansen & Nenad Mladenović & José Moreno Pérez, 2010. "Variable neighbourhood search: methods and applications," Annals of Operations Research, Springer, vol. 175(1), pages 367-407, March.
    3. Maldonado, Sebastián & Pérez, Juan & Bravo, Cristián, 2017. "Cost-based feature selection for Support Vector Machines: An application in credit scoring," European Journal of Operational Research, Elsevier, vol. 261(2), pages 656-665.
    4. Manlio Gaudioso & Giovanni Giallombardo & Giovanna Miglionico & Adil M. Bagirov, 2018. "Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations," Journal of Global Optimization, Springer, vol. 71(1), pages 37-55, May.
    5. Gao, Zheming & Fang, Shu-Cherng & Luo, Jian & Medhin, Negash, 2021. "A kernel-free double well potential support vector machine with applications," European Journal of Operational Research, Elsevier, vol. 290(1), pages 248-262.
    6. Valero-Carreras, Daniel & Aparicio, Juan & Guerrero, Nadia M., 2021. "Support vector frontiers: A new approach for estimating production functions through support vector machines," Omega, Elsevier, vol. 104(C).
    7. Yao, Xiao & Crook, Jonathan & Andreeva, Galina, 2017. "Enhancing two-stage modelling methodology for loss given default with support vector machines," European Journal of Operational Research, Elsevier, vol. 263(2), pages 679-689.
    8. A. Astorino & M. Gaudioso, 2009. "A fixed-center spherical separation algorithm with kernel transformations for classification problems," Computational Management Science, Springer, vol. 6(3), pages 357-372, August.
    9. Wang, Haifeng & Zheng, Bichen & Yoon, Sang Won & Ko, Hoo Sang, 2018. "A support vector machine-based ensemble algorithm for breast cancer diagnosis," European Journal of Operational Research, Elsevier, vol. 267(2), pages 687-699.
    10. Luo, Jian & Yan, Xin & Tian, Ye, 2020. "Unsupervised quadratic surface support vector machine with application to credit risk assessment," European Journal of Operational Research, Elsevier, vol. 280(3), pages 1008-1017.
    11. Baldomero-Naranjo, Marta & Martínez-Merino, Luisa I. & Rodríguez-Chía, Antonio M., 2020. "Tightening big Ms in integer programming formulations for support vector machines with ramp loss," European Journal of Operational Research, Elsevier, vol. 286(1), pages 84-100.
    12. Demyanov, Alexey V. & Fuduli, Antonio & Miglionico, Giovanna, 2007. "A bundle modification strategy for convex minimization," European Journal of Operational Research, Elsevier, vol. 180(1), pages 38-47, July.
    13. O. L. Mangasarian & E. W. Wild, 2008. "Multiple Instance Classification via Successive Linear Programming," Journal of Optimization Theory and Applications, Springer, vol. 137(3), pages 555-568, June.
    14. Pedro Duarte Silva, A., 2017. "Optimization approaches to Supervised Classification," European Journal of Operational Research, Elsevier, vol. 261(2), pages 772-788.
    15. Emilio Carrizosa & Cristina Molero-Río & Dolores Romero Morales, 2021. "Mathematical optimization in classification and regression trees," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(1), pages 5-33, April.
    16. Gambella, Claudio & Ghaddar, Bissan & Naoum-Sawaya, Joe, 2021. "Optimization problems for machine learning: A survey," European Journal of Operational Research, Elsevier, vol. 290(3), pages 807-828.
    17. Annabella Astorino & Antonio Fuduli & Manlio Gaudioso, 2012. "Margin maximization in spherical separation," Computational Optimization and Applications, Springer, vol. 53(2), pages 301-322, October.
    Full references (including those not matched with items on IDEAS)

    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. Baldomero-Naranjo, Marta & Martínez-Merino, Luisa I. & Rodríguez-Chía, Antonio M., 2020. "Tightening big Ms in integer programming formulations for support vector machines with ramp loss," European Journal of Operational Research, Elsevier, vol. 286(1), pages 84-100.
    2. Gao, Zheming & Fang, Shu-Cherng & Luo, Jian & Medhin, Negash, 2021. "A kernel-free double well potential support vector machine with applications," European Journal of Operational Research, Elsevier, vol. 290(1), pages 248-262.
    3. Sandra Benítez-Peña & Rafael Blanquero & Emilio Carrizosa & Pepa Ramírez-Cobo, 2019. "On support vector machines under a multiple-cost scenario," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 13(3), pages 663-682, September.
    4. Blanquero, R. & Carrizosa, E. & Jiménez-Cordero, A. & Martín-Barragán, B., 2019. "Functional-bandwidth kernel for Support Vector Machine with Functional Data: An alternating optimization algorithm," European Journal of Operational Research, Elsevier, vol. 275(1), pages 195-207.
    5. Manlio Gaudioso & Giovanni Giallombardo & Giovanna Miglionico, 2015. "Optimal Replenishment Order Placement in a Finite Time Horizon," Journal of Optimization Theory and Applications, Springer, vol. 164(3), pages 1078-1089, March.
    6. Kellner, Ralf & Nagl, Maximilian & Rösch, Daniel, 2022. "Opening the black box – Quantile neural networks for loss given default prediction," Journal of Banking & Finance, Elsevier, vol. 134(C).
    7. Doumpos, Michalis & Zopounidis, Constantin & Gounopoulos, Dimitrios & Platanakis, Emmanouil & Zhang, Wenke, 2023. "Operational research and artificial intelligence methods in banking," European Journal of Operational Research, Elsevier, vol. 306(1), pages 1-16.
    8. Manlio Gaudioso & Giovanni Giallombardo & Giovanna Miglionico, 2020. "Essentials of numerical nonsmooth optimization," 4OR, Springer, vol. 18(1), pages 1-47, March.
    9. Blanquero, Rafael & Carrizosa, Emilio & Molero-Río, Cristina & Romero Morales, Dolores, 2020. "Sparsity in optimal randomized classification trees," European Journal of Operational Research, Elsevier, vol. 284(1), pages 255-272.
    10. A. Astorino & M. Gaudioso & W. Khalaf, 2014. "Edge detection by spherical separation," Computational Management Science, Springer, vol. 11(4), pages 517-530, October.
    11. Emilio Carrizosa & Vanesa Guerrero & Dolores Romero Morales, 2023. "On mathematical optimization for clustering categories in contingency tables," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 17(2), pages 407-429, June.
    12. Do, Hung Xuan & Rösch, Daniel & Scheule, Harald, 2018. "Predicting loss severities for residential mortgage loans: A three-step selection approach," European Journal of Operational Research, Elsevier, vol. 270(1), pages 246-259.
    13. Manlio Gaudioso & Giovanni Giallombardo & Giovanna Miglionico, 2022. "Essentials of numerical nonsmooth optimization," Annals of Operations Research, Springer, vol. 314(1), pages 213-253, July.
    14. Shuang Zhang & Xingdong Feng, 2022. "Distributed identification of heterogeneous treatment effects," Computational Statistics, Springer, vol. 37(1), pages 57-89, March.
    15. Jung, Yoon Mo & Whang, Joyce Jiyoung & Yun, Sangwoon, 2020. "Sparse probabilistic K-means," Applied Mathematics and Computation, Elsevier, vol. 382(C).
    16. Manlio Gaudioso & Giovanni Giallombardo & Giovanna Miglionico, 2018. "Minimizing Piecewise-Concave Functions Over Polyhedra," Mathematics of Operations Research, INFORMS, vol. 43(2), pages 580-597, May.
    17. Seunghwan Lee & Sang Cheol Kim & Donghyeon Yu, 2023. "An efficient GPU-parallel coordinate descent algorithm for sparse precision matrix estimation via scaled lasso," Computational Statistics, Springer, vol. 38(1), pages 217-242, March.
    18. Gilberto F. Sousa Filho & Teobaldo L. Bulhões Júnior & Lucidio A. F. Cabral & Luiz Satoru Ochi & Fábio Protti, 2017. "New heuristics for the Bicluster Editing Problem," Annals of Operations Research, Springer, vol. 258(2), pages 781-814, November.
    19. Le Thi Khanh Hien & Duy Nhat Phan & Nicolas Gillis, 2022. "Inertial alternating direction method of multipliers for non-convex non-smooth optimization," Computational Optimization and Applications, Springer, vol. 83(1), pages 247-285, September.
    20. Salvatore D. Tomarchio & Antonio Punzo, 2019. "Modelling the loss given default distribution via a family of zero‐and‐one inflated mixture models," Journal of the Royal Statistical Society Series A, Royal Statistical Society, vol. 182(4), pages 1247-1266, October.

    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:eee:ejores:v:299:y:2022:i:2:p:642-652. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.