fuzzyweka provides an implementation of a classifier for fuzzy classification based on fuzzy if-then rules for WEKA.This classifier renowned the Simple Fuzzy Grid method proposed by the work of Ishibuchi and Al.
JKalman is an Open Source Javaimplementation of Kalman filter.
Kalman filter is an efficient computational (recursive) tool to estimate the dynamic state of a process in a way that minimizes the mean of error.
Our generous forever free tier includes the full platform, including the AI Assistant, for 3 users with 10k metrics, 50GB logs, and 50GB traces.
Built on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
vbWeka is a class library of a collection of machine learning algorithms in VB.NET. It is designed in the same style of the popular Java machine learning package - weka. In this release, B40, ID3 decision trees, IB1, Perceptron, Backpropagation, NaiveBay
HDP-IS is the engine of a intellectual services rendering system. The purpose of the project is analysis and implementation of new control models and tools of information interaction during process of rendering of intellectual services.
RL Poker is a study project Javaimplementation of an e-soft on-policy Monte Carlo Texas Hold'em poker reinforcement learning algoritm with a feedforward neural network and backpropagation. It provides a graphical interface to monitor game rounds.
This is an implementation of the Granular Neural Network architecture defined by S. Dick, A. Tappenden, C. Badke, O. Olarewaju. It is provided for the use of the public, and the convenience of researchers who may wish to develop or use this new system.
The Simple Interface for Global Optimization Algorithms allows the specification of arbitrary search/optimization problems, solving of these problems, and the specification and implementation of optimization algorithms like evolutionary algorithms.
With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.
You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
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.
Wodka is the implementation of a genetic algorithm (GA) that can bread two dimensional structures that might be used as robots in sodarace competitions.
DrPangloss is a python implementation of a three operator genetic algorithm, complete with a java swing GUI for running the GA and visualising performance, generation by generation
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/.
An implementation of the Compositional Pattern Producing Networks (CPPNs) and Neuro-Evolution of Augmenting Topologies (NEAT) proposed by Kenneth O. Stanley, based on the Genetic Art tool from Mattias Fagerlund.
A Javaimplementation 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.
JavaSOM package is an implementation of self-organizing maps (SOM), based on neural networks, to Java2 programming language and utilization of XML based application languages for information exchange and visualization.
ANJI
(Another NEAT JavaImplementation)
Built on top of existing OpenSource projects, ANJI is an implementation of NEAT (Neuro-Evolution of Augmenting Topologies), an algorithm for evolving artificial neural networks.
Message Transport Protocol (MTP) implementation using XMPP for the Java Agent DEvelopment framework (JADE). Produced under the Google Summer of Code program with the help of Quantum Leap Interactive and Jabber, Inc.
CLearJ is a clean Java-implementation of Common Lisp. The big goals are ANSI standard compliance, interoperability with Java and integration with scripting environments. This project is meant to be a sibling to CLearSharp, with sharing of implementation.
An ANN design/implementation focused to work with optimally with NEAT (http://www.cs.utexas.edu/users/kstanley/neat.html). Semiann uses a sparse matrix to fill out the nodes, connections, weights, biases and activation functions for an ANN.
CLearSharp is a clean C#-implementation of Common Lisp. The big goals are ANSI standard compliance, interoperability with Java and integration with scripting environments. This project is meant to be a sibling to CLearJ, with sharing of implementation.
JPlan is a javaimplementation of GraphPlan, a fast domain independent planner. JPlan allows developers and researchers to use and experiment with this planner, build variants of GraphPlan, and add a planning capability to their new projects.