Cellular tree classifiers
Luc Devroye · Oct 7, 2016
Date: 2016-10-07 Time: 15:30-16:30 Location: BURN 1205 Abstract: Suppose that binary classification is done by a tree method in which the leaves of a tree correspond to a partition of d-space. Within a partition, a majority vote is used. Suppose furthermore that this tree must be constructed recursively by implementing just two functions, so that the construction can be carried out in parallel by using “cells”: first of all, given input data, a cell must decide whether it will become a leaf or internal node in the tree.