{% extends "global/Page.html" %}
{% load otree static %}
{% block title %}
Explaining the algorithm's output
{% endblock %}
{% block content %}
{%comment &}
The algorithm can be categorized as boosted tree ensemble method.
Single decision trees build
In order to understand how ML algorithms arrive at a certain output value, the depiction of the importance of
features used by the algorithm can be helpful. The now introduced method to determine feature importance for
complex ML algorithms is grounded on mathematical game theory. Furthermore, studies suggest that the assigned
feature importance is in accordance to human intuition. The method is capable of providing the feature importance
for a single data point (e.g. the next one to predict) at a time and is hence a local method. The importance
assigned to a single feature can vary from data point to data point.
The graph below shows how the feature importance with the respective impact on the algorithm's output can be visualized.
The algorithm was put together by thoughtful analysts and has an average accuracy of ~92%. (TBD) "a sophisticated model, put together by thoughtful analysts"
{%endcomment%} {% next_button %} {% endblock %}