Source: http://www.google.com/patents/US20030061228?dq=%22Meaning-based+advertising+and+document+relevance+determination%22
Timestamp: 2016-09-01 05:40:11
Document Index: 607566108

Matched Legal Cases: ['art 120', 'art 120', 'art 130', 'art 130', 'art 60', 'art 60', 'art 90']

Patent US20030061228 - Parallel object-oriented decision tree system - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inPatentsA data mining decision tree system that uncovers patterns, associations, anomalies, and other statistically significant structures in data by reading and displaying data files, extracting relevant features for each of the objects, and using a method of recognizing patterns among the objects based upon...http://www.google.com/patents/US20030061228?utm_source=gb-gplus-sharePatent US20030061228 - Parallel object-oriented decision tree systemAdvanced Patent SearchTry the new Google Patents, with machine-classified Google Scholar results, and Japanese and South Korean patents.Publication numberUS20030061228 A1Publication typeApplicationApplication numberUS 09/877,570Publication dateMar 27, 2003Filing dateJun 8, 2001Priority dateJun 8, 2001Also published asUS7007035, US20050267911Publication number09877570, 877570, US 2003/0061228 A1, US 2003/061228 A1, US 20030061228 A1, US 20030061228A1, US 2003061228 A1, US 2003061228A1, US-A1-20030061228, US-A1-2003061228, US2003/0061228A1, US2003/061228A1, US20030061228 A1, US20030061228A1, US2003061228 A1, US2003061228A1InventorsChandrika Kamath, Erick Cantu-PazOriginal AssigneeThe Regents Of The University Of CaliforniaExport CitationBiBTeX, EndNote, RefManPatent Citations (8), Referenced by (12), Classifications (10), Legal Events (5) External Links: USPTO, USPTO Assignment, EspacenetParallel object-oriented decision tree system
US 20030061228 A1Abstract
A data mining decision tree system that uncovers patterns, associations, anomalies, and other statistically significant structures in data by reading and displaying data files, extracting relevant features for each of the objects, and using a method of recognizing patterns among the objects based upon object features through a decision tree that reads the data, sorts the data if necessary, determines the best manner to split the data into subsets according to some criterion, and splits the data. Images(6) Claims(36)
CROSS REFERENCE TO RELATED APPLICATIONS [0001] Related subject matter is disclosed and claimed in the following commonly owned, copending, U.S. patent applications, “PARALLEL OBJECT-ORIENTED DATA MINING SYSTEM,” by Chandrika Kamath and Erick Cantu-Paz, patent application number 09/xxxxxx, filed xxxxxxx, 2001, and, “PARALLEL OBJECT-ORIENTED, DENOISING SYSTEM USING WAVELET MULTIRESOLUTION ANALYSIS,” by Chandrika Kamath, Chuck H. Baldwin, Imola K. Fodor, and Nu A. Tang, patent application number 09/xxxxxx, filed xxxxxxx, 2001, which are hereby incorporated by reference in their entirety.
BACKGROUND OF THE INVENTION [0003] 1. Field of Endeavor [0004] The present invention relates to decision trees and more particularly to a parallel object-oriented decision tree system. [0005] 2. State of Technology [0006] U.S. Pat. No. 5,787,425 for an object-oriented data mining framework mechanism by Joseph Phillip Bigus, patented Jul. 28 1998 provides the following description, “The development of the EDVAC computer system of 1948 is often cited as the beginning of the computer era. Since that time, computer systems have evolved into extremely sophisticated devices, capable of storing and processing vast amounts of data. As the amount of data stored on computer systems has increased, the ability to interpret and understand the information implicit in that data has diminished. In the past, data was stored in flat files, then hierarchical and network data based systems, and now in relational or object oriented databases. The primary method for analyzing that data has been to form well structured queries, for example using SQL (Structured Query Language), and then to perform simple aggregations or hypothesis testing against that data. Recently, a new technique called data mining has been developed, which allows a user to search large databases and to discover hidden patterns in that data. Data mining is thus the efficient discovery of valuable, non-obvious information from a large collection of data and centers on the automated discovery of new facts and underlying relationships in the data. The term “data mining” comes from the idea that the raw material is the business data, and the data mining algorithm is the excavator, shifting through the vast quantities of raw data looking for the valuable nuggets of business information. Because data can be stored in such a wide variety of formats and because the data values can have such a wide variety of meanings, data mining applications have in the past been written to perform specific data mining operations, and there has been little or no reuse of code between application programs. Thus, each data mining application is written from scratch, making the development process long and expensive. Although the nuggets of business information that a data mining application discovers can be quite valuable, they are of little use if they are expensive and untimely discovered. Returning to the mining analogy, even if gold is selling for $900 per ounce, nobody is interested in operating a gold mine if it takes two years and $901 per ounce to get it out of the ground.”
[0007] The paper “Using Evolutionary Algorithms to Induce Oblique Decision Trees,” by Erick Cantu-Paz and Chandrika Kamath, presented at the Genetic and Evolutionary Computation Conference, Las Vegas, Nev., Jul. 8-12, 2000 indicates that decision trees (DTs) are popular classification methods, and there are numerous algorithms to induce a tree classifier from a given set of data. Most of the tree inducing algorithms create tests at each node that involve a single attribute of the data. These tests are equivalent to hyperplanes that are parallel to one of the axes in the attribute space, and therefore the resulting trees are called axis-parallel. These simple univariate tests are convenient because a domain expert can interpret them easily, but they may result in complicated and inaccurate trees if the data is more suitably partitioned by hyperplanes that are not axis-parallel. Oblique decision trees use multivariate tests that are not necessarily parallel to an axis, and in some domains may result in much smaller and accurate trees. However, these trees are not as popular as the axis-parallel trees because the tests are harder to interpret, and the problem of finding oblique hyperplanes is more difficult than finding axis-parallel partitions, requiring greater computational effort. The paper “Using Evolutionary Algorithms to Induce Oblique Decision Trees,” by Erick Cantu-Paz and Chandrika Kamath, presented at the Genetic and Evolutionary Computation Conference, Las Vegas, Nev., Jul. 8-12, 2000 is incorporated herein by this reference. SUMMARY OF THE INVENTION [0008] The present invention provides a data mining decision tree system that uncovers patterns, associations, anomalies, and other statistically significant structures in data by recognizing patterns among objects in the data based upon features of the data. The decision tree process includes reading the data, determining the best manner to split the data into subsets according to some criterion, and splitting the data. The decision tree system is part of the parallel object-oriented pattern recognition module, which in turn is part of an object oriented data mining system. The decision tree system includes an object oriented module to read the data, an object oriented module to sort the data if sorting is necessary, an object oriented module to determine the best manner to split the data into subsets according to some criterion, and an object oriented module to split the data. As part of the pattern recognition module, the decision tree system interacts with the other modules of the object oriented data mining system. These include an object oriented feature extraction module to extract features from the objects in the data, a storage module to store the features, and an object oriented module for linking the modules of the data mining system. [0009] The present invention has an enormous number of uses. It provides a decision tree system for scientific, engineering, business and other data. The system has applications which include, but are not limited to the following: astrophysics, detecting credit card fraud, assuring the safety and reliability of the nation's nuclear weapons, nonproliferation and arms control, climate modeling, the human genome effort, computer network intrusions, reveal consumer buying patterns, recognize faces, recognize eyes, recognize fingerprints, analyze optical characters, analyze the makeup of the universe, analyze atomic interactions, web mining, text mining, multi-media mining, and analyzing data gathered from simulations, experiments, or observations. [0010] Embodiments of the present invention provide scientific researchers with tools for use in plowing through enormous data sets to turn up information that will help them better understand the world around us and assist them in performing a variety of scientific endeavors. Other embodiments of the present invention provide academic and business users with tools for use in plowing through enormous data sets to turn up information that will help them perform a variety of endeavors. The invention is susceptible to modifications and alternative forms. Specific embodiments are shown by way of example. It is to be understood that the invention is not limited to the particular forms disclosed. The invention covers all modifications, equivalents, and alternatives falling within the spirit and scope of the invention as defined by the claims.
BRIEF DESCRIPTION OF THE DRAWINGS [0011] The accompanying drawings, which are incorporated into and constitute a part of the specification, illustrate specific embodiments of the invention and, together with the general description of the invention given above, and the detailed description of the specific embodiments, serve to explain the principles of the invention. [0012] [0012]FIG. 1 is a flow chart illustrating decision tree modules used in one embodiment of the present invention. [0013] [0013]FIG. 2 is a flow chart illustrating a decision tree method used in one embodiment of the present invention. [0014] [0014]FIG. 3 is the UML Class Diagram for decision trees. [0015] [0015]FIG. 4 is a flow chart illustrating that the data mining process is iterative and interactive. [0016] [0016]FIG. 5 is a flow chart showing basic modules of a data mining system that incorporates an embodiment of the present invention. [0017] [0017]FIG. 6 is a flow chart showing basic steps of modules of a data mining system that incorporates an embodiment of the present invention.
DETAILED DESCRIPTION OF THE INVENTION [0018] Referring now to the drawings, to the following description, and to incorporated information; a detailed description including specific embodiments of the invention are described. The detailed description of the specific embodiments, together with the general description of the invention, serve to explain the principles of the invention. [0019] DATA MINING—Data mining is a process concerned with uncovering patterns, associations, anomalies, and statistically significant structures and events in data. It cannot only help us in knowledge discovery, that is, the identification of new phenomena, but it is also useful in enhancing our understanding of known phenomena. One of the key steps in data mining is pattern recognition, namely, the discovery and characterization of patterns in image and other high-dimensional data. A pattern is defined as an arrangement or an ordering in which some organization of underlying structure can be said to exist. Patterns in data are identified using measurable features or attributes that have been extracted from the data. [0020] The present invention provides a decision tree system for data mining large, complex data sets. The system can be used to uncover patterns, anomalies and other statistically significant structures in data. The system has an enormous number of uses. It has applications which include, but are not limited to, astrophysics, detecting credit card fraud, assuring the safety and reliability of the nation's nuclear weapons, nonproliferation and arms control, climate modeling, the human genome effort, computer network intrusions, reveal consumer buying patterns, recognize faces, recognize eyes, recognize fingerprints, analyze optical characters, analyze the makeup of the universe, analyze atomic interactions, web mining, text mining, multi-media mining, and analyzing data gathered from simulations, experiments, or observations. Other examples of use of data mining for scientific data include the following: [0021] Astronomy: [0022] separating stars from galaxies [0023] clustering galaxies according to their shape (uses a similar approach, but with clustering algorithms instead of classification algorithms) [0024] detecting volcanoes on Venus [0025] Biology: [0026] human genome [0027] analyzing mammograms to detect cancerous tumors [0028] analyzing MRI/PET/SPECT data to identify growth/shrinkage of tumor (this would require data fusion, a key step in which is image registration. So, you would “register” the before and after images to see the changes in the tumor.) [0029] Chemistry: [0030] analyzing the data from the results of combinatorial chemistry experiments to identify any patterns in the data. [0031] Remote sensing: [0032] identifying land use [0033] exploration for minerals, oil etc. [0034] The present invention also has use in mining business data. Examples of use of data mining for business data include the following: [0035] detecting credit card fraud [0036] market-basket analysis: identifying what items people buy together [0037] customer retention: identifying which customer is likely to leave a service (e.g. change telephone providers). [0038] The present invention has use in mining engineering data. Examples of use of data mining for engineering data include: [0039] network intrusion detection [0040] identifying damage in structures such as bridges, airplanes, or buildings [0041] identifying coherent structures in turbulent flow [0042] optimization of engineering design [0043] The present invention has use in other areas. Examples of use of data mining for “other” data include: [0044] fingerprint recognition [0045] face/retinal identification [0046] computer vision [0047] military applications [0048] The present invention is useful in an object-oriented system using tightly-coupled processors. One aspect is to focus on distributed memory architectures where each compute node has its own memory, and the nodes share only the interconnection. The architecture of such systems is scalable with increasing number of processors, making them well suited to mining massive data sets. Another aspect of the system is that each node of a distributed memory system is a symmetric multi-processor (SMP), that is, the system is a cluster of SMPs. [0049] Parallel Decision Tree Software—Decision trees belong to the category of classification algorithms wherein the algorithm learns a function that maps a data item into one of several pre-defined classes. These algorithms typically have two phases. In the training phase, the algorithm is “trained” by presenting it with a set of examples with known classification. In the validation phase, the model created in the training phase is tested to determine how well it classifies known examples. If the results meet expected accuracy, the model is put into operation to classify examples with unknown classification. This operation is embarrassingly parallel as several “copies” of the classifier can operate on different examples. It is important for the training phase of the classifier to be efficient as Applicants need to find an optimum set of parameters, which will enable accurate and efficient results during the operation of the classifier. [0050] A decision tree is a structure that is either a leaf, indicating a class, or a decision node that specifies some test to be carried out on a feature (or a combination of features), with a branch and sub-tree for each possible outcome of the test. The decision at each node of the tree is made to reveal the structure in the data. Decision trees tend to be relatively simple to implement, yield results that can be interpreted, and have built-in dimension reduction. Parallel implementations of decision trees have been the subject of extensive research in the last few years. [0051] [0051]FIG. 1 is a flow chart 120 illustrating decision tree modules used in one embodiment of the present invention. The following modules are included in flow chart 120: module 121 to read data, module 122 to sort the data, module 123 to identify best split, and module 124 to split the data. [0052] The first module reads the data from a file to main memory into separate feature lists for each feature. Each list contains the identification (ID) number of the data instance, the feature value, and the class associated with the instance. This module uniformly partitions the data among the processors. Once the data is read to memory, the sorting module decides whether to sort each numeric feature of the data depending on the options used in the next module that selects the best way to split data. If sorting is necessary, the sorting module performs a parallel sort on each feature list, which results in each processor containing a static, contiguous, sorted portion of the feature. Since all the features corresponding to one data instance may not belong to the same processor, it is important to include the ID number of the data instance in the feature list. The module that selects the best split of the data proposes splits, evaluates the splits using a splitting evaluation criterion, and chooses the best split according to the evaluation criterion. The module that splits the data uses the best split found by the previous module to split the data. The modules of finding the best split and splitting the data are repeated on any unsolved nodes. [0053] [0053]FIG. 2 is a flow chart 130 illustrating steps used in a decision tree of one embodiment of the present invention. The following steps are included in flow chart 130: step 131 read the data, step 132 sort the data, step 133 identify the best split, and step 134 split the data. [0054] The first step is to read the data from a file to main memory into separate feature lists for each feature. Each list contains the identification (ID) number of the data instance, the feature value, and the class associated with the instance. This data is partitioned uniformly among the processors. Once the data is read to memory, the sorting step decides whether to sort each numeric feature of the data depending on the options used in the next step that selects the best way to split data. If sorting is necessary, a parallel sort is performed on each feature list, which results in each processor containing a static, contiguous, sorted portion of the feature. Since all the features corresponding to one data instance may not belong to the same processor, it is important to include the ID number of the data instance in the feature list. The step that selects the best split of the data proposes splits, evaluates the splits using a splitting evaluation criterion, and chooses the best split according to the evaluation criterion. The step that splits the data uses the best split found in the previous step to split the data. The steps of finding the best split and splitting the data are repeated to any unsolved nodes. [0055] An approach used to construct a scalable decision tree was first described in the SPRINT algorithm. Instead of sorting the features at each node of the tree as was done in earlier implementations, it uses a single sort on all the features at the beginning. [0056] An improved version of the SPRINT algorithm that is scalable in both run-time and memory requirements is described in ScalParC. This differs from SPRINT in two ways. First, a distributed hash table is used, instead of a single hash table, which is replicated in each processor. This reduces memory requirements per processor, making the algorithm scalable with respect to memory. Second, as in SPRINT, the decision tree nodes are constructed breadth-first rather than depth-first and processor synchronization is held off until all work is done for that level of the tree. This not only limits the communication necessary for synchronization, but also results in better load balancing since processors that finish with one node of the tree can move directly on to the next node. [0057] Applicants' goal in the design and implementation of the systems decision tree software is to take the ScalParC approach and extend it to include the following: [0058] 1) Support for several different splitting criteria: The feature to test at each node of the tree, as well as the value against which to test it, can be determined using one of several measures. Depending on whether the measure evaluates the goodness or badness of a split, it can be either maximized or minimized. Let T be the set of n examples at a node that belong to one of k classes, and TL and TR be the two non-overlapping subsets that result from the split (that is, the left and right subsets). Let Lj and Rj be the number of instances of class j on the left and the right, respectively. Then, the split criteria Applicants want to support include: [0059] Gini: This criterion is based on finding the split that most reduces the node impurity, where the impurity is defined as follows: L Gini = 1.0 - ∑ i = 1 k  ( L i /  T L  ) 2 , R Gini = 1.0 - ∑ i = 1 k  ( R i /  T R   ) 2 Impurity=(|T L |*L Gini +|T R |*R Gini)/n [0060] where |TL| and |TR| are the number of examples, and LGini and RGini are the Gini indices on the left and right side of the split, respectively. This criterion can have problems when there are a large number of classes. [0061] Twoing rule: In this case, a “goodness” measure is evaluated as follows: Twoing   value = (  T L  / n ) * (  T R  / n ) * ( ∑ i = 1 k   L i /   T L   - R i /  T R  ) 2 [0062] Information Gain: The information gain associated with a feature is the expected reduction in entropy caused by partitioning the examples according to the feature. Here the entropy characterizes the (im)purity of an arbitrary collection of examples. For example, the entropy prior to the split in our example would be: Entropy  ( T ) = ∑ i = 1 k  - p i  log 2  p i , p i = ( L i + R i ) / n [0063] where pi is the proportion of T belonging to class i and (Li+Ri) is the number of examples in class i in T. The information gain of a split S relative to T is then given by Gain  ( T , S ) = Entropy  ( T ) -  T L   T   Entropy  ( T L ) -  T R   T   Entropy  ( T R ) [0064] where TL and TR is the subset of S corresponding to the left and right branches respectively. This criterion tends to favor features with many values over those with few values. [0065] Information Gain Ratio: To overcome the bias in the information gain measure, Quinlan suggested the use of information gain ratio which penalizes features by incorporating a term, called the split information, that is sensitive to how broadly and uniformly the feature splits the data. Split Information (T)=−(|T L |n)log2(|T L |/n)−(|TR |/n)log2 (|T R |/n) [0066] where TL are the subsets resulting from partitioning T on the c-valued feature F. Note that the split information is the entropy of T with respect to the splits S. The Gain ratio is then defined as [0067] Gain Ratio(T)=Gain(T)/Split Information(T) [0068] Max Minority: This criterion is defined as L minority = ∑ i = 1 , i ≠ max   L i k  L i , R minority = ∑ i = 1 , i ≠ max   R i k  R i [0069] Max minority=max (Lminority/Rminority) [0070] This has the theoretical advantage that a tree built by minimizing this measure will have depth at most log n. This is not a significant advantage in practice and trees created by other measures are seldom deeper than the ones produced by Max Minority. [0071] Sum Minority: This criterion minimizes the sum of Lminority and Rminority, which is just the number of misclassified instances. [0072] 2) Support for non-axis-parallel decision trees. [0073] Traditional decision trees consider a single feature at each node, resulting in hyperplanes that are parallel to one of the axes. While such trees are easy to interpret, they may be complicated and inaccurate in the case where the data is best partitioned by an oblique hyperplane. In such instances, it may be appropriate to make a decision based on a linear combination of features, instead of a single feature. If we consider that the instances take the form (x1, x2, . . . , xd, cj), where the xi are real-valued attributes, and the cj is a discrete value that represents the class label of the instance. Applicants consider more general tests of the form ∑ i = 1 d  a i  x i + a d + 1 > 0 , [0074] where the ai are real-valued coefficients. In this case, the task of the tree inducer is much harder than before, because it involves searching in a (d+1)-dimensional space. It has been shown that finding the best oblique tree is NP-complete, and therefore existing oblique DT inducers use some sort of greedy search to find values for the coefficients. [0075] However, these oblique trees can be harder to interpret. Nonetheless, Applicants early research has shown that when used in conjunction with evolutionary algorithms, these oblique classifiers could prove competitive in some cases. To further explore these ideas, Applicants are designing software such that, in addition to axis parallel trees, it can support the following types of splits at each node: [0076] CART-LC: Breiman et al., suggested the use of linear combinations of features to split the data at a node. If the features for a data instance are given as (x1, x2, . . . , xn, c), where c is the class label associated with the instance, then, Applicants search for a best split of the form ∑ i = 1 n  a i  x i ≤ d   where   ∑ i = 1 n  a i 2 = 1 [0077] and d ranges over all possible values. The solution approach cycles through the variables x1, . . . xn, trying to find the best split on each variable, while keeping the others constant. A backward deletion process is then used to remove variables that contribute little to the effectiveness of the split. This approach is fully deterministic and can get trapped in a local minimum. [0078] OC1: The oblique classifier OC1 attempts to address some of the limitations of the CART-LC approach by including randomization in the algorithm that finds the best hyperplane. Further, multiple random re-starts are used to escape local minima. In order to be at least as powerful as the axis-parallel decision trees, OC1 first finds the best axis-parallel split at a node before looking for an oblique split. The axis-parallel split is used if it is better than the best oblique split determined by the algorithm for that node. [0079] OC1 shifts to an axis-parallel split when the number of examples at a node falls below a user-specified threshold to ensure that the data does not underfit the concept to be learned. [0080] OC1 uses an ad-hoc combination of hillclimbing and randomization. As in CART-LC, the hillclimber finds locally optimal values for one coefficient at a time, although OC1 offers several variants to choose the order in which the coefficients are optimized. The randomization component takes two forms: OC1 uses multiple random restarts, and when hillclimbing reaches a local minimum the hyperplane is perturbed in a random direction. Murthy et al. present OC1 as an extension of CART with linear combinations that overcomes some of its limitations. In particular, they claim that CART's deterministic nature may cause it to get trapped in local minima, and that using randomization may improve the quality of the DTs. In addition, OC1 produces multiple trees using the same data, and unlike CART, the time used at each node in the tree is bounded. They present experimental results that suggest that OC1 outperforms CART in several domains. [0081] Heath used simulated annealing to perturb the hyperplane's coefficients. Simulated annealing is a more sophisticated optimizer than those used in CART and OC1, and in some domains it can produce small and highly accurate trees. However, simulated annealing converges very slowly, and the DT inducer has to examine a large number of hyperplanes, making it inadequate for large data sets. [0082] Oblique-EA: In this approach, Applicants use evolutionary algorithms to find the best hyperplane represented by the coefficients (a1, . . . , an, d). An individual in the population is represented by the concatenated version of these coefficients. The fitness of each individual is determined by evaluating how well it splits the examples at a node for a given split criterion. Evolutionary algorithms thus allow us to work with all the coefficients at a time instead of considering one variable at a time as in in OC1 and CART-LC. [0083] Evolutionary algorithms are a promising alternative to existing oblique tree algorithms for several reasons: [0084] More sophisticated optimizers—EAs are not limited to considering one coefficient at a time (unlike CART and OC1), and it is likely that EAs find better splits than the simple greedy hillclimbers that are currently in use. [0085] No need for optimal splits—Finding the best split at each node does not guarantee that the best tree will be found. Therefore, there is no need to run the EAs (or any other optimizer, for that matter) until they find the best solution that they can. It is well known that EAs quickly improve on the initial solutions, and so Applicants may use the best hyperplanes found after just a few iterations. [0086] Scalability to high dimensional spaces—The dimension of the search space is defined by the number of attributes that describe each instance. In practice this can be a large number, and the execution time of some existing DT algorithms may not scale up well. In contrast, EAs have been shown to have good scalability properties. [0087] Use of problem-specific knowledge—There are numerous opportunities to incorporate knowledge about the DT inducing problem into the EAs. For instance, real-valued encodings and operators seem natural to represent hyperplanes. The positive experiences with existing DT inducers suggest that new hyperplanes that are only slight variations of the originals may work well. This can be accomplished by restricting recombination between similar hyperplanes or by using small mutation steps, for example. In addition, the execution time may be reduced using known ‘good’ solutions to seed the initial population. [0088] Hybridization—Most DT algorithms use a local optimizer that is well tuned to the tree induction task, and interfacing it to the EA could boost performance significantly. [0089] Tolerance to noise—More efficient EA-based DT inducers may be obtained by approximating the fitness of a hyperplane by using a small random sample of instances to evaluate the split. This approximation would assign different fitness values to the same hyperplane every time that it is evaluated, but EAs are tolerant to such noisy fitness evaluations. [0090] Parallel implementations—It is straightforward to implement EAs on parallel computers, and the expected performance improvements are very promising. [0091] Applicants use knowledge about the problem in their choice of encoding and operators and to seed the initial population. The EAs were run for a fixed number of iterations that, in many cases, were not enough for the EA to converge to a unique solution or to find the best hyperplane that it could, but that were sufficient to reach acceptable solutions. In addition, Applicants performed experiments to explore the scalability of EAs and their sensitivity to sampling. [0092] Applicants have explored two options for evolutionary algorithms, although other options are possible. In one case Applicants use a (1+1) evolution strategy with self-adaptive mutations. Applicants call this OC1-ES. The candidate hyperplane is represented as a vector of real-valued coefficients, a1, . . . , ad+1. The initial hyperplane is the best axis-parallel split found by OC1. For each hyperplane coefficient there is a corresponding mutation coefficient a1. . . , a3+1, which are initially set to 1. At each iteration, t, the mutation coefficients are updated and a new hyperplane is obtained according to the following rule: v = N  ( 0 , 1 ) σ i t + 1 = σ i t  exp  ( τ ′  v  + τ   N  ( 0 , 1 ) ) a i t + 1 = a i t + σ  i τ + 1  N  ( 0 , 1 ) [0093] where N(0,1) indicates a realization of a unit normal variate, τ=({square root}{square root over (2)}{square root}{square root over (d)})−1, and τ′=({square root}{square root over (2d)}−1). The ES was stopped after 1000 iterations. The second extension of OC1 with an EA uses a simple generational GA with real-valued genes, and is called OC1-GA. For the experiments, the GA used pairwise tournament selection without replacement, uniform crossover with probability 1.0, and no mutation. The population size was set to 20{square root}{square root over (d)}, along the lines of a population-sizing theory that proposes that the population size required to reach a solution of a particular quality is O({square root}{square root over (d)}). The best axis-parallel hyperplane was copied to 10% of the initial population, and the remainder of the population was initialized randomly with coefficients a1 in [−200,200]. The GA was stopped after 25 generations. The user of the system can change the parameters and constants described above. [0094] Applicants initial experiments have shown that in some cases, the Oblique-EA approaches are faster and more accurate than OC1. [0095] 3) Support for Both Numeric and Nominal Features. [0096] 4) Support for Different Pruning Options and Stopping Criteria. Applicants are interested in exploring different ways to avoid over-fitting through pruning and rules that decide when to stop splitting, such as the cost complexity pruning technique of Breiman or the minimum description length approach suggested by Quinlan and Rivest. [0097] The Sapphire Decision Tree Design—Applicants are interested in a decision tree design that provides enough flexibility to experiment with different options within a parallel implementation. It is relatively easy to support some of these options within the context of an object-oriented design. For example, different splitting criteria can be supported easily by having an abstract base class from which concrete classes for the split criterion are inherited. These concrete classes implement the function used to determine the quality of a split. The user can then instantiate an object in one of these classes to indicate the split criterion used at all nodes of the tree. This choice would be communicated to the decision tree object by passing a pointer to the base split criteria class as an argument. A similar situation holds in the case of pruning options, which are executed after the tree is built. In both cases, the main operation performed by the class is at a low-enough level that no parallelism is required in the implementation of the operation. [0098] [0098]FIG. 3 is the UML Class Diagram for decision trees. [0099] The prefix di_ is used to indicate classes that contain domain information, and dt_ to indicate classes used in the decision tree. Note that the di_ classes can be used in other classification and clustering algorithms, not just decision trees. A brief description of the classes is as follows: [0100] di_FeatureValue: This contains either a nominal (discrete) feature or a numeric (continuous) feature, but never both at the same time. [0101] di_InstanceInfo: This contains the number of features, the name of the features and their type (numeric or nominal) for a data instance. [0102] di_Instance: This contains the features for a data instance. It can contain an arbitrary number of objects of class di_FeatureValue. It is typically used in conjunction with di_InstanceInfo. [0103] di_InstanceArray: This can be used for the training set, where each data instance has several features or for the feature lists that contain only a single feature and are created in the first part of the parallel decision tree. An object of class di_InstanceArray can contain an arbitrary number of objects of class di_Instance. [0104] dt_SplittingCriterion: This abstract base class represents the criterion to be used to evaluate the split at each node. The derived classes denote the value that is returned after an evaluation of a split. As Applicants find new ways of judging a split, a new class can be derived from the base class to implement that split criterion. In the current embodiment, the same split criterion is used in the entire decision tree. [0105] dt_SplitFinder: This base class represents the approach used to find the split—whether axis-parallel, oblique, CART-LC, etc. Derived classes implement the actual determination of the split. The SplitFinder used at any node of the tree may vary depending on several factors. For example, if the instances at a node are few, an axis parallel approach may be chosen instead of an oblique one. Or, evaluation of an oblique split may indicate that an axis-parallel split is a better choice for the data at a node. Regardless of the choice of SplitFinder, the user can independently select the split criterion used to evaluate the split. It is possible to exploit parallelism within the SplitFinder class. [0106] dt_TreeNode: This class contains the information on a node of the tree. It includes pointers to the InstanceArrays stored using a single feature at a time, the left- and right-hand sides of the split made at the node, the type of SplitFinder, the count statistics for each feature, and pointers to the children dt_TreeNodes created by the split. Once the split is determined using the SplitFinder, the TreeNode object is responsible for actually splitting the instances among the children node. Parallelism can be exploited within this class. [0107] dt_DecisionTree: This is the main class that creates, tests, and applies the tree. It can also print out the tree, save it to a file, and read it back from a file. Starting with a root TreeNode that contains the entire training set, it creates the child nodes by choosing the appropriate SplitFinder, using the SplitCriterion set by the user. The single sort that is required by the parallel implementation is done at the beginning of the training of the decision tree. Parallelism is exploited within this class. [0108] One of the challenges Applicants face in supporting several different options in parallel decision tree software is that the approach taken for efficient implementation of one option could directly conflict with the efficient implementation of another option. An interesting case of this arises in the SplitFinder class. The ScalParC approach, which generates axis-parallel trees, sorts each feature at the beginning of the creation of the tree. As mentioned earlier, the sort spreads the features that comprise a single data instance across more than one processor. However, for oblique classifiers, in order to evaluate a split, all features in a data instance are needed. If these features were spread across processors, communication would be required. This communication could very likely have an irregular pattern and, depending on how the features corresponding to a data instance are spread out among the processors, could be extensive. This would suggest that to support oblique splits, Applicants should not sort each of the features prior to the creation of the decision tree. However, regardless of the technique used to calculate an oblique split, Applicants still need to evaluate axis-parallel splits. For example, an oblique split starts with an axis parallel split, is compared with an axis parallel split in order to select the better of the two, and determines an axis-parallel split for each coefficient at a time, keeping the others constant. [0109] This gives rise to an interesting dilemma—should Applicants sort each feature at the beginning or not? It is always possible to have two sets of features, one sorted and the other unsorted, even though it would almost double the memory requirements. The other option is to work with only one set of features, but should Applicants picked the sorted or the un-sorted one? Since sorting would result in extensive communication in the case of oblique splits, a possible solution approach would be to see if Applicants could somehow mimic the axis-parallel split efficiently on un-sorted data. [0110] To determine the best axis parallel split, Applicants first sort the values for a feature, and then determine the value of a split if the split point was taken mid-way between two consecutive feature values. The best split across all features is chosen as the best split at a node. Instead of this approach, Applicants generate a histogram for each of the features, Applicants can select as a split value the boundary value of each bin in the histogram. If the histogram kept track of the count statistics for each class in a bin, Applicants could use this information to select the best split based on any splitting criterion. If the bin widths are chosen appropriately, this could give a good approximation to the axis-parallel split. [0111] A different issue Applicants need to address in the parallelization of decision trees is the implementation on clusters of SMPs, where Applicants may need to use both distributed and shared memory programming. This could be most beneficial in the case where Applicants use genetic algorithms to search for the best oblique hyperplane, as genetic algorithms tend to be expensive to implement. This would give rise to some interesting solution approaches. Suppose the data instances with unsorted features are distributed uniformly across the nodes of a parallel system. Then the SMP processors within each node could work on finding the best oblique hyperplane for its set of data instances, while occasionally exchanging members with other nodes in order to find a hyperplane that best splits the entire set of data instances. [0112] The results of our tests show that the EA-augmented inducers can quickly find competitive classifiers, and that they scale up better than traditional oblique DT inducers to the size of the training sets and to the number of attributes that describe each instance. A brief background on oblique decision trees is included and a brief review of relevant previous work describes some of the advantages of using EAs to find splits in oblique DTs, and describes Applicants approach to this problem. Tests have provided results that illustrate the advantages of the evolutionary approach using public domain and artificial data sets. [0113] EXPERIMENTS—To demonstrate the feasibility of using EAs to search for oblique partitions, Applicants conducted three sets of experiments. In the first set, Applicants used the same four public-domain data sets from the UCI repository used to evaluate OC1. Next, applicants used artificial data with known properties, and Applicants performed experiments to study the scalability of the different algorithms to the dimensionality of the domain. Finally, Applicants present experiments with a larger database to illustrate how sampling may help to scale up the evolutionary approach to more realistic situations. [0114] The experiments compare the performance of three baseline DT inducers against two inducers that use EAs. The first baseline DT system is OC1 with its default parameters; the second is OC1 limited to axis-parallel partitions, which Applicants call OC1-AP; and the third is implementation of CART-LC, which Applicants call OC1-CART. [0115] The execution times were measured on a 500 MHz Pentium III PC with 128 Mb of RAM running NT 4.0. The programs were compiled with the ecgs compiler version 2.91 using −O optimizations. [0116] All experiments measure the impurity of a split at each tree node using the twoing rule, which is the default in OC1. TABLE 1 Descriptions of the small public domain data sets used in the experiments. Name Task Description Attributes No. of Instances Cancer Diagnose a tumor as benign or malignant 9 683 Diabetes Detect presence of diabetes 8 768 Housing Predict housing values in suburbs of Boston 12 506 Iris Classify type of iris 4 150 [0117] [0117] TABLE 2 Comparison of different algorithms on the small public domain data sets Algo- rithm Parameter Cancer Diabetes Housing Iris OC1 Accuracy 96.2 (1.0) 74.1 (2.0) 82.8 (2.0) 95.5 (1.8) Leaves 3.3 (1.1) 5.7 (2.1) 7.3 (2.6) 3.5 (0.2) Time 28.4 (8.7) 33.0 (1.4) 19.8 (1.3) 1.2 (0.1) OC1- Accuracy 94.7 (0.7) 74.0 (1.0) 82.2 (1.0) 92.8 (2.6) AP Leaves 9.4 (2.6) 18.9 (8.7) 10.0 (6.6) 5.2 (1.4) Time 0.2 (0.0) 0.4 (0.0) 0.3 (0.0) 0.1 (0.0) OC1- Accuracy 95.9 (0.5) 72.7 (1.8) 82.3 (1.5) 94.2 (1.8) CART Leaves 5.5 (2.5) 13.7 (7.8) 11.5 (2.8) 4.2 (0.7) Time 1.2 (0.2) 2.7 (0.1) 2.1 (0.1) 0.1 (0.1) OC1-ES Accuracy 95.2 (0.9) 73.7 (1.4) 82.8 (1.2) 96.3 (1.5) Leaves 5.2 (2.2) 17.1 (5.0) 11.5 (5.7) 3.5 (0.4) Time 5.1 (0.4) 14.0 (0.3) 8.6 (0.3) 0.9 (.1) OC1- Accuracy 94.3 (0.5) 73.9 (1.3) 82.4 (1.1) 93.6 (1.3) GA Leaves 9.6 (2.1) 19.0 (11.6) 12.5 (5.2) 4.3 (1.4) Time 7.7 (0.4) 13.0 (0.3) 8.5 (0.4) 0.37 (0.04) [0118] SMALL DATA SETS—The first round of experiments use small public domain data sets, which are available at UCI's machine learning repository. These are briefly described in Table 1, and have been used in numerous studies of machine learning and data mining algorithms. For comparison Applicants followed the experimental procedure used to compare OC1 to other DT inducers: Applicants use the standard parameters of OC1, and the results presented (in Table 2) are the average of ten five-fold cross-validation experiments (50 trees total). Applicants report the percentage of instances classified correctly, the size of the tree measured by the number of leaves, and the execution time of the program measured in seconds, along with their standard deviations (in parenthesis). [0119] From the table it is clear that for a given dataset the differences in the accuracy of the algorithms is very small. There are statistically significant differences (at least at the 0.05 confidence level) on the cancer and iris data, but the magnitude of the differences is still small. For the four data sets, OC1 found the smallest trees, but in three cases (cancer, housing, and iris) OC1-ES and OC1-CART found trees comparable to OC1. The average size of the trees found by the GA-augmented inducer was close to the axis-parallel algorithm. The largest differences are in execution times; the EAs being on average approximately 3 times faster than OC1, but much slower than OC1-AP and OC1-CART. [0120] ARTIFICIAL DATA—The next set of experiments used three artificial data sets. The purpose of these experiments is to ensure that the concept to be learned matches the bias of the algorithms—the classes are separable by oblique hyperplanes. In addition, Applicants performed experiments to explore the scalability of the algorithms as the number of attributes varies. The three data sets were also used in evaluation of OC1, but Applicants used them to study different properties of the algorithms. [0121] The first artificial data set has 2000 instances divided into two classes. Each instance has d attributes whose values are uniformly distributed in [0,1]. The data is separable by the hyperplane x1+. . . +d/2<xd/2+1+. . . +xd, where d ε {10,20,50}. These data sets are labeled LS10, LS20, and LS50 according to their dimensionality. [0122] Applicants followed the same experimental procedure as in the previous experiments, and the results are summarized in Table 3. In this case, OC1-AP consistently found the least accurate and largest trees. Of course, it was the fastest algorithm, but its accuracy is too low to consider AP trees competitive (consider that random guessing would result in a 50% accuracy and the accuracy of OC1-AP on LS50 is 58%). OC1 produces the most accurate trees for LS10, but as the number of dimensions increases its performance seems to drop below the EA-augmented inducers. OC1-CART does a little worse. OC1-GA maintains the highest accuracy, but its execution time seems to increase faster than OC1-ES. In any case, both of the EA inducers are faster than OC1 (approximately between 2� and 6�), and appear to be more robust to the increase in dimensionality. The size of the trees found by OC1, OC1-CART, and OC1-ES increases with the number of dimensions, but those of OC1-GA seem to remain of a constant size. However, consider that the ideal tree for this domain has two leaves, and all the algorithms find much larger trees. TABLE 3 Comparison of different algorithms on the artificial data sets. Algorithm Parameter LS10 LS20 LS50 POL2 RCB2 OC1 Accuracy 97.1 (0.4) 88.5 (1.1) 72.5 (1.3) 99.6 (0.1) 99.0 (0.1) Leaves 5.3 (2.2) 5.9 (2.7) 10.0 (3.6) 5.0 (0.0) 8.4 (0.3) Time 170.9 (12) 391.5 (16.6) 608.7 (32.8) 36.0 (2.3) 44.8 (1.5) OC1-AP Accuracy 73.0 (1.5) 64.6 (0.8) 58.6 (1.0) 94.2 (0.6) 92.8 (0.4) Leaves 86.7 (16.6) 71.5 (29.0) 58.0 (20.8) 77.7 (10.4) 85.9 (6.8) Time 1.6 (0.0) 3.5 (0.1) 11.7 (0.6) 0.3 (0.0) 0.4 (0.0) OC1-CART Accuracy 96.0 (1.5) 87.3 (1.9) 66.3 (1.0) 97.6 (0.5) 94.4 (0.3) Leaves 5.9 (3.5) 9.3 (3.6) 25.0 (17.7) 14.4 (2.9) 50.6 (7.1) Time 16.8 (1.3) 54.9 (3.6) 113.9 (3.6) 2.7 (0.2) 3.4 (0.1) OC1-ES Accuracy 93.7 (0.8) 87.0 (1.0) 78.5 (1.6) 99.4 (0.3) 98.1 (0.3) Leaves 9.9 (2.8) 14.4 (5.6) 16.3 (9.4) 6.3 (1.2) 10.9 (1.9) Time 29.8 (2.4) 65.1 (3.3) 163.9 (14.9) 4.5 (0.4) 6.0 (0.4) OC1-GA Accuracy 95.4 (0.6) 92.0 (0.7) 85.2 (1.0) 95.3 (0.4) 93.8 (0.7) Leaves 8.8 (3.8) 9.8 (5.9) 9.5 (5.6) 57.5 (10.5) 64.6 (9.7) Time 36.3 (3.8) 101.5 (4.8) 333.3 (22.2) 4.7 (0.3) 5.0 (0.2) [0123] The second and third artificial data sets, POL2 and RCB2, represent concepts that are supposed to be more difficult to learn than the LS problems. POL2 and RCB2 are defined in 2 dimensions (x1, x2 ε [0,1]), and depicted in FIG. 1. The concept represented by the POL2 data is a set of four parallel oblique lines (hence its name), it contains 2000 instances divided into two classes. The “rotated checker board” (RCB2) data also has 2000 instances, but in this case they are divided into eight classes. Applicants used the same experimental setup as before, and the results are in Table 3. [0124] In these two domains, OC1 and OC1-ES produced the most accurate and smallest trees. The smallest trees for POL2 and RCB2 have five and eight leaves, respectively, and OC1 consistently found trees of those sizes. As expected, the AP trees are the largest and least accurate, but OC1-GA found only slightly more accurate and smaller trees. The fastest oblique DT algorithm was OC1-CART, but its accuracy is lower than OC1 and OC1-ES. Both of the EA inducers were approximately eight times faster than OC1, but in these two problems the overall performance of the ES was much better than the GA. [0125] OPTICAL DIGIT RECOGNITION DATA—To study the problem of scalability to larger data sets, Applicants experimented with the optical digit recognition data set, which is also available at UCI's ML repository. This data set has 3823 instances in a training set and 1797 in a testing set; each instance is described by 64 numeric attributes. The objective is to identify the instances as one of 10 digits. [0126] With this domain, Applicants illustrate a more realistic application of EAs to the problem of oblique DT induction. The larger size of the training set could cause fitness evaluations to be prohibitively expensive, and therefore Applicants seek to obtain faster approximate evaluations by sampling the training set. Applicants consider two ways of sampling. The first is a preprocessing step in which the training set is sampled once at the beginning of an experiment. This static sampling ignores all the instances that were not selected originally, possibly wasting valuable information. However, static sampling is valuable because it simulates a situation when not much data is available for training, which is often the case in scientific domains. The second way of sampling is to choose a fraction of the training instances every time that a hyperplane is evaluated. This dynamic sampling method is slightly more expensive than sampling statically once per experiment, but it may be advantageous especially when samples are small, because numerous hyperplanes are evaluated in every tree node and the sampling will eventually consider all the available labeled instances. Evaluating the hyperplanes with dynamic samples also means that every time that a particular hyperplane is evaluated its fitness estimate is different. Repeated evaluations of the same hyperplane would enable us to better estimate its true fitness (e.g., by taking the average of multiple evaluations), and some recent theory could be used to determine the optimal number of repetitive evaluations that would minimize the execution time. As a first cut, however, Applicants decided to use a single evaluation as a crude (but fast) estimate of fitness. TABLE 4 Comparison of different algorithms on the digit recognition data sampling dynamically (5%-100\% of the training set) every time that a hyperplane was evaluated. Algorithm Parameter 5% 10% 25% 50% 100% OC1 Accuracy 37.9 (4.4) 50.2 (2.6) 69.6 (2.0) 81.2 (1.7) 86.4 (0.9) Leaves 72.3 (19.5) 101.8 (22.8) 155.4 (90) 182.1 (83.1) 53.7 (30.6) Time 8.1 (0.3) 16.2 (0.5) 52.1 (2.9) 126.6 (4.0) 298.6 (11.1) OC1-AP Accuracy 71.8 (1.1) 76.9 (2.3) 81.2 (1.6) 83.0 (1.2) 84.5 (1.9) Leaves 32.0 (5.6) 49.0 (6.4) 77.6 (11.5) 112.1 (40.7) 125.8 (48.2) Time 0.7 (0.0) 0.9 (0.0) 1.7 (0.0) 2.9 (0.1) 5.5 (0.2) OC1-CART Accuracy 28.3 (4.4) 36.9 (6.9) 62.3 (4.5) 75.1 (2.7) 88.2 (0.7) Leaves 61 (56.6) 158 (64.3) 179 (116) 163 (96.8) 60.6 (25.8) Time 7.3 (0.6) 11.8 (1.1) 26.7 (3.2) 62.1 (9.0) 77.4 (10.7) OC1-ES Accuracy 71.1 (2.4) 77.5 (2.3) 82.9 (1.9) 84.7 (1.3) 87.9 (1.0) Leaves 19.1 (3.8) 26.6 (7.2) 43.4 (13.0) 84.0 (28.4) 84.0 (37.6) Time 5.8 (0.4) 8.7 (0.6) 17.6 (0.4) 32.7 (1.4) 63.0 (3.2) OC1-GA Accuracy 78.1 (2.0) 82.7 (1.4) 87.2 (0.9) 88.6 (1.1) 90.2 (1.1) Leaves 14.7 (4.2) 20.0 (5.5) 33.0 (9.2) 31.9 (12.0) 52.3 (34.6) Time 8.4 (0.5) 15.2 (0.5) 37.1 (0.9) 75.6 (2.9) 144.2 (4.5) [0127] The results with dynamic sampling are reported in Table 4. In this case, Applicants report the average of 10 experiments, and training and testing used the partition of the instances as in the UCI repository. The algorithms use the same parameters as before. Sampling decreases the execution time as desired, but it also affects the accuracy. For each sample size, the GA finds the smallest and most accurate classifiers, and in most cases it is faster than the original oblique OC1. The ES is the fastest of the oblique classifiers, and its accuracy is better than OC1 and CART, but not as good as the GA. Note, however, that the axis-parallel OC1 is the fastest algorithm, and that its accuracy is similar to OC1-ES. In fact, using OC1-AP with the entire data set is faster and more accurate than the GA on 5% samples, so if the end user does not care about the relatively small differences in accuracy, in this domain axis-parallel DTs would be a good choice. If accuracy or tree size is a premium, then OC1-GA would be the best option. [0128] In separate experiments Applicants found that dynamic sampling gives more accurate results than sampling statically at the beginning of the experiments. For static samples of 25% or more of the training set, the accuracy was only slightly lower than with dynamic sampling (≈4-5%), but for smaller static samples, the accuracy was between 6 to 22% lower. The general trends were the same as with repetitive sampling, so Applicants omit those results. [0129] Traditional DT inducers use some form of heuristic greedy search to find appropriate splits. Applicants substitute the greedy search with two evolutionary algorithms: a (1+1) evolution strategy and a simple GA. Applicants performed experiments on public domain and artificial data sets with different characteristics to evaluate the performance of the EA-based tree inducers. The results suggest that EAs are capable of finding oblique trees with similar accuracy to OC1, and that this can be done at a competitive cost. The experiments also suggest that the EAs scale up better than traditional methods to the dimensionality of the data. [0130] Referring now to FIG. 4, a data mining system incorporating an embodiment of the present invention is illustrated. Data mining starts with the raw data and includes extensive pre-processing as illustrated in FIG. 4. If the raw data is very large, the embodiment of the present invention may use sampling and work with fewer instances, or use multiresolution techniques and work with data at a coarser resolution. This first step may also include data fusion, if required. Next, noise is removed, objects are identified, and relevant features for each object are extracted from the data. At the end of this step, a feature vector is crated for each data instance. Depending on the problem and the data, the number of features may need to be reduced using dimension reduction techniques such as principal component analysis (PCA) or its non-linear versions. After this pre-processing, the data is ready for the detection of patterns. These patterns are then displayed to the user, who validates them appropriately. [0131] As shown in FIG. 4, the data mining process is iterative and interactive; any step may lead to a refinement of the previous steps. User feedback plays a critical role in the success of data mining in all stages, starting from the initial description of the data, the identification of potentially relevant features and the training set (where necessary), and the validation of the results. [0132] The development of the data mining system incorporating an embodiment of the present invention required consideration of the design of the system. In order to implement the data mining process in a parallel setting as illustrated in FIG. 4, some considerable thought was given to the system's design. Applicants' experience has shown that a good design should take into account the following: (1) Not all problems require the entire data mining process, so each of the steps should be modular and capable of stand-alone operation. (2) Not all algorithms are suitable for a problem, so the software should include several algorithms for each task, and allow easy plug and play of these algorithms. (3) Each algorithm typically depends on several parameters, so the software should allow user friendly access to these parameters. (4) Intermediate data should be stored appropriately to support refinement of the data mining process. (5) The domain dependent and independent parts should be clearly identified to allow maximum re-use of software as we move from one application to another. [0133] [0133]FIG. 5 is a flow chart 60 showing the basic modules of a data mining system incorporating an embodiment of the present invention. The individual modules of the flowchart 60 shown in FIG. 5 include the following (It is to be understood that not all of the modules are used in individual embodiments of the invention): parallel object-oriented module 62 for reading, writing, displaying data files; parallel object-oriented module 64 for sampling said data files to reduce the number of said data files; parallel object-oriented module 66 for multi-resolution analysis to perform a reversible transformation into a coarser resolution of said data files; parallel object-oriented module 68 for removing noise from said data files; parallel object-oriented module 70 for data fusion of said data files; parallel object-oriented module 72 for identifying objects in the said data files; parallel object-oriented module 74 for extracting relevant features for each of said objects; parallel object oriented module 76 for normalizing said features; parallel object-oriented module 78 for dimension reduction (reducing the number of said features of said objects); parallel object-oriented module 80 for pattern recognition algorithms; parallel object-oriented module 82 for displaying said data files and said objects and capturing feedback from scientists for validation; storing features module 84 for storing the features for each of said objects, after they have been extracted in module 72, reduced in number in module 76, used for pattern recognition in module 78, and displayed in module 82; and module 86 for linking the parts of the data mining system. [0134] [0134]FIG. 6 is a flow chart 90 showing the basic steps of a data mining method that incorporates an embodiment of the decision tree method of the present invention. The steps shown in FIG. 6 include the following: reading, writing, displaying data files step 92; sampling said data files and reducing the number of said data files step 94; multi-resolution analysis to perform a reversible transformation into a coarser resolution of said data files step 96; removing noise from said data files step 98; data fusion of said data files step 100; identifying objects in the said data files step 102; extracting relevant features for each of said objects step 104; normalizing the said features of the said objects step 106; reducing the dimension or number of said features of said objects step 107; recognizing patterns among said objects using said features step 108; displaying said data files and said objects and capturing feedback from scientists for validation step 110; storing the said features for each of said objects, after they have been extracted in step 104, reduced in number in step 106, used for pattern recognition in step 107, and displayed in step 110; and linking the parts of the data mining system step 114. [0135] While the invention may be susceptible to various modifications and alternative forms, specific embodiments have been shown by way of example in the drawings and have been described in detail herein. However, it should be understood that the invention is not intended to be limited to the particular forms disclosed. Rather, the invention is to cover all modifications, equivalents, and alternatives falling within the spirit and scope of the invention as defined by the following appended claims. Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS5319740 *Mar 4, 1991Jun 7, 1994Hitachi, Ltd.Expert system building method and systemUS5805915 *Jun 27, 1997Sep 8, 1998International Business Machines CorporationSIMIMD array processing systemUS5875285 *Nov 22, 1996Feb 23, 1999Chang; Hou-Mei HenryObject-oriented data mining and decision making systemUS5987468 *Dec 12, 1997Nov 16, 1999Hitachi America Ltd.Structure and method for efficient parallel high-dimensional similarity joinUS6088511 *Jun 30, 1998Jul 11, 2000Microsoft CorporationNested parallel 2D Delaunay triangulation methodUS6212617 *Jun 30, 1998Apr 3, 2001Microsoft CorporationParallel processing method and system using a lazy parallel data type to reduce inter-processor communicationUS6311265 *Mar 25, 1996Oct 30, 2001Torrent Systems, Inc.Apparatuses and methods for programming parallel computersUS6553366 *Oct 1, 1999Apr 22, 2003Ncr CorporationAnalytic logical data model* Cited by examinerReferenced byCiting PatentFiling datePublication dateApplicantTitleUS6859804 *Jun 11, 2002Feb 22, 2005The Regents Of The University Of CaliforniaUsing histograms to introduce randomization in the generation of ensembles of decision treesUS6938049Jun 11, 2002Aug 30, 2005The Regents Of The University Of CaliforniaCreating ensembles of decision trees through samplingUS7542960 *Dec 17, 2002Jun 2, 2009International Business Machines CorporationInterpretable unsupervised decision treesUS8527776 *Jun 10, 2004Sep 3, 2013Visa International Service AssociationSynthesis of anomalous data to create artificial feature sets and use of same in computer network intrusion detection systemsUS20030229630 *Jun 11, 2002Dec 11, 2003The Regents Of The University Of CaliforniaCreating ensembles of decision trees through samplingUS20030229641 *Jun 11, 2002Dec 11, 2003The Regents Of The University Of CaliforniaUsing histograms to introduce randomization in the generation of ensembles of decision treesUS20040117336 *Dec 17, 2002Jun 17, 2004Jayanta BasakInterpretable unsupervised decision treesUS20040225627 *Jun 14, 2004Nov 11, 2004Visa International Service Association, A Delaware CorporationSynthesis of anomalous data to create artificial feature sets and use of same in computer network intrusion detection systemsUS20050138029 *Jun 9, 2004Jun 23, 2005International Business Machines CorporationGeneralized index set splitting in software loopsUS20060242180 *Jul 23, 2004Oct 26, 2006Graf James AExtracting data from semi-structured text documentsUS20080082973 *Sep 29, 2006Apr 3, 2008Brenda Lynne BelkinMethod and Apparatus for Determining Software InteroperabilityUS20150293974 *Apr 10, 2014Oct 15, 2015David LooDynamic Partitioning of Streaming Data* Cited by examinerClassifications U.S. Classification1/1, 707/999.102International ClassificationG06K9/62, G06F7/00, G06F7/24Cooperative ClassificationY10S707/99943, G06K9/6282, G06F7/24European ClassificationG06K9/62C2M2A, G06F7/24Legal EventsDateCodeEventDescriptionJun 8, 2001ASAssignmentOwner name: REGENTS OF THE UNIVERSITY OF CALIFORNIA, THE, CALIFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:KAMATH, CHANDRIKA;CANTU-PAZ, ERICK;REEL/FRAME:011910/0961Effective date: 20010601Jan 14, 2002ASAssignmentOwner name: ENERGY, U.S. DEPARTMENT OF, CALIFORNIAFree format text: CONFIRMATORY LICENSE;ASSIGNOR:CALIFORNIA, UNIVERSITY OF;REEL/FRAME:012482/0516Effective date: 20010823Jun 23, 2008ASAssignmentOwner name: LAWRENCE LIVERMORE NATIONAL SECURITY LLC, CALIFORNFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:THE REGENTS OF THE UNIVERSITY OF CALIFORNIA;REEL/FRAME:021217/0050Effective date: 20080623Aug 11, 2009FPAYFee paymentYear of fee payment: 4Jun 7, 2013FPAYFee paymentYear of fee payment: 8RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services