Downloads |
|
|
The program price depends
on the licenses you buy.
For the price structure check the table below:
|
1 License |
€200 / License |
|
3 Licenses |
€180 / License |
|
10+ Licenses |
€120 / License |
Buy the full
windows version
here
Student License
------------------
If you are a student you can buy an academic license for
a reduced price (€60).
A prerequisite
for this is to validate that you are a student (with
your student ID or class enrollment)
Click
here for the special
student price
Academic
Course License
-------------------------
For
academic courses on Artificial Intelligence or
Optimization Engineering we've got a special offer that
includes unlimited number of licenses (up to 200) for a
period of one year. A prerequisite for this is to
provide the lesson details or similar evidence. The
price for this package is: (€500)
Click
here for the
special course price |
|
What is the difference between the free and
the registered version?
The free version restricts the maximum number of generations
and the initial population that can be used. If you like the free
version you are highly encouraged to get the full version to exploit the
full potential of this program.
What is new at Version 2?
Version 2
includes the following enhancements:
* A module to precisely visualize the output decision tree. The tree can
be zoomed, traversed and viewed through different angles.
* An option to cross-validate the data set. The number of
cross-validation iterations can be set by the user.
* An option to save a log of the different decision trees that are
created through evolution.
* Precise rules at every node (including attribute name).
* Numerous minor improvements at every aspect of the program.
Acknowledgements
This program
uses the following programs and components:
GALib - Galib is a C++ library of Generic Algorithm Components.
For more info visit:
http://lancet.mit.edu/ga/
VCG - Visualization of Compiler Graphs - The VCG tool reads a
textual and readable specification of a graph and visualizes the graph.
If not all positions of nodes are fixed, the tool layouts the graph
using several heuristics as reducing the number of crossings, minimizing
the size of edges and centering of nodes.For more info visit:
http://rw4.cs.uni-sb.de/users/sander/html/gsvcg1.html
* You may periodically receive
newsletter emails for new versions of GATree. Your privacy is guaranteed
with us. We never share or sale your personal information.
|
