Making a Shallow Network Deep: Growing a Tree from Decision Regions of a Boosting Classifier

@inproceedings{Kim2010MakingAS,
  title={Making a Shallow Network Deep: Growing a Tree from Decision Regions of a Boosting Classifier},
  author={Tae-Kyun Kim and Ignas Budvytis and Roberto Cipolla},
  booktitle={BMVC},
  year={2010}
}
This paper presents a novel way to speed up the classification time of a boosting classifier. We make the shallow (flat) network deep (hierarchical) by growing a tree from the decision regions of a given boosting classifier. This provides many short paths for speeding up and preserves the reasonably smooth decision regions of the boosting classifier for good generalisation. We express the conversion as a Boolean optimisation problem, which has been previously studied for circuit design but… CONTINUE READING

Similar Papers

Citations

Publications citing this paper.

Multiple Classifier Boosting and Tree-Structured Classifiers

  • Machine Learning for Computer Vision
  • 2013
VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS

References

Publications referenced by this paper.