Key points are not available for this paper at this time.
Often the best performing supervised learning models are ensembles of hundreds or thousands of base-level classifiers. Unfortunately, the space required to store this many classifiers, and the time required to execute them at run-time, prohibits their use in applications where test sets are large (e.g. Google), where storage space is at a premium (e.g. PDAs), and where computational power is limited (e.g. hea-ring aids). We present a method for "compressing" large, complex ensembles into smaller, faster models, usually without significant loss in performance.
Building similarity graph...
Analyzing shared references across papers
Loading...
Buciluǎ et al. (Sun,) studied this question.
www.synapsesocial.com/papers/69da2abc94a959ed41a3c2ec — DOI: https://doi.org/10.1145/1150402.1150464
Cristian Buciluǎ
Rich Caruana
Alexandru Niculescu-Mizil
Cornell University
Building similarity graph...
Analyzing shared references across papers
Loading...