Ultimate Classification Tree:
CART is the ultimate classification tree that has revolutionized the entire field of advanced analytics and inaugurated the current era of data mining. CART, which is continually being improved, is one of the most important tools in modern data minging. Others have tried to copy CART but no one has succeeded as evindeced by unmatched accuracy, performance, feature set, built-in automation and easue of use. Designed for both non-technical and technical users, CART can quicly reveal important data relatioinships that could remain hidden using other analytical tools..
Proprietary Code:
Technically, CART is based on landmark mathematical theory introduced in 1984 by four world-renowned statisticians at Stanford University and the University of California at Berkely. Salford Systems’ implenmentation of CART is the only decision tree software embodying the original proprietary code. The CART creators continure to collaborate with Salford Systems to continually enhance CART with proprietary advances.
Fast and Versatile:
Patented extensions to CART are specifically designed to enhance results for market research and web analytics. CART supports high-speed deployment, allowing Salford models to predict and score in real time on a massive scale. Over the years CART has become known as the fastest and most verstaile predicitve modeling algorithm available to analyst it is also used as a foundation to many modern data mining approached based on bagging and boosting.
COMPONENTS | BASIC | PRO | PROEX | ULTRA |
Modeling Engine: CART (Decision Trees) |
* | * | * | * |
Linear Combination Splits | * | * | * | * |
Optimal tree selection based on area under ROC curve | * | * | * | * |
User defined splits for the root node and its children | * | * | * | |
Automation: Generate models with alternative handling of missing values (Battery MVI) | * | * | * | |
Automation: RULES: build a model using each splitting rule (six for classification, two for regression). | * | * | * | |
Automation: Build a series of models using all available splitting strategies (six for classification, two for regression) (Battery RULES) | * | * | * | |
Automation: Build a series of models varying the depth of the tree (Battery DEPTH) | * | * | * | |
Automation: Build a series of models changing the minimum required size on parent nodes (Battery ATOM) | * | * | * | |
Automation: Build a series of models changing the minimum required size on child nodes (Battery MINCHILD) | * | * | * | |
Automation: Explore accuracy versus speed trade-off due to potential sampling of records at each node in a tree (Battery SUBSAMPLE) | * | * | * | |
Multiple user defined lists for linear combinations | * | * | ||
Constrained trees | * | * | ||
Ability to create and save dummy variables for every node in the tree during scoring | * | * | ||
Report basic stats on any variable of user choice at every node in the tree | * | * | ||
Comparison of learn vs. test performance at every node of every tree in the sequence | * | * | ||
Hot-Spot detection to identify the richest nodes across multiple trees | * | * | ||
Automation: Vary the priors for the specified class (Battery PRIORS) | * | * | ||
Automation: Build a series of models limiting the number of nodes in a tree (Battery NODES) | * | * | ||
Automation: Build a series of models trying each available predictor as the root node splitter (Battery ROOT) | * | * | ||
Automation: Explore the impact of favoring equal sized child nodes (Battery POWER) | * | * | ||
Automation: Vary the priors for the specified class (Battery PRIORS) | * | * | ||
Automation: Build a series of models by progressively removing misclassified records thus increasing the robustness of trees and posssibly reducing model complexity (Battery REFINE) | * | * | ||
Automation: Bagging and ARCing using the legacy code (COMBINE) | * | * | ||
Build a CART tree utilizing the TreeNet engine to gain speed as well as alternative reporting | * | |||
Build a Random Forests model utlizing the CART engine to gain alternative handling of missing values via surrogate splits (Battery BOOTSTRAP RSPLIT) | * |
WINDOWS
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.
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.
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 Windows 2003 / 2008, Windows 7 / 8 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.
LICENSING APPLICATION
The Salford Predictive Modeler uses a system of application system ID and associated unlock key. When installation is complete, the user will need to email the application “system ID.” This system ID is clearly displayed in the License Information displayed the first time the application is started. You can alternatively get to this window by selecting the Help->License menu option.
Method 1: Fixed License
With a fixed license, each machine must have its own copy of the licensed program installed. If your license terms permit more than one copy, then the license must be activated on each machine that will be used.
Method 2: Floating License
This method of licensing your program is used if you intend the program application to be used by more than one user concurrently over a network. A floating license tracks the number of copies “checked out.” When that number exceeds your license terms, a message is provided informing the user “all copies are checked out.” The licensed program may be installed on a machine that each client machine can access. Machines that are not connected to the network must be issued a fixed license (Method 1 above).
A floating license is particularly useful when the number of potential users exceeds the number of seats specified in your license terms.
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).
All Salford apps are very CPU intensive, so more memory and a faster CPU are always helpful.
LICENSING APPLICATION
The Salford Predictive Modeler uses a system of application system ID and associated unlock key. When installation is complete, the user will need to email the application “system ID.” This system ID is clearly displayed in the License Information displayed the first time the application is started. You can alternatively get to this window by selecting the Help->License menu option.
Method 1: Fixed License
With a fixed license, each machine must have its own copy of the licensed program installed. If your license terms permit more than one copy, then the license must be activated on each machine that will be used.
Method 2: Floating License
This method of licensing your program is used if you intend the program application to be used by more than one user concurrently over a network. A floating license tracks the number of copies “checked out.” When that number exceeds your license terms, a message is provided informing the user “all copies are checked out.” The licensed program may be installed on a machine that each client machine can access. Machines that are not connected to the network must be issued a fixed license (Method 1 above).
A floating license is particularly useful when the number of potential users exceeds the number of seats specified in your license terms.
© Copyright 2024 Salford-Systems Inc.
Software per data mining, che combina un’interfaccia utente facile da usare a potenzialità avanzate per scoprire automaticamente relazioni nascoste all’interno di banche dati complesse e migliorare l’accuratezza delle previsioni.