English
CART is Salford Systems' flagship data mining software. CART is an easy-to-use decision tree that automatically sifts large, complex databases, searching for and isolating significant patterns and relationships. This discovered knowledge is then used to generate reliable, easy-to-grasp predictive models for applications such as finding best prospects and customers, targeted marketing, detecting credit card fraud, and managing credit risk.
Click Here to see the features of the Student Basic version and Faculty Academic version.
| Available for | ||
CART's features provide Stability and Reliability:
CART uses an intuitive, Windows-based interface, making it accessible to both
technical and non-technical users. Underlying the "easy" interface, however, is
a mature theoretical foundation that distinguishes CART from other methodologies
and other decision trees. Salford Systems' CART is the only decision tree system
based on the original CART code developed by world-renowned Stanford University
and University of California at Berkeley statisticians; this code now includes
enhancements that were co-developed by Salford Systems and CART's originators.
Based on a decade of machine learning and statistical research, CART provides
stable performance and reliable results.
Characteristics of its methodology are:
A reliable pruning strategy
CART's developers determined definitively that no stopping rule could be relied
on to discover the optimal tree, so they introduced the notion of over-growing
trees and then pruning back. This idea, fundamental to CART, ensures that
important structure is not overlooked by stopping too soon. Other decision tree
techniques use problematic stopping rules.
A powerful binary split search approach
CART's binary decision trees are more sparing with data and detect more
structure before too little data are left for learning. Other decision tree
approaches use multi-way splits that fragment the data rapidly, making it
difficult to detect rules that require broad ranges of data to discover.
Automatic self-validation procedures
In the search for patterns in databases it is essential to avoid the trap of "overfitting,"
or finding patterns that apply only to the training data. CART's embedded test
disciplines ensure that the patterns found will hold up when applied to new
data. Further, the testing and selection of the optimal tree are an integral
part of the CART algorithm. In other decision tree techniques, testing is
conducted after the fact and tree selection is left up to the user.
In addition, CART accommodates many different types of real world modeling
problems by providing a unique combination of automated and/or user-specified
solutions:
Surrogate splitters intelligently handle missing values
CART handles missing values in the database by substituting "surrogate
splitters," which are back-up rules that closely mimic the action of primary
splitting rules. The surrogate splitter contains information that is typically
similar to what would be found in the primary splitter. Other products'
approaches treat all records with missing values as if the records all had the
same unknown value; with that approach all such "missings" are assigned to the
same bin. In CART, each record is processed using data specific to that record,
thus allowing records with different data patterns to be handled differently,
resulting in a better characterization of the data.
Adjustable misclassification penalties help avoid the most costly errors
CART can accommodate situations in which some misclassifications, or cases that
have been incorrectly classified, are more serious than others. CART users can
specify a higher penalty for misclassifying certain data, and the software will
steer the tree away from that type of error. Further, when CART cannot guarantee
a correct classification, it will try to ensure that the error it does make is
less costly. If credit risk is classified as low, moderate, or high, for
example, it would be much more costly to classify a high risk person as low risk
than as moderate risk. Traditional data mining tools cannot distinguish between
these errors.
Alternative splitting criteria make progress when other criteria fail
CART includes seven single variable splitting criteria - Gini, symmetric Gini,
twoing, ordered twoing and class probability for classification trees, and least
squares and least absolute deviation for regression trees - and one
multi-variable splitting criteria, the linear combinations method. The default
Gini method typically performs best, but, given specific circumstances, other
methods can generate more accurate models. CART's unique "twoing" procedure, for
example, is tuned for classification problems with many classes, such as
modeling which of 170 products would be chosen by a given consumer. To deal more
effectively with select data patterns, CART also offers splits on linear
combinations of continuous predictor variables.
WHO CAN BUY:
Only Students and Professors qualify for these academic
discounts. Students must provide a currently dated Student ID along with the
Current Class Schedule. Professors must provide a currently dated School ID and
a Course Syllabus. Education
proof/verification must be received and approved before the lisenceing
information is released.
Windows:
Minimum System Requirements
We suggest the following minimum and recommended, system requirements:
•80486 processor or higher.
•512MB of random-access memory (RAM). This value depends on the "size" you have
purchased (64MB, 128MB, 256MB, 512MB, 1GIG). While all versions may run with a
minimum of 32MB of RAM, we CANNOT GUARANTEE they will. We highly recommend that
you follow the recommended memory configuration that applies to the particular
version you have purchased. Using less than the recommended memory configuration
results in hard drive paging, reducing performance significantly, or application
instability.
•Hard disk with 40 MB of free space for program files, data file access utility,
and sample data files.
•Additional hard disk space for scratch files (with the required space
contingent on the size of the input data set).
•CD-ROM or DVD drive.
•Windows XP/2003/2008 and Windows 7.
Recommended System Requirements
Because Salford tools are extremely CPU intensive, the faster your CPU the
faster they will run. For optimal performance, we strongly recommend they run on
a machine with a system configuration equal to, or greater than, the following:
•Pentium 4 processor running 2.0+ GHz.
•2 GIG of random-access memory (RAM). This value depends on the "size" you have
purchased (64MB, 128MB, 256MB, 512MB, 1GIG). While all versions may run with a
minimum of 32MB of RAM, we CANNOT GUARANTEE they will. We highly recommend that
you follow the recommended memory configuration that applies to the particular
version you have purchased. Using less than the recommended memory configuration
results in hard drive paging, reducing performance significantly, or application
instability.
•Hard disk with 40 MB of free space for program files, data file access utility,
and sample data files.
•Additional hard disk space for scratch files (with the required space
contingent on the size of the input data set).
•CD-ROM or DVD drive.
•Windows XP/2003/2008 and Windows 7.
•2 GIG of additional hard disk space available for virtual memory and temporary
files.
Ensuring Proper Permissions
If you are installing on a machine that uses security permissions, please read
the following note.
•You must belong to the Administrator group on Win-XP, Win-2003/2008 and Windows
& to be able to properly install and license. Once the application is installed
and licensed, any member with read/write/modify permissions to the applications
/bin and temp directories can execute and run the application.
UNIX/Linux
Supported Architectures
•Alpha: DEC 3000 or AlphaServer running Tru64 UNIX 5.0 or higher
•Linux/i386: i586 or higher processor; Linux 2.4 or higher kernel; glibc 2.3 or
higher
•Linux/AMD64: AMD64 or Intel EM64T processor; Linux 2.6 or higher kernel; glibc
2.3 or higher
•Sun: UltraSPARC processor; Solaris 2.6 or higher
•RS/6000: POWER or PowerPC processor; AIX 4.2 or higher
•HP 9000: PA/RISC 1.1 or higher processor; HP/UX 11.x
•SGI: MIPS 4 or higher processor; IRIX 6.5
Minimum System Requirements
•Minimum RAM requirement for all non-GUI app's is 32 MB of random-access memory
(RAM). This value depends on the "size" you have purchased (64MB, 128MB, 256MB,
512MB, 1GIG).
•Hard disk with 40 MB of free space for program files, data file access utility,
and sample data files.
•Additional hard disk space for scratch files (with the required space
contingent on the size of the input data set).
Recommended System Requirements
•Recommended random-access memory (RAM) is 1.5 times the licensed data limit (32
MB, 64 MB, etc), up to the maximum permitted by the target architecture. On UNIX
systems, it is generally recommended that there be at least twice as much swap
space as there is RAM.
•Hard disk with 40 MB of free space for program files, data file access utility,
and sample data files.
•Additional hard disk space for scratch files (with the required space
contingent on the size of the input data set).
| No reviews found |