Systems for assessing the classification complexity of a dataset have received increasing attention in research activities on pattern recognition. These systems typically aim at quantifying the overall complexity of a domain, with the goal of comparing different datasets. In this work, we propose a method for partitioning a dataset into regions of different classification complexity, so to highlight sources of complexity inside the dataset. Experiments have been carried out on relevant datasets, proving the effectiveness of the proposed method.
Experimenting Multiresolution Analysis for Identifying Regions of Different Classification Complexity
ARMANO, GIULIANO;TAMPONI, EMANUELE
2016-01-01
Abstract
Systems for assessing the classification complexity of a dataset have received increasing attention in research activities on pattern recognition. These systems typically aim at quantifying the overall complexity of a domain, with the goal of comparing different datasets. In this work, we propose a method for partitioning a dataset into regions of different classification complexity, so to highlight sources of complexity inside the dataset. Experiments have been carried out on relevant datasets, proving the effectiveness of the proposed method.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
2015-PAA-armano.pdf
Solo gestori archivio
Tipologia:
versione editoriale (VoR)
Dimensione
525.66 kB
Formato
Adobe PDF
|
525.66 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.