A comparative study of the leading machine learning techniques and two new optimization algorithms

•Comparison of fourteen machine learning algorithms on a diverse collection of data sets.•First thorough analysis of combinatorial optimization algorithms for machine learning.•Combinatorial optimization algorithms achieve best and most robust performance.•All pairwise-similarities-based algorithms...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:European journal of operational research Ročník 272; číslo 3; s. 1041 - 1057
Hlavní autoři: Baumann, P., Hochbaum, D.S., Yang, Y.T.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.02.2019
Témata:
ISSN:0377-2217, 1872-6860
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:•Comparison of fourteen machine learning algorithms on a diverse collection of data sets.•First thorough analysis of combinatorial optimization algorithms for machine learning.•Combinatorial optimization algorithms achieve best and most robust performance.•All pairwise-similarities-based algorithms are top performers. We present here a computational study comparing the performance of leading machine learning techniques to that of recently developed graph-based combinatorial optimization algorithms (SNC and KSNC). The surprising result of this study is that SNC and KSNC consistently show the best or close to best performance in terms of their F1-scores, accuracy, and recall. Furthermore, the performance of SNC and KSNC is considerably more robust than that of the other algorithms; the others may perform well on average but tend to vary greatly across data sets. This demonstrates that combinatorial optimization techniques can be competitive as compared to state-of-the-art machine learning techniques. The code developed for SNC and KSNC is publicly available.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2018.07.009