Search Results for "learning" - Page 3

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. Draper, "Scalable Action Recognition with a Subspace Forest," IEEE Conference on Computer...

This project has moved to github at http://lmwtree.devries.ninja.

The Local Binary Pattern (LBP) is a texture operator that is used in several different computer vision applications and implemented in a variety of platforms. When selecting a suitable LBP implementation platform, the specific application and its requirements in terms of performance, size, energy efficiency, cost and developing time has to be carefully considered. This is a software toolbox that collects software implementations of the Local Binary Pattern operator in several...

jsGorithm is a Javascript algorithm execution viewer that can be used as an educative tool for introductory courses on programming and algorithmics, with programs written in a subset of C/C++/Javascript. It can be used for teaching and learning.

...The method is based on SVM but other ML algorithms can be adopted. The method details are explained in the following paper: Ehsan Emadzadeh, Azadeh Nikfarjam, and Graciela Gonzalez. 2011. Double Layered Learning for Biological Event Extraction from Text. In Proceedings of the BioNLP 2011 Workshop Companion Volume for Shared Task, Portland, Oregon, June. Association for Computational Linguistic

SVM# is a svm(support vector machine) classification implemented in C#. The project contains both train and predict modules.

RobGP is a genetic programming system written from the ground up in C++. It's primary goals are efficiency, ease of use, and extensibility. It's distinguishing feature is that it has a modified version of Koza's architecture altering operations.

The Mars Rover Simulator project is based on the evolutionary robotics paradigm where an artificial agent acquires its skills through the process of artificial evolution. This simulator can be useful to evolve neural network controllers for the rover

An information extraction library implementing modern algorithms for the extraction of named entities from text.

A java tool for anytime and interactive sequence mining. Aims at providing users with a way of analyzing her activity traces and extract activity schemes from them.

This program generates customizable hyper-surfaces (multi-dimensional input and output) and samples data from them to be used further as benchmark for response surface modeling tasks or optimization algorithms.

Very basic cellular automaton implementation in C#. Based upon the "Togetherness" algorithm described at http://www.hermetic.ch/pca/tg.htm.

This chess program changes its strength to give the best match against you. Eventually it learns to beat you specifically through learning alogirthms. Features included transposition tables and a elementary 3-piece endgame tablebase.

Now part of Apache's Mahout machine learning project at http://mahout.apache.org/-- please see there for latest info and code and releases and support!

Aleph is both a multi-platform machine learning framework aimed at simplicity and performance, and a library of selected state-of-the-art algorithms.

The Free Connectionist Q-learning Java Framework is an library for developing learning systems. Keywords: qlearning, artificial intelligence, alife, neural nets, neural networks, machine learning, reinforcement learning unsupervised learning agents lejos

Ocean with fishes who's are learning and evolving.

Hipo is a hypothetical computer to facilitate the learning of machine language. The student can use hipo to develop simple programs and understand the internal logic of a computer. There is a plan to implement Donald Knuth's MMIX machine language, also.

Classic game solved with MinMax algorithm (full solution tree) and simple Heuristics. Specially for learning and teaching computer AI

Conrad is both a high performance Conditional Random Field engine which can be applied to a variety of machine learning problems and a specific set of models for gene prediction using semi-Markov CRFs.

KNN-WEKA provides a implementation of the K-nearest neighbour algorithm for Weka. Weka is a collection of machine learning algorithms for data mining tasks. For more information on Weka, see http://www.cs.waikato.ac.nz/ml/weka/.

A Java implementation of the NEAT algorithm as created by Kenneth O Stanley. Also provides a toolkit for further experiments to be created and can provide both local and distributed learning environments.

MultiBoost is a C++ implementation of the multi-class AdaBoost algorithm. AdaBoost is a powerful meta-learning algorithm commonly used in machine learning. The code is well documented and easy to extend, especially for adding new weak learners.