Search Results for "data collection algorithm" - Page 5

This advanced machine learning algorithm is a Michigan-style learning classifier system (LCS) developed to specialize in classification, prediction, data mining, and knowledge discovery tasks. Michigan-style LCS algorithms constitute a unique class of algorithms that distribute learned patterns over a collaborative population of of individually interpretable IF:THEN rules, allowing them to flexibly and effectively describe complex and diverse problem spaces.

This project includes the implementation of a neural network MLP, RBF, SOM and Hopfield networks in several popular programming languages. The project also includes examples of the use of neural networks as function approximation and time series prediction. Includes a special program makes it easy to test neural network based on training data and the optimization of the network.

A proximity forest is a data structure that allows for efficient computation of approximate nearest neighbors of arbitrary data elements in a metric space. See: O'Hara and Draper, "Are You Using the Right Approximate Nearest Neighbor Algorithm?", WACV 2013 (best student paper award). One application of a ProximityForest is given in the following CVPR publication: Stephen O'Hara and Bruce A.

...The repository covers a broad set of topics such as linear regression, logistic regression, neural networks, clustering, support vector machines, and recommender systems. Each folder corresponds to a specific algorithm or concept, making it easy for learners to navigate and practice. The exercises serve as practical, hands-on reinforcement of theoretical concepts taught in the course. This collection is valuable for students and practitioners who want to strengthen their skills in machine learning through coding exercises.

VFML -- Very Fast Machine Learning toolkit. A collection of tools, learners, and APIs for working with high-speed data streams and very large data sets.

pyBoids is a free/open-source project that implements (in Python/TKinter) Craig Reynold's famous boids algorithm. This algorithm intelligently simulates flocking, herding, swarming, and schooling behavior as found in nature.

nBoost is a suite of boosting algorithms designed to solve binary classification problems on data that is not linearly separable by a convex combination of base hypotheses, i.e. noisy data. WARNING: Active development. Underlying algorithm is unstable.