Search Results for "simple decision tree"

A Julia interface for defining, solving and simulating partially observable Markov decision processes and their fully observable counterparts. The POMDPs.jl package contains only the interface used for expressing and solving Markov decision processes (MDPs) and partially observable Markov decision processes (POMDPs). The POMDPTools package acts as a "standard library" for the POMDPs.jl interface, providing implementations of commonly-used components such as policies, belief updaters,...

REDUCE is a portable general-purpose computer algebra system. It is a system for doing scalar, vector and matrix algebra by computer, which also supports arbitrary precision numerical approximation and interfaces to gnuplot to provide graphics. It can be used interactively for simple calculations (as illustrated in the screenshot below) but also provides a full programming language, with a syntax similar to other modern programming languages. REDUCE supports alternative user interfaces...

Julia implementation of Decision Tree (CART) and Random Forest algorithms.

Interactive error messages for the Julia REPL. Just start using your REPL normally. Once you hit an error you'll be presented with an interactive tree representing your stacktrace which you can explore. To turn interactive errors off and return to using normal stack traces call toggle(). Call toggle() again to turn it back on. Press up and down arrows to move through the stacktrace. Press space to fold or unfold the currently selected line. A + will appear on folded lines. Press enter once...

MLPACK is a C++ machine learning library with emphasis on scalability, speed, and ease-of-use. Its aim is to make machine learning possible for novice users by means of a simple, consistent API, while simultaneously exploiting C++ language features to provide maximum performance and flexibility for expert users. * More info + downloads: https://mlpack.org * Git repo: https://github.com/mlpack/mlpack

...It is an explicit design decision that any data not required for graph manipulation (attributes and other information, for example) is expected to be stored outside of the graph structure itself. Such data lends itself to storage in more traditional and better-optimized mechanisms.