Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 2080650

From MaRDI portal
Publication:4473544
Jump to:navigation, search

zbMATH Open1050.68578MaRDI QIDQ4473544FDOQ4473544


Authors: Kohei Hatano Edit this on Wikidata


Publication date: 4 August 2004


Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2225/22250077.htm

Title of this publication is not available (Why is that?)



Recommendations

  • A simple boosting algorithm using multi-way branching decision trees
  • Approximating Decision Trees with Multiway Branches
  • On the boosting ability of top-down decision tree learning algorithms
  • scientific article; zbMATH DE number 1256765
  • scientific article; zbMATH DE number 2089094
  • scientific article; zbMATH DE number 2086341
  • A branch \& bound algorithm to determine optimal cross-splits for decision tree induction


Mathematics Subject Classification ID

Computational learning theory (68Q32)



Cited In (2)

  • A simple boosting algorithm using multi-way branching decision trees
  • Title not available (Why is that?)





This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473544)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4473544&oldid=18541801"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 February 2024, at 06:04. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki