{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T20:47:56Z","timestamp":1774039676644,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,3]],"date-time":"2019-11-03T00:00:00Z","timestamp":1572739200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"JSPS KAKENHI","award":["19H04117"],"award-info":[{"award-number":["19H04117"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,3]]},"DOI":"10.1145\/3357384.3358092","type":"proceedings-article","created":{"date-parts":[[2019,11,4]],"date-time":"2019-11-04T14:11:35Z","timestamp":1572876695000},"page":"2205-2208","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Fast Random Forest Algorithm via Incremental Upper Bound"],"prefix":"10.1145","author":[{"given":"Yasuhiro","family":"Fujiwara","sequence":"first","affiliation":[{"name":"NTT Communication Science Laboratories, Kanagawa, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yasutoshi","family":"Ida","sequence":"additional","affiliation":[{"name":"NTT Software Innovation Center, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sekitoshi","family":"Kanai","sequence":"additional","affiliation":[{"name":"NTT Software Innovation Center, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atsutoshi","family":"Kumagai","sequence":"additional","affiliation":[{"name":"NTT Software Innovation Center, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junya","family":"Arai","sequence":"additional","affiliation":[{"name":"NTT Software Innovation Center, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naonori","family":"Ueda","sequence":"additional","affiliation":[{"name":"NTT Communication Science Laboratories, Kyoto, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,11,3]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"TEST","volume":"25","author":"Biau G\u00e9rard","year":"2016"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1072"},{"key":"e_1_3_2_1_3_1","unstructured":"Leo Breiman J. H. Friedman R. A. Olshen and C. J. Stone. 1984. Classification and Regression Trees. Wadsworth.  Leo Breiman J. H. Friedman R. A. Olshen and C. J. Stone. 1984. Classification and Regression Trees. Wadsworth."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622287"},{"key":"e_1_3_2_1_5_1","unstructured":"Yasuhiro Fujiwara Yasutoshi Ida Hiroaki Shiokawa and Sotetsu Iwamura. 2016. Fast Lasso Algorithm via Selective Coordinate Descent. In AAAI. 1561--1567. http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI16\/paper\/view\/12015  Yasuhiro Fujiwara Yasutoshi Ida Hiroaki Shiokawa and Sotetsu Iwamura. 2016. Fast Lasso Algorithm via Selective Coordinate Descent. In AAAI. 1561--1567. http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI16\/paper\/view\/12015"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Yasuhiro Fujiwara Sekitoshi Kanai Junya Arai Yasutoshi Ida and Naonori Ueda. 2019. Efficient Data Point Pruning for One-Class SVM . AAAI. 3590--3597. https:\/\/aaai.org\/ojs\/index.php\/AAAI\/article\/view\/4239  Yasuhiro Fujiwara Sekitoshi Kanai Junya Arai Yasutoshi Ida and Naonori Ueda. 2019. Efficient Data Point Pruning for One-Class SVM . AAAI. 3590--3597. https:\/\/aaai.org\/ojs\/index.php\/AAAI\/article\/view\/4239","DOI":"10.1609\/aaai.v33i01.33013590"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-006-6226-1"},{"key":"e_1_3_2_1_8_1","unstructured":"Yasutoshi Ida Yasuhiro Fujiwara and Sotetsu Iwamura. Adaptive Learning Rate via Covariance Matrix Based Preconditioning for Deep Neural Networks. In IJCAI.  Yasutoshi Ida Yasuhiro Fujiwara and Sotetsu Iwamura. Adaptive Learning Rate via Covariance Matrix Based Preconditioning for Deep Neural Networks. In IJCAI."},{"key":"e_1_3_2_1_9_1","unstructured":"Sekitoshi Kanai Yasuhiro Fujiwara and Sotetsu Iwamura. 2017. Preventing Gradient Explosions in Gated Recurrent Units. In NIPS. 435--444. http:\/\/papers.nips.cc\/paper\/6647-preventing-gradient-explosions-in-gated-recurrent-units  Sekitoshi Kanai Yasuhiro Fujiwara and Sotetsu Iwamura. 2017. Preventing Gradient Explosions in Gated Recurrent Units. In NIPS. 435--444. http:\/\/papers.nips.cc\/paper\/6647-preventing-gradient-explosions-in-gated-recurrent-units"},{"key":"e_1_3_2_1_10_1","first-page":"18","article-title":"Classification and Regression by randomForest","volume":"2","author":"Liaw Andy","year":"2002","journal-title":"R News"},{"key":"e_1_3_2_1_11_1","unstructured":"Andy Liaw and Matthew Wiener. 2018. Package `randomForest'. https:\/\/cran.r-project.org\/web\/packages\/randomForest\/randomForest.pdf. (2018).  Andy Liaw and Matthew Wiener. 2018. Package `randomForest'. https:\/\/cran.r-project.org\/web\/packages\/randomForest\/randomForest.pdf. (2018)."},{"key":"e_1_3_2_1_12_1","unstructured":"Aloysius Lim. 2015. gboris\/bigrf: Big Random Forests: Classification and Regression Forests for Large Data Sets. https:\/\/rdrr.io\/github\/gboris\/bigrf\/. (2015).  Aloysius Lim. 2015. gboris\/bigrf: Big Random Forests: Classification and Regression Forests for Large Data Sets. https:\/\/rdrr.io\/github\/gboris\/bigrf\/. (2015)."},{"key":"e_1_3_2_1_13_1","unstructured":"Makoto Nakatsuji Yasuhiro Fujiwara Hiroyuki Toda Hiroshi Sawada Jinguang Zheng and James Alexander Hendler. 2014. Semantic Data Representation for Improving Tensor Factorization. In AAAI. 2004--2012. http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI14\/paper\/view\/8372  Makoto Nakatsuji Yasuhiro Fujiwara Hiroyuki Toda Hiroshi Sawada Jinguang Zheng and James Alexander Hendler. 2014. Semantic Data Representation for Improving Tensor Factorization. In AAAI. 2004--2012. http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI14\/paper\/view\/8372"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btr004"},{"key":"e_1_3_2_1_15_1","unstructured":"Mark Seligman. 2015. The Arborist: a High-Performance Random Forest Implementation. http:\/\/past.rinfinance.com\/agenda\/2015\/talk\/MarkSeligman.pdf (2015).  Mark Seligman. 2015. The Arborist: a High-Performance Random Forest Implementation. http:\/\/past.rinfinance.com\/agenda\/2015\/talk\/MarkSeligman.pdf (2015)."},{"key":"e_1_3_2_1_16_1","volume-title":"Rborist'. https:\/\/cran.r-project.org\/web\/packages\/Rborist\/Rborist.pdf","author":"Seligman Mark","year":"2017"},{"key":"e_1_3_2_1_17_1","volume-title":"ranger'. https:\/\/cran.r-project.org\/web\/packages\/ranger\/ranger.pdf","author":"Wright Marvin N.","year":"2018"},{"key":"e_1_3_2_1_18_1","volume-title":"Wright and Andreas Ziegler","author":"Marvin","year":"2017"},{"key":"e_1_3_2_1_19_1","volume-title":"Journal of Statistical Software","author":"R","year":"2017"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2012.09.005"}],"event":{"name":"CIKM '19: The 28th ACM International Conference on Information and Knowledge Management","location":"Beijing China","acronym":"CIKM '19","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 28th ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357384.3358092","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357384.3358092","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:18Z","timestamp":1750203858000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357384.3358092"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,3]]},"references-count":20,"alternative-id":["10.1145\/3357384.3358092","10.1145\/3357384"],"URL":"https:\/\/doi.org\/10.1145\/3357384.3358092","relation":{},"subject":[],"published":{"date-parts":[[2019,11,3]]},"assertion":[{"value":"2019-11-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}