Boosting (Catalan Wikipedia)

Analysis of information sources in references of the Wikipedia article "Boosting" in Catalan language version.

refsWebsite
Global rank Catalan rank
702nd place
809th place
2nd place
6th place
1st place
1st place
580th place
333rd place
741st place
583rd place
3,707th place
3,253rd place
32nd place
669th place
415th place
402nd place

berkeley.edu (Global: 580th place; Catalan: 333rd place)

oz.berkeley.edu

doi.org (Global: 2nd place; Catalan: 6th place)

dx.doi.org

ghostarchive.org (Global: 32nd place; Catalan: 669th place)

mit.edu (Global: 415th place; Catalan: 402nd place)

math.mit.edu

princeton.edu (Global: 741st place; Catalan: 583rd place)

cs.princeton.edu

projecteuclid.org (Global: 3,707th place; Catalan: 3,253rd place)

  • Leo Breiman (1998); Arcing Classifier (with Discussion and a Rejoinder by the Author), Annals of Statistics, vol. 26, no. 3, pp. 801-849: "The concept of weak learning was introduced by Kearns and Valiant (1988, 1989), who left open the question of whether weak and strong learnability are equivalent. The question was termed the boosting problem since [a solution must] boost the low accuracy of a weak learner to the high accuracy of a strong learner. Schapire (1990) proved that boosting is possible. A boosting algorithm is a method that takes a weak learner and converts it into a strong learner. Freund and Schapire (1997) proved that an algorithm similar to arc-fs is boosting.

upenn.edu (Global: 702nd place; Catalan: 809th place)

cis.upenn.edu

web.archive.org (Global: 1st place; Catalan: 1st place)