Demo Data from EDBT 2026 / reviewers in the wild / expert
Jens Christian Hühn
dblp:80/2620 · also Jens C. Huhn
· DBLP profile ↗
3ranked-venue papers
2as first author
0since 2021 · last 2009
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 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.
| Databases, data mining, and information retrieval
1 paper |
Data mining · 67% Information retrieval · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining › predictive modeling › classification
decision tree learning |
0.1 | 1 | 2009 | Decision tree and instance-based learning for label ranking · ICML 2009 |
Data mining › predictive modeling › classification
instance-based learning |
0.1 | 1 | 2009 | Decision tree and instance-based learning for label ranking · ICML 2009 |
Information retrieval › ranking › preference ranking
label ranking |
0.1 | 1 | 2009 | Decision tree and instance-based learning for label ranking · ICML 2009 |
Methods — techniques the papers use, named apart from their topics
local probability estimation · 0.1instance-based learning · 0.1decision tree induction · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2009 | Decision tree and instance-based learning for label rankingabstractThe label ranking problem consists of learning a model that maps instances to total orders over a finite set of predefined labels. This paper introduces new methods for label ranking that complement and improve upon existing approaches. More specifically, we propose extensions of two methods that have been used extensively for classification and regression so far, namely instance-based learning and decision tree induction. The unifying element of the two methods is a procedure for locally estimating predictive probability models for label rankings. Weiwei Cheng, Jens Christian Hühn, Eyke Hüllermeier |
ICML | 2 |
| 2009 | FURIA: an algorithm for unordered fuzzy rule induction
Jens Christian Hühn, Eyke Hüllermeier |
Data Min. Knowl. Discov. | 1 |
| 2009 | FR3: A Fuzzy Rule Learner for Inducing Reliable ClassifiersabstractThis paper introduces a fuzzy-rule-based classification method called fuzzy round robin [repeated incremental pruning to produce error reduction (RIPPER)] (FR3). As the name suggests, FR3 builds upon the RIPPER algorithm, a state-of-the-art rule learner. More specifically, in the context of polychotomous classification, it uses a fuzzy extension of RIPPER as a base learner within a round robin scheme, and thus, can be seen as a fuzzy variant of the R3 learner that has recently been introduced in the literature. A key feature of FR3, in comparison with its nonfuzzy counterpart, is its ability to represent different facets of uncertainty involved in a classification decision in a more faithful way. FR3 thus provides the basis for implementing “reliable classifiers” that may abstain from a decision when not being sure enough, or at least indicate that a classification is not fully supported by the empirical evidence at hand. Besides, our experimental results show that FR3 outperforms R3 in terms of classification accuracy, and therefore, suggest that it produces predictions that are not only more reliable but also more accurate. The superb classification performance of FR3 is furthermore confirmed by comparing it to other state-of-the-art (fuzzy) rule learners. Jens Christian Hühn, Eyke Hüllermeier |
IEEE Trans. Fuzzy Syst. | 1 |