Systems for complexity estimation typically aim to quantify the overall complexity of a domain, with the goal of comparing the hardness of different datasets or to associate a classification task to an algorithm that is deemed best suited for it. In this work we describe MultiResolution Complexity Analysis, a novel method for partitioning a dataset into regions of different classification complexity, with the aim of highlighting sources of complexity or noise inside the dataset. Initial experiments have been carried out on relevant datasets, proving the effectiveness of the proposed method.
MultiResolution Complexity Analysis. A Novel Method for Partitioning Datasets into Regions of Different Classification Complexity
ARMANO, GIULIANO;TAMPONI, EMANUELE
2015-01-01
Abstract
Systems for complexity estimation typically aim to quantify the overall complexity of a domain, with the goal of comparing the hardness of different datasets or to associate a classification task to an algorithm that is deemed best suited for it. In this work we describe MultiResolution Complexity Analysis, a novel method for partitioning a dataset into regions of different classification complexity, with the aim of highlighting sources of complexity or noise inside the dataset. Initial experiments have been carried out on relevant datasets, proving the effectiveness of the proposed method.
| File | Dimensione | Formato | |
|---|---|---|---|
|
2015-ICPRAM-armano.pdf
Solo gestori archivio
Tipologia:
versione editoriale (VoR)
Dimensione
186.85 kB
Formato
Adobe PDF
|
186.85 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I metadati presenti in IRIS UNICA sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono protetti da diritto d'autore, salvo diversa indicazione.
