Search Results for "decision tree" - Page 2

Adaboost extensions for cost-sentive classification CSExtension 1 CSExtension 2 CSExtension 3 CSExtension 4 CSExtension 5 AdaCost Boost CostBoost Uboost CostUBoost AdaBoostM1 Implementation of all the listed algorithms of the cluster "cost-sensitive classification". They are the meta algorithms which requires base algorithms e.g. Decision Tree Moreover, Voting criteria is also required e.g. Minimum expected cost criteria Input also requires to load an arff file and a cost matrix (sample arff and cost files are uploaded for users' reference) This extension uses weka for classification and generates the classification model along with confusion matrix. ...

Simple, Pythonic, text processing, Sentiment analysis, part-of-speech tagging, noun phrase extraction, translation, and more. It provides a simple API for diving into common natural language processing (NLP) tasks such as part-of-speech tagging, noun phrase extraction, sentiment analysis, classification, translation, and more. TextBlob stands on the giant shoulders of NLTK and pattern, and plays nicely with both. Supports word inflection (pluralization and singularization) and lemmatization,...

Useful API wrapper for well known C5.0 decision tree algorithm. Source algorithm code downloaded from http://www.rulequest.com/ (version 2.09) under GPL

JBoost is a simple, robust system for classification. JBoost contains implementations of several boosting algorithms in an alternating decision tree framework. In addition, JBoost provides extensible software for adding more learning algorithms.

The DIDT (Distributed Id3-based Decision Tree) algorithm implementation in JAVA.

Project aim to provide simple easy APIs for Java developers to use interactive abilities in their Java Applications like speech recognition, handwriting recognition, use of web cam , sound record/play, decision trees , text to speech and many others.

Compiler of a 0+ order rule system. From a ruleset using attribute value formalism a decision tree is build and java/C/C++ execution code will be generated.

Avenzoar is a one-year exploration of renal cell carcinoma morphology and its related single nucleotide polymorphisms (SNPa) as a method of automating diagnosis of cancer by using a computer-aided decision tree controlled by analytical statistics.

Highly reusable and extensible Decision-Tree (Max-Gain) framework comprising of comprehensive input-processing and display functionality. Handles nominal, linear, continuous data. For preliminary description, refer - http://sushain.com/blog/archives/

AI Magik is a templatized C++ library providing basic predictors for supervised learning as reusable modules. Currently, the library features CNF Predictor, DNF predictor, decision tree, naive bayes, linear separator and SVM based predictors.

Matlab Classification Toolbox contains implementations of the following classifiers: Naive Bayes, Gaussian, Gaussian Mixture Model, Decision Tree and Neural Networks. This toolbox allows users to compare classifiers across various data sets.

The Decision Tree Learning algorithm ID3 extended with pre-pruning for WEKA, the free open-source Java API for Machine Learning. It achieves better accuracy than WEKA's ID3, which lacks pre-pruning.Info: http://bruno-wp.blogspot.com/search/label/Softwar

Zabal6 is a machine learning student tool based on decision tree learning, focused in the area of knowledge discovery (data mining), and inspired on See5. Zabl6 is a C++ program for Linux and windows O.S, with a intuitive graphical interface.

Jubjub is a decision tree based framework for automating *NIX administrative processes and reacting to events. Working well with a network monitor such as Nagios, you can expose, document, and add notifications to scripts in one step.

produce full software package using the binary decision diagram (BDD) representation to manipulate logic maps for design optimization objectives multiplyer{like(A+B)(C)(D)}In C++ Core.C++ GUI.VB6 Verilog Modules Quin McCluskey Multi Functions Operations

Wizard-style web interface for structured information trails - an n-ary decision tree structure based on true/false logic. It can be used as a 'Wizard', an expert system, or as a backend for interactive fiction.

Gluon is a simple decision-tree daemon that executes external programs (scripts) to determine the path-flow within the decision-tree. It essentially operates as a basic IF-THEN-ELSE expert system that can be used to monitor and take action.

DTreeJungle provides educational applets to teach the concepts of decision trees for regular pattern recognition.

A fast decision tree program featuring distributed ensemble learning across multiple processors using MPI. Has been run on 1 cpu, small clusters, and the ASCI Blue supercomputer. Ensembles are often more accurate than their single classifier counterparts

Tree Climber allows you to solve decision trees, which are used in decision support systems. You can determine the value of both arcs probabilities and leaf nodes values by means on variables and mathematical functions.