Revisiting where are the hard knapsack problems? via Instance Space Analysis

2021 ◽  
Vol 128 ◽  
pp. 105184
Author(s):  
Kate Smith-Miles ◽  
Jeffrey Christiansen ◽  
Mario Andrés Muñoz
Author(s):  
Arnaud De Coster ◽  
Nysret Musliu ◽  
Andrea Schaerf ◽  
Johannes Schoisswohl ◽  
Kate Smith-Miles

Algorithms ◽  
2021 ◽  
Vol 14 (3) ◽  
pp. 95
Author(s):  
Luiz Henrique dos Santos Fernandes ◽  
Ana Carolina Lorena ◽  
Kate Smith-Miles

Various criteria and algorithms can be used for clustering, leading to very distinct outcomes and potential biases towards datasets with certain structures. More generally, the selection of the most effective algorithm to be applied for a given dataset, based on its characteristics, is a problem that has been largely studied in the field of meta-learning. Recent advances in the form of a new methodology known as Instance Space Analysis provide an opportunity to extend such meta-analyses to gain greater visual insights of the relationship between datasets’ characteristics and the performance of different algorithms. The aim of this study is to perform an Instance Space Analysis for the first time for clustering problems and algorithms. As a result, we are able to analyze the impact of the choice of the test instances employed, and the strengths and weaknesses of some popular clustering algorithms, for datasets with different structures.


2021 ◽  
Vol 15 (2) ◽  
pp. 1-25
Author(s):  
Mario Andrés Muñoz ◽  
Tao Yan ◽  
Matheus R. Leal ◽  
Kate Smith-Miles ◽  
Ana Carolina Lorena ◽  
...  

The quest for greater insights into algorithm strengths and weaknesses, as revealed when studying algorithm performance on large collections of test problems, is supported by interactive visual analytics tools. A recent advance is Instance Space Analysis, which presents a visualization of the space occupied by the test datasets, and the performance of algorithms across the instance space. The strengths and weaknesses of algorithms can be visually assessed, and the adequacy of the test datasets can be scrutinized through visual analytics. This article presents the first Instance Space Analysis of regression problems in Machine Learning, considering the performance of 14 popular algorithms on 4,855 test datasets from a variety of sources. The two-dimensional instance space is defined by measurable characteristics of regression problems, selected from over 26 candidate features. It enables the similarities and differences between test instances to be visualized, along with the predictive performance of regression algorithms across the entire instance space. The purpose of creating this framework for visual analysis of an instance space is twofold: one may assess the capability and suitability of various regression techniques; meanwhile the bias, diversity, and level of difficulty of the regression problems popularly used by the community can be visually revealed. This article shows the applicability of the created regression instance space to provide insights into the strengths and weaknesses of regression algorithms, and the opportunities to diversify the benchmark test instances to support greater insights.


2019 ◽  
Vol 19 (3) ◽  
pp. 281-291
Author(s):  
Jordan N. Yassine
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document