| Author: | Bernhard Pfahringer, Geoff Holmes and Peter Reutemann | |
| Category: | Classification | |
| Changes: | Improved feedback if specified parameters (property paths) do not exist. Implementation changed to use Futures. | |
| Date: | 2017-07-08 | |
| Depends: | weka (>=3.7.13-SNAPSHOT) | |
| Description: | Performs a grid search of parameter pairs for a classifier and chooses the best pair found for the actual predicting. The initial grid is worked on with 2-fold CV to determine the values of the parameter pairs for the selected type of evaluation (e.g., accuracy). The best point in the grid is then taken and a 10-fold CV is performed with the adjacent parameter pairs. If a better pair is found, then this will act as new center and another 10-fold CV will be performed (kind of hill-climbing). This process is repeated until no better pair is found or the best pair is on the border of the grid. In case the best pair is on the border, one can let GridSearch automatically extend the grid and continue the search. Check out the properties 'gridIsExtendable' (option '-extend-grid') and 'maxGridExtensions' (option '-max-grid-extensions <num>'). GridSearch can handle doubles, integers (values are just cast to int) and booleans (0 is false, otherwise true). float, char and long are supported as well. The best classifier setup can be accessed after the buildClassifier call via the getBestClassifier methods. | |
| License: | GPL 3.0 | |
| Maintainer: | Weka team <wekalist{[at]}list.scms.waikato.ac.nz> | |
| PackageURL: | http://prdownloads.sourceforge.net/weka/gridSearch1.0.11.zip?download | |
| URL: | http://weka.sourceforge.net/doc.packages/gridSearch | |
| Version: | 1.0.11 |