Cellular Tree Classifiers

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.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [49 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00778520
Contributor : Gérard Biau <>
Submitted on : Monday, June 24, 2013 - 9:19:37 PM
Last modification on : Tuesday, May 14, 2019 - 11:02:10 AM
Long-term archiving on : Wednesday, September 25, 2013 - 4:12:11 AM

Files

articlegreedy6.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00778520, version 2
  • ARXIV : 1301.4679

Citation

Gérard Biau, Luc Devroye. Cellular Tree Classifiers. 2013. ⟨hal-00778520v2⟩

Share

Metrics

Record views

627

Files downloads

595