Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Uros Pompe

dblp:99/6185 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1999
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Logic in computer science · 50% Computational complexity · 50%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Logic in computer science › logic programming
inductive logic programming		 0.011999
Noise-Tolerant Recursive Best-First Induction · ICML 1999
Computational complexity › learning theory
learning with noise		 0.011999
Noise-Tolerant Recursive Best-First Induction · ICML 1999
Data mining › predictive modeling › classification
rule learning		 0.011999
Noise-Tolerant Recursive Best-First Induction · ICML 1999

Methods — techniques the papers use, named apart from their topics

recursive best-first search · 0.0noise tolerance · 0.0
YearPublicationVenuePosition
1999 Noise-Tolerant Recursive Best-First Induction
Uros Pompe
 ICML1