A Random Forest implementation for JavaScript supporting distributed computation.
This is a slightly modified version of forestjs by karpathy, now available via npm and an extension to use CrowdProcess to computate data at scale.
npm install forestjsimport {RandomForest} from 'forestjs'
var forest = new RandomForest()
var data = [
[0,0],
[1,0],
[1,1]
];
var labels = ['a', 'b', 'a'];
forest.trainCRP(data, labels, { email: '<MAIL>', password: '<PASSWORD>' }).on('end', function(){
console.log(forest);
})For a concrete example checkout out the browser or node demo. Be aware that the browser demo does not care about security and simply uses the provided credentials directly (E-Mail + Password or Token).
Andrej Karpathy July 2012
forestjs is a Random Forest implementation for Javascript. Currently only binary classification is supported. You can also define your own weak learners to use in the decision trees.
Can be found here: http://cs.stanford.edu/~karpathy/svmjs/demo/demoforest.html
Corresponding code is inside /demo directory.
The simplest use case:
<script src="./svmjs/lib/randomforest.js"></script>
<script>
forest = new forestjs.RandomForest();
// data is 2D array of size NxD. Labels is 1D array of length D
forest.train(data, labels);
// testInstance is 1D array of length D. Returns probability
labelProbability = forest.predictOne(testInstance);
// testData is 2D array of size MxD. Returns array of probabilities of length M
labelProbabilities = forest.predict(testData);
</script>The library supports arbitrary weak learners. Currently implemented are a decision stump (1-dimensional decisions) and 2D decision stumps.
options.trainFun = function(data, labels, ix, options) {
// create some decision rule based on data and labels.
// Only use data at indeces given in ix. Ignore the rest of the data.
// this is done for efficiency.
// save parameters that describe your model
model.parameter1= p1;
model.parameter2= p2;
return model;
}
options.testFun = function(inst, model) {
// use model.parameter1 and model.parameter2 to return a 1 or -1 for
// example instance inst. This determines if it will be passed down
// left or right in the tree.
return inst[0] > model.parameter1 ? 1 : -1; // silly example
}
forest.train(data, labels, options); // will train forest with the custom weak learners aboveThere are 3 main options that can be passed in to training:
options = {};
options.numTrees = 100; // defaults
options.maxDepth = 4;
options.numTries = 10;
forest.train(data, labels, options);numTrees: You want to set this as high as you can computationally afford. Performance scales linearly with this parameter.
maxDepth: The depth of each of the trees in the forest. If your data is complicated, or has high dimension, you may want to increase this. If this is set too high, you may start to overfit but having many trees can help compensate for this. maxDepth is also the number of decisions that will be done on each data instance. Space complexity inreases exponentially (base 2, as these are trees) with this parameter and time complexity increases linearly.
numTries: The number of random hypotheses that decision stump learners that come default with this implementation will generate when training. If this is too high, you will start to overfit as nodes will lose variety. If you're using your own weak learners trainFun and testFun, ignore this.
It is best to cross-validate maxDepth and numTries. For numTrees, the more the better always.
Random Forests are awesome: They train extremely quickly and at testing time they are even faster. In general this is a great and flexible algorithm and forms a standard benchmark in Kaggle, for example. The only place these can suffer is if your dimensionality is too high (>20 or so) but this can be addressed with appropriate choice of weak learner at nodes. One possibility is to select random 10 dimensions and train a small logistic regression with early stopping at every node.
MIT