Abstract | ||
---|---|---|
Optimization networks are a new methodology for holistically solving interrelated problems that have been developed with combinatorial optimization problems in mind. In this contribution we revisit the core principles of optimization networks and demonstrate their suitability for solving machine learning problems. We use feature selection in combination with linear model creation as a benchmark application and compare the results of optimization networks to ordinary least squares with optional elastic net regularization. Based on this example we justify the advantages of optimization networks by adapting the network to solve other machine learning problems. Finally, optimization analysis is presented, where optimal input values of a system have to be found to achieve desired output values. Optimization analysis can be divided into three subproblems: model creation to describe the system, model selection to choose the most appropriate one and parameter optimization to obtain the input values. Therefore, optimization networks are an obvious choice for handling optimization analysis tasks. |
Year | DOI | Venue |
---|---|---|
2017 | 10.1007/978-3-319-74718-7_47 | COMPUTER AIDED SYSTEMS THEORY - EUROCAST 2017, PT I |
Keywords | Field | DocType |
Optimization networks, Machine learning, Feature selection, Optimization analysis | Feature selection,Combinatorial optimization problem,Computer science,Elastic net regularization,Linear model,Ordinary least squares,Model selection,Artificial intelligence,Machine learning | Conference |
Volume | ISSN | Citations |
10671 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 3 | 7 |
Name | Order | Citations | PageRank |
---|---|---|---|
Michael Kommenda | 1 | 97 | 15.58 |
Johannes Karder | 2 | 5 | 5.20 |
Andreas Beham | 3 | 77 | 20.20 |
Bogdan Burlacu | 4 | 21 | 4.85 |
Gabriel Kronberger | 5 | 192 | 25.40 |
Stefan Wagner | 6 | 172 | 27.06 |
Michael Affenzeller | 7 | 339 | 62.47 |