Search Results for "forest"

This application allow user to predict dissolution profile of solid dispersion systems based on algorithms like symbolic regression, deep neural networks, random forests or generalized boosted models. Those techniques can be combined to create expert system. Application was created as a part of project K/DSC/004290 subsidy for young researchers from Polish Ministry of Higher Education.

...The plan is a massively multiplayer space where we design, evolve, and play with game objects and do AI research together which controls those game objects along with directly playing the games. The main data format is, from xorlisp which is also in progress, immutable binary forest nodes, so if millions of people build that together nobody can damage or change anyone else's data since its all constant. You dont change variables. You create new data that points at existing constant data, as deep as you need it. I have mindmap lists, definitions, and 2 editable properties working that way with 2 kinds of event listeners that work locally. ...

Realtime bigdata tool at the bit level based on immutable AVL forest which can be run in memory or, in future versions, as a merkle forest like a blockchain. Main object is a sparse bit string (Bits) that efficiently scales up to 2^63 bits normally compressed as forest has duplicated substrings. Bits objects support reading bit, byte, short, int, or long (Java primitives) at any bit index in 64 bit range.

...New Features Include: -All the Features of the 3.7.3 Weka Package -Multi-Threaded ensemble learning -An enhancement on the popular RandomForest Learner based on "Dynamic Integration with Random Forests" by Tsymbal et al. 2006 and "Improving Random Forests" by Robnik-Sikonja 2004. -More enhancements to the voting mechanisms in Random Forest -Possibility to output Feature Weights according to the original Breiman Paper 2001

Random Forest classification implementation in Java based on Breiman's algorithm (2001). It assumes the data is in the form [ X_1, X_2, . . ., X_M, Y ] where Y \in {0, 1, . . ., C}. The user must define M, C, and m initially.