IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v328y2026i1p269-281.html

Multi-view Ensemble Feature Selection via SemiDefinite Programming

Author

Listed:
  • Ding, Xiaojian
  • Wang, Xin
  • Shi, Pengcheng

Abstract

Multi-view learning faces significant challenges in selecting discriminative features while managing redundancy and noise across heterogeneous data sources. To address these issues, this paper introduces Multi-view Ensemble Feature Selection (MEFS), a novel framework that systematically integrates view generation (VG) and view selection (VS) through a unified optimization paradigm. By reformulating feature selection as a MaxCut problem and leveraging SemiDefinite Programming (SDP) relaxation, MEFS dynamically balances the generalization capability of individual views with their pairwise diversity, eliminating the need for manual parameter tuning. A key innovation is the proposed pairwise diversity metric, which quantifies inter-view dissimilarity using between-class scatter matrices to ensure complementary feature subsets. Extensive experiments on ten benchmark datasets demonstrate that MEFS consistently outperforms state-of-the-art methods in accuracy, robustness, and computational efficiency. Ablation studies validate the synergistic effect of combining VG and VS modules.

Suggested Citation

  • Ding, Xiaojian & Wang, Xin & Shi, Pengcheng, 2026. "Multi-view Ensemble Feature Selection via SemiDefinite Programming," European Journal of Operational Research, Elsevier, vol. 328(1), pages 269-281.
  • Handle: RePEc:eee:ejores:v:328:y:2026:i:1:p:269-281
    DOI: 10.1016/j.ejor.2025.07.014
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221725005399
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2025.07.014?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Helmberg, C., 2002. "Semidefinite programming," European Journal of Operational Research, Elsevier, vol. 137(3), pages 461-482, March.
    2. Peter Emerson, 2013. "The original Borda count and partial voting," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 40(2), pages 353-358, February.
    3. Frédéric Roupin, 2004. "From Linear to Semidefinite Programming: An Algorithm to Obtain Semidefinite Relaxations for Bivalent Quadratic Problems," Journal of Combinatorial Optimization, Springer, vol. 8(4), pages 469-493, December.
    4. Khemchandani, Reshma & Jayadeva & Chandra, Suresh, 2010. "Learning the optimal kernel for Fisher discriminant analysis via second order cone programming," European Journal of Operational Research, Elsevier, vol. 203(3), pages 692-697, June.
    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. F. Rendl, 2016. "Semidefinite relaxations for partitioning, assignment and ordering problems," Annals of Operations Research, Springer, vol. 240(1), pages 119-140, May.
    2. Gicquel, C. & Lisser, A. & Minoux, M., 2014. "An evaluation of semidefinite programming based approaches for discrete lot-sizing problems," European Journal of Operational Research, Elsevier, vol. 237(2), pages 498-507.
    3. Shigeaki Innan & Masahiro Inuiguchi, 2025. "Decision analysis using set of fuzzy priority weight vectors estimated from a fuzzy pairwise comparison matrix," Fuzzy Optimization and Decision Making, Springer, vol. 24(4), pages 695-722, December.
    4. Pessoa, Artur Alves & Hahn, Peter M. & Guignard, Monique & Zhu, Yi-Rong, 2010. "Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the Reformulation-Linearization Technique," European Journal of Operational Research, Elsevier, vol. 206(1), pages 54-63, October.
    5. Laruelle, Annick, 2021. "Voting to select projects in participatory budgeting," European Journal of Operational Research, Elsevier, vol. 288(2), pages 598-604.
    6. Andrew C. Eggers, 2021. "A diagram for analyzing ordinal voting systems," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 56(1), pages 143-171, January.
    7. Alain Billionnet & Sourour Elloumi & Amélie Lambert & Angelika Wiegele, 2017. "Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation," INFORMS Journal on Computing, INFORMS, vol. 29(2), pages 318-331, May.
    8. Sacha Bourgeois-Gironde & João V. Ferreira, 2024. "The expressive power of voting rules," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 62(2), pages 233-273, March.
    9. Wei-Chao Lin & Ching Chen, 2021. "Novel World University Rankings Combining Academic, Environmental and Resource Indicators," Sustainability, MDPI, vol. 13(24), pages 1-15, December.
    10. Jeisson Prieto & Rafael Malagón & Jonatan Gomez & Elizabeth León, 2021. "Urban Vulnerability Assessment for Pandemic Surveillance—The COVID-19 Case in Bogotá, Colombia," Sustainability, MDPI, vol. 13(6), pages 1-13, March.
    11. N. Bradley Fox & Benjamin Bruyns, 2024. "An Evaluation of Borda Count Variations Using Ranked Choice Voting Data," Papers 2501.00618, arXiv.org, revised Jan 2025.
    12. Eric Kamwa, 2022. "Scoring Rules, Ballot Truncation, and the Truncation Paradox," Working Papers hal-03632662, HAL.
    13. Eric Kamwa, 2022. "Scoring rules, ballot truncation, and the truncation paradox," Public Choice, Springer, vol. 192(1), pages 79-97, July.
    14. Hülya Yürekli & Öyküm Esra Yiğit & Okan Bulut & Min Lu & Ersoy Öz, 2022. "Exploring Factors That Affected Student Well-Being during the COVID-19 Pandemic: A Comparison of Data-Mining Approaches," IJERPH, MDPI, vol. 19(18), pages 1-16, September.
    15. Billionnet, Alain, 2013. "Mathematical optimization ideas for biodiversity conservation," European Journal of Operational Research, Elsevier, vol. 231(3), pages 514-534.
    16. Monaco, Roberto & Bergaentzlé, Claire & Leiva Vilaplana, Jose Angel & Ackom, Emmanuel & Nielsen, Per Sieverts, 2024. "Digitalization of power distribution grids: Barrier analysis, ranking and policy recommendations," Energy Policy, Elsevier, vol. 188(C).
    17. Mu, Yiqiang & Liu, Dun & Zhang, Zhihui, 2026. "Sorting electric vehicles via online review: A BERT-based behavioral three-way decision model with cardinal-ordinal preferences," Omega, Elsevier, vol. 139(C).
    18. Peter M. Hahn & Yi-Rong Zhu & Monique Guignard & William L. Hightower & Matthew J. Saltzman, 2012. "A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 24(2), pages 202-209, May.
    19. Junya Wang & Yi-Jiao Zhang & Cong Xu & Jiaze Li & Jiachen Sun & Jiarong Xie & Ling Feng & Tianshou Zhou & Yanqing Hu, 2024. "Reconstructing the evolution history of networked complex systems," Nature Communications, Nature, vol. 15(1), pages 1-11, December.
    20. Levent Tunçel & Henry Wolkowicz, 2012. "Strong duality and minimal representations for cone optimization," Computational Optimization and Applications, Springer, vol. 53(2), pages 619-648, October.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:328:y:2026:i:1:p:269-281. 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.