Cellular tree classifiers

DOI10.1007/978-3-319-11662-4_2MaRDI QIDQ2938720zbMATHOpenAlexFDO

Authors Gérard Biau, Luc Devroye

Publication date 14 January 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1301.4679

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Abstract: The cellular tree classifier model addresses a fundamental problem in the design of classifiers for a parallel or distributed computing world: Given a data set, is it sufficient to apply a majority rule for classification, or shall one split the data into two or more parts and send each part to a potentially different computer (or cell) for further processing? At first sight, it seems impossible to define with this paradigm a consistent classifier as no cell knows the "original data size", $n$. However, we show that this is not so by exhibiting two different consistent classifiers. The consistency is universal but is only shown for distributions with nonatomic marginals.

Recommendations

• Cellular tree classifiers
• A method for the design of binary tree classifiers
• An improved multiple-attractor cellular automata classifier with a tree frame based on CART
• scientific article; zbMATH DE number 1156666
• scientific article; zbMATH DE number 1014881

Cited in

(6)

• Cellular tree classifiers
• Designing distributed cell classifier circuits using a genetic algorithm
• A method for the design of binary tree classifiers
• An improved multiple-attractor cellular automata classifier with a tree frame based on CART
• Impact of subsampling and tree depth on random forests
• Binary multi-layer classifier

This page was built for publication: Cellular tree classifiers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938720)