Search Results for "rules"

Weka is a collection of machine learning algorithms for solving real-world data mining problems. It is written in Java and runs on almost any platform. The algorithms can either be applied directly to a dataset or called from your own Java code.

Neuroph is lightweight Java Neural Network Framework which can be used to develop common neural network architectures. Small number of basic classes which correspond to basic NN concepts, and GUI editor makes it easy to learn and use.

Scene is a computer vision framework that performs background subtraction and object tracking, using two traditional algorithms and three more recent algorithms based on neural networks and fuzzy classification rules. For each detected object, Scene sends TUIO messages to one or several client applications. The present release features GPU accelerated versions of all the background subtraction methods and morphological post processing of the object blobs with dilation and erosion filters, implemented in OpenCL. The framework was mainly designed as a toolkit for the rapid development of interactive art projects that explore dynamics of complex environments. ...

...It is a user-friendly portable tool designed and developed in order to make easier knowledge extraction and representation for fuzzy systems, paying special attention to interpretability issues. GUAJE lets the user define expert variables and rules, but also provide supervised and fully automatic learning capabilities. Both types of knowledge, expert and induced, are integrated under the expert supervision, ensuring interpretability, simplicity and consistency of the knowledge base along the whole process. Notice that, GUAJE is is an upgraded version of the free software called KBCT (Knowledge Base Configuration Tool).

This project is a WEKA (Waikato Environment for Knowledge Analysis) compatible implementation of MODLEM - a Machine Learning algorithm which induces minimum set of rules. These rules can be adopted as a classifier (in terms of ML). It is a sequential covering algorithm, which was invented to cope with numeric data without discretization. Actually the nominal and numeric attributes are treated in the same way: attribute's space is being searched to find the best rule condition during rule induction. ...

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

TimeSleuth discovers temporal decision rules. It also judges the (a)causality of the rules. TimeSleuth can discover rules that involve time: {if (rainy_yesterday = true) then rainy_today = true}, or {if (rainy_tomorrow = true) then rainy_today = true}.