SPB Git forge

spb/wp21_uqo

Public
0commits 0branches 0releases
0 Bsize
maindefault branch
—last push
8.5 KB · 330 lines json
Raw Blame History
1{2 "key": "breiman2001random",3 "retrieved": "2026-10-20",4 "via": "doi",5 "message": {6  "indexed": {7   "date-parts": [8    [9     2026,10     10,11     2012    ]13   ],14   "date-time": "2026-10-20T15:20:18Z",15   "timestamp": 1792509618997,16   "version": "4.5.0"17  },18  "reference-count": 17,19  "publisher": "Springer Science and Business Media LLC",20  "issue": "1",21  "license": [22   {23    "start": {24     "date-parts": [25      [26       2001,27       10,28       129      ]30     ],31     "date-time": "2001-10-01T00:00:00Z",32     "timestamp": 100189440000033    },34    "content-version": "tdm",35    "delay-in-days": 0,36    "URL": "https://www.springernature.com/gp/researchers/text-and-data-mining"37   },38   {39    "start": {40     "date-parts": [41      [42       2001,43       10,44       145      ]46     ],47     "date-time": "2001-10-01T00:00:00Z",48     "timestamp": 100189440000049    },50    "content-version": "vor",51    "delay-in-days": 0,52    "URL": "https://www.springernature.com/gp/researchers/text-and-data-mining"53   }54  ],55  "content-domain": {56   "domain": [57    "link.springer.com"58   ],59   "crossmark-restriction": false60  },61  "short-container-title": [62   "Machine Learning"63  ],64  "published-print": {65   "date-parts": [66    [67     2001,68     1069    ]70   ]71  },72  "DOI": "10.1023/a:1010933404324",73  "type": "journal-article",74  "created": {75   "date-parts": [76    [77     2002,78     12,79     2280    ]81   ],82   "date-time": "2002-12-22T23:10:54Z",83   "timestamp": 104059865400084  },85  "page": "5-32",86  "update-policy": "https://doi.org/10.1007/springer_crossmark_policy",87  "source": "Crossref",88  "is-referenced-by-count": 123819,89  "title": [90   "Random Forests"91  ],92  "prefix": "10.1007",93  "volume": "45",94  "author": [95   {96    "given": "Leo",97    "family": "Breiman",98    "sequence": "first",99    "affiliation": [],100    "role": [101     {102      "vocabulary": "crossref",103      "role": "author"104     }105    ]106   }107  ],108  "member": "297",109  "reference": [110   {111    "key": "354300_CR1",112    "doi-asserted-by": "crossref",113    "first-page": "1545",114    "DOI": "10.1162/neco.1997.9.7.1545",115    "volume": "9",116    "author": "Y. Amit",117    "year": "1997",118    "unstructured": "Amit, Y. & Geman, D. (1997). Shape quantization and recognition with randomized trees. Neural Computation, 9, 1545–1588.",119    "journal-title": "Neural Computation"120   },121   {122    "key": "354300_CR2",123    "unstructured": "Amit, Y., Blanchard, G., & Wilder, K. (1999). Multiple randomized classifiers: MRCL Technical Report, Department of Statistics, University of Chicago."124   },125   {126    "key": "354300_CR3",127    "doi-asserted-by": "crossref",128    "first-page": "105",129    "DOI": "10.1023/A:1007515423169",130    "volume": "36",131    "author": "E. Bauer",132    "year": "1999",133    "unstructured": "Bauer, E. & Kohavi, R. (1999). An empirical comparison of voting classification algorithms. Machine Learning, 36(1/2), 105–139.",134    "journal-title": "Machine Learning"135   },136   {137    "issue": "2",138    "key": "354300_CR4",139    "doi-asserted-by": "crossref",140    "first-page": "123",141    "DOI": "10.1023/A:1018054314350",142    "volume": "26",143    "author": "L. Breiman",144    "year": "1996",145    "unstructured": "Breiman, L. (1996a). Bagging predictors. Machine Learning 26(2), 123–140.",146    "journal-title": "Machine Learning"147   },148   {149    "key": "354300_CR5",150    "unstructured": "Breiman, L. (1996b). Out-of-bag estimation, ftp.stat.berkeley.edu/pub/users/breiman/OOBestimation.ps"151   },152   {153    "key": "354300_CR6",154    "doi-asserted-by": "crossref",155    "first-page": "801",156    "DOI": "10.1214/aos/1024691079",157    "volume": "26",158    "author": "L. Breiman",159    "year": "1998",160    "unstructured": "Breiman, L. (1998a). Arcing classifiers (discussion paper). Annals of Statistics, 26, 801–824.",161    "journal-title": "Annals of Statistics"162   },163   {164    "key": "354300_CR7",165    "unstructured": "Breiman. L. (1998b). Randomizing outputs to increase prediction accuracy. Technical Report 518, May 1, 1998, Statistics Department, UCB (in press, Machine Learning)."166   },167   {168    "key": "354300_CR8",169    "unstructured": "Breiman, L. 1999. Using adaptive bagging to debias regressions. Technical Report 547, Statistics Dept. UCB."170   },171   {172    "key": "354300_CR9",173    "unstructured": "Breiman, L. 2000. Some infinity theory for predictor ensembles. Technical Report 579, Statistics Dept. UCB."174   },175   {176    "key": "354300_CR10",177    "unstructured": "Dietterich, T. (1998). An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting and randomization, Machine Learning, 1–22."178   },179   {180    "key": "354300_CR11",181    "unstructured": "Freund, Y. & Schapire, R. (1996). Experiments with a new boosting algorithm, Machine Learning: Proceedings of the Thirteenth International Conference, 148–156."182   },183   {184    "key": "354300_CR12",185    "unstructured": "Grove, A. & Schuurmans, D. (1998). Boosting in the limit: Maximizing the margin of learned ensembles. In Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI-98)."186   },187   {188    "issue": "8",189    "key": "354300_CR13",190    "doi-asserted-by": "crossref",191    "first-page": "832",192    "DOI": "10.1109/34.709601",193    "volume": "20",194    "author": "T. K. Ho",195    "year": "1998",196    "unstructured": "Ho, T. K. (1998). The random subspace method for constructing decision forests. IEEE Trans. on Pattern Analysis and Machine Intelligence, 20(8), 832–844.",197    "journal-title": "IEEE Trans. on Pattern Analysis and Machine Intelligence"198   },199   {200    "issue": "5",201    "key": "354300_CR14",202    "doi-asserted-by": "crossref",203    "first-page": "473",204    "DOI": "10.1109/34.857004",205    "volume": "22",206    "author": "E. Kleinberg",207    "year": "2000",208    "unstructured": "Kleinberg, E. (2000). On the algorithmic implementation of stochastic discrimination. IEEE Trans. on Pattern Analysis and Machine Intelligence, 22(5), 473–490.",209    "journal-title": "IEEE Trans. on Pattern Analysis and Machine Intelligence"210   },211   {212    "issue": "5",213    "key": "354300_CR15",214    "first-page": "1651",215    "volume": "26",216    "author": "R. Schapire",217    "year": "1998",218    "unstructured": "Schapire, R., Freund, Y., Bartlett, P., & Lee,W. (1998). Boosting the margin:Anewexplanation for the effectiveness of voting methods. Annals of Statistics, 26(5), 1651–1686.",219    "journal-title": "Annals of Statistics"220   },221   {222    "key": "354300_CR16",223    "unstructured": "Tibshirani, R. (1996). Bias, variance, and prediction error for classification rules. Technical Report, Statistics Department, University of Toronto."224   },225   {226    "key": "354300_CR17",227    "unstructured": "Wolpert, D. H. & Macready, W. G. (1997). An efficient method to estimate Bagging's generalization error (in press, Machine Learning)."228   }229  ],230  "container-title": [231   "Machine Learning"232  ],233  "original-title": [],234  "language": "en",235  "link": [236   {237    "URL": "https://link.springer.com/content/pdf/10.1023/A:1010933404324.pdf",238    "content-type": "application/pdf",239    "content-version": "vor",240    "intended-application": "text-mining"241   },242   {243    "URL": "https://link.springer.com/article/10.1023/A:1010933404324/fulltext.html",244    "content-type": "text/html",245    "content-version": "vor",246    "intended-application": "text-mining"247   },248   {249    "URL": "https://link.springer.com/content/pdf/10.1023/A:1010933404324.pdf",250    "content-type": "application/pdf",251    "content-version": "vor",252    "intended-application": "similarity-checking"253   }254  ],255  "deposited": {256   "date-parts": [257    [258     2025,259     7,260     10261    ]262   ],263   "date-time": "2025-07-10T11:46:28Z",264   "timestamp": 1752147988000265  },266  "score": 1,267  "resource": {268   "primary": {269    "URL": "https://link.springer.com/10.1023/A:1010933404324"270   }271  },272  "subtitle": [],273  "short-title": [],274  "issued": {275   "date-parts": [276    [277     2001,278     10279    ]280   ]281  },282  "references-count": 17,283  "journal-issue": {284   "issue": "1",285   "published-print": {286    "date-parts": [287     [288      2001,289      10290     ]291    ]292   }293  },294  "alternative-id": [295   "354300"296  ],297  "URL": "https://doi.org/10.1023/a:1010933404324",298  "relation": {},299  "ISSN": [300   "0885-6125",301   "1573-0565"302  ],303  "issn-type": [304   {305    "value": "0885-6125",306    "type": "print"307   },308   {309    "value": "1573-0565",310    "type": "electronic"311   }312  ],313  "subject": [],314  "published": {315   "date-parts": [316    [317     2001,318     10319    ]320   ]321  },322  "assertion": [323   {324    "value": "This content has been made available to all.",325    "name": "free",326    "label": "Free to read"327   }328  ]329 }330}