IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v265y2018i2d10.1007_s10479-016-2331-0.html
   My bibliography  Save this article

Optimal column subset selection for image classification by genetic algorithms

Author

Listed:
  • Pavel Krömer

    (VŠB-Technical University of Ostrava)

  • Jan Platoš

    (VŠB-Technical University of Ostrava)

  • Jana Nowaková

    (VŠB-Technical University of Ostrava)

  • Václav Snášel

    (VŠB-Technical University of Ostrava)

Abstract

Many problems in operations research can be solved by combinatorial optimization. Fixed-length subset selection is a family of combinatorial optimization problems that involve selection of a set of unique objects from a larger superset. Feature selection, p-median problem, and column subset selection problem are three examples of hard problems that involve search for fixed-length subsets. Due to their high complexity, exact algorithms are often infeasible to solve real-world instances of these problems and approximate methods based on various heuristic and metaheuristic (e.g. nature-inspired) approaches are often employed. Selecting column subsets from massive data matrices is an important technique useful for construction of compressed representations and low rank approximations of high-dimensional data. Search for an optimal subset of exactly k columns of a matrix, $$A^{m\times n}$$ A m × n , $$k

Suggested Citation

  • Pavel Krömer & Jan Platoš & Jana Nowaková & Václav Snášel, 2018. "Optimal column subset selection for image classification by genetic algorithms," Annals of Operations Research, Springer, vol. 265(2), pages 205-222, June.
  • Handle: RePEc:spr:annopr:v:265:y:2018:i:2:d:10.1007_s10479-016-2331-0
    DOI: 10.1007/s10479-016-2331-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-016-2331-0
    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-016-2331-0?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. Mladenovic, Nenad & Brimberg, Jack & Hansen, Pierre & Moreno-Perez, Jose A., 2007. "The p-median problem: A survey of metaheuristic approaches," European Journal of Operational Research, Elsevier, vol. 179(3), pages 927-939, June.
    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. Jin Zhang & Cong Wang & Guoqing Chen, 2021. "A Review Selection Method for Finding an Informative Subset from Online Reviews," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 280-299, January.

    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. Behrooz Alizadeh & Somayeh Bakhteh, 2017. "A modified firefly algorithm for general inverse p-median location problems under different distance norms," OPSEARCH, Springer;Operational Research Society of India, vol. 54(3), pages 618-636, September.
    2. Tao Zhuolin & Zheng Qingjing & Kong Hui, 2018. "A Modified Gravity p-Median Model for Optimizing Facility Locations," Journal of Systems Science and Information, De Gruyter, vol. 6(5), pages 421-434, October.
    3. Michael Brusco & Douglas Steinley, 2015. "Affinity Propagation and Uncapacitated Facility Location Problems," Journal of Classification, Springer;The Classification Society, vol. 32(3), pages 443-480, October.
    4. Joshua Q. Hale & Enlu Zhou & Jiming Peng, 2017. "A Lagrangian search method for the P-median problem," Journal of Global Optimization, Springer, vol. 69(1), pages 137-156, September.
    5. Angel Juan & Javier Faulin & Albert Ferrer & Helena Lourenço & Barry Barrios, 2013. "MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(1), pages 109-132, April.
    6. Campos Rodrí­guez, Clara M. & Moreno Pérez, José A., 2008. "Multiple voting location problems," European Journal of Operational Research, Elsevier, vol. 191(2), pages 437-453, December.
    7. Snežana Tadić & Mladen Krstić & Željko Stević & Miloš Veljović, 2023. "Locating Collection and Delivery Points Using the p -Median Location Problem," Logistics, MDPI, vol. 7(1), pages 1-17, February.
    8. Zhen, Lu & Gao, Jiajing & Tan, Zheyi & Laporte, Gilbert & Baldacci, Roberto, 2023. "Territorial design for customers with demand frequency," European Journal of Operational Research, Elsevier, vol. 309(1), pages 82-101.
    9. Corinna Heßler & Kaouthar Deghdak, 2017. "Discrete parallel machine makespan ScheLoc problem," Journal of Combinatorial Optimization, Springer, vol. 34(4), pages 1159-1186, November.
    10. Ma, Yuze & Han, Xu & Zhang, Ting & Li, Ang & Song, Zhicheng & Li, Tao & Wang, Yongli, 2024. "Research on station-network planning of electricity-thermal -cooling regional integrated energy system considering multiple-load clusters and network costs," Energy, Elsevier, vol. 297(C).
    11. Pablo Adasme & Ali Dehghan Firoozabadi, 2019. "Facility Location with Tree Topology and Radial Distance Constraints," Complexity, Hindawi, vol. 2019, pages 1-29, November.
    12. Ehsan Ahmadi & Dale T. Masel & Seth Hostetler, 2023. "A Data-Driven Decision-Making Model for Configuring Surgical Trays Based on the Likelihood of Instrument Usages," Mathematics, MDPI, vol. 11(9), pages 1-26, May.
    13. Vladimir Marianov & Daniel Serra, 2009. "Median problems in networks," Economics Working Papers 1151, Department of Economics and Business, Universitat Pompeu Fabra.
    14. Francesco Bonavolontà & Vincenzo Caragallo & Alessandro Fatica & Annalisa Liccardo & Adriano Masone & Claudio Sterle, 2021. "Optimization of IEDs Position in MV Smart Grids through Integer Linear Programming," Energies, MDPI, vol. 14(11), pages 1-16, June.
    15. Brimberg, Jack & Drezner, Zvi & Mladenović, Nenad & Salhi, Said, 2014. "A new local search for continuous location problems," European Journal of Operational Research, Elsevier, vol. 232(2), pages 256-265.
    16. Irawan, Chandra Ade & Salhi, Said & Scaparra, Maria Paola, 2014. "An adaptive multiphase approach for large unconditional and conditional p-median problems," European Journal of Operational Research, Elsevier, vol. 237(2), pages 590-605.
    17. Michael Brusco & Hans-Friedrich Köhn, 2009. "Exemplar-Based Clustering via Simulated Annealing," Psychometrika, Springer;The Psychometric Society, vol. 74(3), pages 457-475, September.
    18. Amaldi, Edoardo & Coniglio, Stefano, 2013. "A distance-based point-reassignment heuristic for the k-hyperplane clustering problem," European Journal of Operational Research, Elsevier, vol. 227(1), pages 22-29.
    19. İsmail ÖNDEN & Nurbanu DOĞAN & Fahrettin EELDEMİR, 2018. "Hızlı Otobüs Taşımacılığı İçin İstasyon Lokasyonlarının Belirlenmesine Yönelik Yaklaşımlar," Istanbul Management Journal, Istanbul University Business School, vol. 29(85), pages 41-58, December.
    20. Duran-Mateluna, Cristian & Ales, Zacharie & Elloumi, Sourour, 2023. "An efficient benders decomposition for the p-median problem," European Journal of Operational Research, Elsevier, vol. 308(1), pages 84-96.

    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:265:y:2018:i:2:d:10.1007_s10479-016-2331-0. 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.