Evidence map›Paper›PMID 33816961›Full record

ArticlePeerJ. Computer science2020

Error curves for evaluating the quality of feature rankings.

Ivica Slavkov, Matej Petković, Pierre Geurts, Dragi Kocev, Sašo Džeroski

Abstract read
In one paragraph

Article in PeerJ. Computer science, 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Ivica SlavkovJozef Stefan Institute, Ljubljana, Slovenia.
Matej PetkovićJozef Stefan Institute, Ljubljana, Slovenia.
Pierre GeurtsUniversité de Liège, Liège, Belgium.
Dragi KocevJozef Stefan Institute, Ljubljana, Slovenia.ORCID 0000-0003-0687-0878
Sašo DžeroskiJozef Stefan Institute, Ljubljana, Slovenia.ORCID 0000-0003-2363-712X

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

In this article, we propose a method for evaluating feature ranking algorithms. A feature ranking algorithm estimates the importance of descriptive features when predicting the target variable, and the proposed method evaluates the correctness of these importance values by computing the error measures of two chains of predictive models. The models in the first chain are built on nested sets of top-ranked features, while the models in the other chain are built on nested sets of bottom ranked features. We investigate which predictive models are appropriate for building these chains, showing empirically that the proposed method gives meaningful results and can detect differences in feature ranking quality. This is first demonstrated on synthetic data, and then on several real-world classification benchmark problems.

Indexed as

Error curvesEvaluationFeature ranking

Identifiers

PMID33816961
PMCPMC7924685

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.