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
Abstract Most data complexity studies have focused on characterizing the complexity of the entire da...
Received (to be inserted by publisher) The analysis of the modular structure of networks is a major ...
We introduce the idea of Characteristic Regions to solve a classification problem. By identifying re...
Systems for complexity estimation typically aim to quantify the overall complexity of a domain, with...
The evaluation of the intrinsic complexity of a supervised domain plays an important role in devisin...
Classification complexity estimation is one of the fundamental steps in pattern recognition in order...
Machines capable of automatic pattern recognition have many fascinating uses. Algorithms for supervi...
It is widely accepted that the empirical behavior of classifiers strongly depends on available data....
New pattern recognition method is considered that is based on weighted voting by systems of subregio...
We report the results from an experimental investigation on the complexity of data subsets generated...
This paper proposes a method based on complex networks analysis, devised to perform clustering on mu...
We conducted comparative analysis of different supervised dimension reduction techniques by integrat...
The problem of pattern classification is considered for the case of multicategory classification whe...
AbstractÐIn this paper, a novel method of pattern discovery is proposed. It is based on the theoreti...
We present 20 new multi-labeled artificial datasets, which can also be used for evaluating ambiguity...
Abstract Most data complexity studies have focused on characterizing the complexity of the entire da...
Received (to be inserted by publisher) The analysis of the modular structure of networks is a major ...
We introduce the idea of Characteristic Regions to solve a classification problem. By identifying re...
Systems for complexity estimation typically aim to quantify the overall complexity of a domain, with...
The evaluation of the intrinsic complexity of a supervised domain plays an important role in devisin...
Classification complexity estimation is one of the fundamental steps in pattern recognition in order...
Machines capable of automatic pattern recognition have many fascinating uses. Algorithms for supervi...
It is widely accepted that the empirical behavior of classifiers strongly depends on available data....
New pattern recognition method is considered that is based on weighted voting by systems of subregio...
We report the results from an experimental investigation on the complexity of data subsets generated...
This paper proposes a method based on complex networks analysis, devised to perform clustering on mu...
We conducted comparative analysis of different supervised dimension reduction techniques by integrat...
The problem of pattern classification is considered for the case of multicategory classification whe...
AbstractÐIn this paper, a novel method of pattern discovery is proposed. It is based on the theoreti...
We present 20 new multi-labeled artificial datasets, which can also be used for evaluating ambiguity...
Abstract Most data complexity studies have focused on characterizing the complexity of the entire da...
Received (to be inserted by publisher) The analysis of the modular structure of networks is a major ...
We introduce the idea of Characteristic Regions to solve a classification problem. By identifying re...