IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v29y2021i2d10.1007_s11750-020-00554-1.html
   My bibliography  Save this article

The generalized test collection problem

Author

Listed:
  • Yifat Douek-Pinkovich

    (Tel-Aviv University)

  • Irad Ben-Gal

    (Tel-Aviv University)

  • Tal Raviv

    (Tel-Aviv University)

Abstract

The test collection problem, also known as the minimum test set problem or the minimum test cover problem, selects a minimal set of binary attributes by which it is possible to determine the state of a system. This problem commonly arises in applications such as medical diagnosis and fault detection in the design of monitoring systems. We generalize this problem by (i) allowing attributes to obtain arbitrary categorical values; (ii) allowing multiple attributes combinations to represent a single state of a system; and (iii) including a different cost for testing each attribute. The objective of the planer is to select a set of tests at a minimum cost that can determine the state of the system. To address this problem, we present an integer programming model and an effective exact solution method that uses the model’s unique structure to reduce its dimension. Using this method, large instances that could not be solved directly by a commercial solver can easily be solved. Our solution method was implemented and demonstrated to be superior to those described in previous studies when applied on two sets of benchmark instances from the literature. One dataset was adapted from the UCI repository and one was based on a realistic and large-scale sensor placement problem in urban water networks.

Suggested Citation

  • Yifat Douek-Pinkovich & Irad Ben-Gal & Tal Raviv, 2021. "The generalized test collection problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(2), pages 372-386, July.
    • Handle: RePEc:spr:topjnl:v:29:y:2021:i:2:d:10.1007_s11750-020-00554-1
    DOI: 10.1007/s11750-020-00554-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11750-020-00554-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/s11750-020-00554-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. Bertolazzi, P. & Felici, G. & Festa, P. & Fiscon, G. & Weitschek, E., 2016. "Integer programming models for feature selection: New extensions and a randomized solution algorithm," European Journal of Operational Research, Elsevier, vol. 250(2), pages 389-399.
    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. Manlio Gaudioso & Giovanni Giallombardo & Giovanna Miglionico, 2023. "Sparse optimization via vector k-norm and DC programming with an application to feature selection for support vector machines," Computational Optimization and Applications, Springer, vol. 86(2), pages 745-766, November.
    2. Daehan Won & Hasan Manzour & Wanpracha Chaovalitwongse, 2020. "Convex Optimization for Group Feature Selection in Networked Data," INFORMS Journal on Computing, INFORMS, vol. 32(1), pages 182-198, January.
    3. Li, An-Da & He, Zhen & Wang, Qing & Zhang, Yang, 2019. "Key quality characteristics selection for imbalanced production data using a two-phase bi-objective feature selection method," European Journal of Operational Research, Elsevier, vol. 274(3), pages 978-989.
    4. Zhang, Yishi & Zhu, Ruilin & Chen, Zhijun & Gao, Jie & Xia, De, 2021. "Evaluating and selecting features via information theoretic lower bounds of feature inner correlations for high-dimensional data," European Journal of Operational Research, Elsevier, vol. 290(1), pages 235-247.
    5. Ghaddar, Bissan & Naoum-Sawaya, Joe, 2018. "High dimensional data classification and feature selection using support vector machines," European Journal of Operational Research, Elsevier, vol. 265(3), pages 993-1004.
    6. Giovanni Felici & Kumar Parijat Tripathi & Daniela Evangelista & Mario Rosario Guarracino, 2017. "A mixed integer programming-based global optimization framework for analyzing gene expression data," Journal of Global Optimization, Springer, vol. 69(3), pages 727-744, November.
    7. Jiménez-Cordero, Asunción & Morales, Juan Miguel & Pineda, Salvador, 2021. "A novel embedded min-max approach for feature selection in nonlinear Support Vector Machine classification," European Journal of Operational Research, Elsevier, vol. 293(1), pages 24-35.
    8. Douek-Pinkovich, Yifat & Ben-Gal, Irad & Raviv, Tal, 2022. "The stochastic test collection problem: Models, exact and heuristic solution approaches," European Journal of Operational Research, Elsevier, vol. 299(3), pages 945-959.

    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:topjnl:v:29:y:2021:i:2:d:10.1007_s11750-020-00554-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.