2006
DOI: 10.4114/ia.v10i29.875
|View full text |Cite
|
Sign up to set email alerts
|

A meta-learning framework for pattern classification by means of data complexity measures

Abstract: It is widely accepted that the empirical behavior of classifiers strongly depends on available data. For a given problem, it is rather difficult to guess which classifier will provide the best performance or to set a proper expectation on classification performance. Traditional experimental studies consist of presenting accuracy of a set of classifiers on a small number of problems, without analyzing why a classifier outperforms other classification algorithms. Recently, some researchers have tried to characte… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 8 publications
(1 citation statement)
references
References 15 publications
0
0
0
Order By: Relevance
“…There are other descriptor-based approaches, for example for meta learning [8,9], for classifier recommendation [10], and for synthetic data generation [11]. However, only a small number of data points in a low dimensional space have been considered in these works.…”
Section: Descriptor-based Approachesmentioning
confidence: 99%
“…There are other descriptor-based approaches, for example for meta learning [8,9], for classifier recommendation [10], and for synthetic data generation [11]. However, only a small number of data points in a low dimensional space have been considered in these works.…”
Section: Descriptor-based Approachesmentioning
confidence: 99%