OpenAlex
PricingAboutJobs
Log inGet started
Work

Fast Random Forest Algorithm via Incremental Upper Bound

HTML

Year: 2019
Type: conference-paper
Source: ACM International Conference on Information and Knowledge Management (CIKM)
DOI: 10.1145/3357384.3358092
Authors: Yasuhiro Fujiwara, Yasutoshi Ida, Sekitoshi Kanai, Atsutoshi Kumagai, Junya Arai, Naonori Ueda
Institutions: NTT (Japan), NTT Software Corporation (Japan)
Language: English

Topic: Data Mining Algorithms and Applications
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Keywords: random forest, impurity reduction, decision tree, ensemble learning, training efficiency, computation cost reduction

Open Access status: closed
OpenAlex ID: W2987209424
FWCI: 0.603
Cites: 14
Cited by: 8
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security