☆ 4.7 Article

Evidential Random Forests

EXPERT SYSTEMS WITH APPLICATIONS (2023)

Related references

Note: Only part of the references are listed.

Article Computer Science, Artificial Intelligence

Cautious weighted random forests

Haifei Zhang et al.

Summary: This paper investigates a new tree aggregation method based on the theory of belief functions to build a cautious random forest classifier. By introducing the imprecise Dirichlet model, the proposed model shows better performance in handling noisy data and balancing between informativeness and cautiousness.

EXPERT SYSTEMS WITH APPLICATIONS (2023)

Add to Collection

Proceedings Paper Computer Science, Artificial Intelligence

Validation of Smets' Hypothesis in the Crowdsourcing Environment

Constance Thierry et al.

Summary: In the late 1990s, Philippe Smets hypothesized that humans become more certain when they are more imprecise. This paper experimentally validates this hypothesis in the context of crowdsourcing, with results showing that users are more certain of their answers when they are imprecise.

BELIEF FUNCTIONS: THEORY AND APPLICATIONS (BELIEF 2021) (2021)

Add to Collection

Article Computer Science, Artificial Intelligence