Ensemblesearch: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

23 July 2024

  • curprev 07:0507:05, 23 July 2024‎ Sean talk contribs‎ 2,011 bytes +2,011‎ Created page with "===Purpose=== Search for optimal ensemble using nchoosek method. ===Synopsis=== : results = ensemblesearch(models,mink,maxk,aggregation); ===Description=== Creating the best ensemble from a set of candidate child models can take time. Find the best ensemble from the provided child models using ensemblesearch. The algorithm uses an nchoosek approach to create and test the performance of every combination of ensembles from size ''mink'' to ''maxk''. For example,..."
Retrieved from "https://www.wiki.eigenvector.com/index.php?title=Ensemblesearch"