Fast Random Forest Algorithm via Incremental Upper Bound. Fujiwara, Y.; Ida, Y.; Kanai, S.; Kumagai, A.; Arai, J.; and Ueda, N. In Zhu, W.; Tao, D.; Cheng, X.; Cui, P.; Rundensteiner, E. A.; Carmel, D.; He, Q.; and Yu, J. X., editors, Proceedings of the 28th ACM International Conference on Information and Knowledge Management, CIKM 2019, Beijing, China, November 3-7, 2019, pages 2205–2208, 2019. ACM.
Paper doi bibtex @inproceedings{DBLP:conf/cikm/FujiwaraIKKAU19,
author = {Yasuhiro Fujiwara and
Yasutoshi Ida and
Sekitoshi Kanai and
Atsutoshi Kumagai and
Junya Arai and
Naonori Ueda},
editor = {Wenwu Zhu and
Dacheng Tao and
Xueqi Cheng and
Peng Cui and
Elke A. Rundensteiner and
David Carmel and
Qi He and
Jeffrey Xu Yu},
title = {Fast Random Forest Algorithm via Incremental Upper Bound},
booktitle = {Proceedings of the 28th {ACM} International Conference on Information
and Knowledge Management, {CIKM} 2019, Beijing, China, November 3-7,
2019},
pages = {2205--2208},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3357384.3358092},
doi = {10.1145/3357384.3358092},
timestamp = {Mon, 04 Nov 2019 11:08:42 +0100},
biburl = {https://dblp.org/rec/conf/cikm/FujiwaraIKKAU19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}