Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
1999-03-29
2002-07-02
Chan, Eddie (Department: 2783)
Data processing: database and file management or data structures
Database design
Data structure types
C712S011000, C712S016000, C712S010000, C712S028000, C707S793000, C345S506000, C345S520000
Reexamination Certificate
active
06415286
ABSTRACT:
FIELD OF THE INVENTION
The present invention relates to computer systems for analyzing, and computing with, sets of data, such as, for example, extremely large data sets.
BACKGROUND OF THE INVENTION
As computing power has grown, it has become increasingly practical to process data, and, in particular, large amounts of data, in new and useful ways. For example, the term “data base mining” has been used to describe the practice of searching vast amounts of data for commercially, medically, or otherwise important patterns, patterns which would probably have been impossible to find by human pattern matching, and which probably would have taken too long to have found with prior generations of computer equipment.
For example, one common uses of data base mining is for corporations to search through data bases containing records of millions of customers or potential customers, looking for data patterns indicating which of those customers are sufficiently likely to buy a given product to justify the cost of selecting them as targets of a direct marketing campaign. In such searches, not only are millions of records searched, but hundreds, or even thousands of fields within each record. Such data base mining has proven much more successful in selecting which customers are most likely to be interested in a given new product than prior methods.
Similarly, data base mining can be used for scanning vast numbers of medical records to look for subtle patterns associated with disease; for scanning large numbers of financial transactions to look for behavior likely to be fraudulent; or to study scientific records to look for new casual relationships.
Because they often involve a tremendous number of records, and are often seeking patterns between a large number of fields per record, data base mining operations tend to require huge amounts of computation. This, in combination with the fact that most data base mining operations can be easily partitioned to run on separate processors, has made data base mining one of the first major commercial uses of massively parallel computers. But even when run on most commercially available parallel systems many data base mining functions are relatively slow because of their tremendous complexity. Therefore there is a need to improve the speed at which such tasks can be performed.
Neural nets are a well known device for automatically selecting which patterns of values in certain source fields of records are likely to be associated with desired values in one or more target fields. A neural network normally includes an input layer comprised of a plurality of input nodes, an output layer of one or more output nodes, and, in hidden-layer networks, one or more so-called hidden layers, each comprised of one or more nodes. Hidden layer are hidden in the sense that they do not connect directly to any inputs or outputs.
The knowledge in a neural net is contained in its weights. Each node in the input layer or hidden layer contains a weight associated with its connection with each node in the next layer. Thus, in a typical hidden-layer network, each node in the input layer has a separate weight for its connection to each node in the hidden layer, and each node in the hidden layer has a separate weight for its connection to each node in the output layer. The value supplied to each given node in a given layer is supplied to each individual node in the successive layer, multiplied by the weight representing the connection between the given node and the individual node in the successive layer. Each node receiving such values generates an output, which is a function of the sum of the values supplied it. Usually the output is a non-linear function of the sum of values supplied to the node, such as a sigmoid function. The sigmoid function has the effect of making the output operate like an on-off switch whose output varies rapidly from a substantially “off” value to a substantially “on” value as the sum of the values supplied to the node crosses a small threshold region.
A common way for training the weights of a neural network is to take each record in a training set and apply the value of each of its source fields to a corresponding input of the net. The network's weights are then modified to decrease the difference between the resulting values generated at the network's one or more outputs and the actual values for the outputs' corresponding target fields in the record. There are a variety of well know methods for making such weight modifications, including back propagation, conjugate gradient, and quick propagation. The training process is normally repeated multiple times for all the training records until the sum of the difference between the generated and actual outputs approaches a relative minimum.
One of the problems with neural nets is that the amount of time to appropriately train them to recognize all of the possible source field patterns associated with desired target field values goes up very rapidly as the number of source or target fields does, and as the number of different types of source patterns which might be associated with a desired target does. Even with large parallel computer systems the amount of time required to properly train such networks to learn such complex sets of patterns is often prohibitive.
In an attempt to improve the speed at which neural networks can train, a new type of neural network has been proposed. These are so called neural tree networks. These are decision trees, a well known type of classifying tool, in which a neural network is placed at each of the network's non-terminal nodes. In such trees, each non-terminal node is a two layer network, which trains much more rapidly than a hidden-layer network. The data applied to each non-terminal node is used to train up the node's neural net. This is done in a training process which applies the source fields used in the overall classification process to the input nodes of the net and the one or more target fields used in that classification process to the output the two layer net. Once the network has been trained over the training set, the data objects are split between the node's child nodes based on whether the one or more sigmoidal output of the trained net is “on” or “off” for each such data object. The data object reaching the tree's terminal, or leaf, nodes are considered classified by the identity of the particular leaf node they reached.
Such neural tree networks have the advantage of training much more rapidly than traditional neural networks, particularly when dealing with large complex classification tasks. However, they are not as discriminating as might be desired.
In general, a major issue in parallel computing is the division of the computational task so that a reasonable percentage of the computing power of multiple processor can be taken advantage of, and so the analytical power of the process is as high as possible. This issues is particularly important when it comes to many data base mining functions, such the training of neural networks mentioned above or of other modeling tasks.
SUMMARY OF THE INVENTION
It is an object of the present invention to provide apparatuses and methods for more efficiently computing large amounts of data.
It is another object of the present invention to provide apparatuses and methods for efficiently finding patterns in data sets, particularly large data sets.
It is still another object of the present invention to provide apparatuses and methods for efficiently using and training neural networks to find patterns in data set.
It is yet another object of the present invention to provide apparatuses and methods for more efficient parallel computing.
According to one aspect of the present invention a computer system with P processors receives data objects having N parameters. It divides an N-dimensional data space defined by the N parameters into M sub-spaces, where M is greater than or equal to P. This is done in such a manner that the boundaries between the resulting sub-spaces need not be orthogonal to t
Beckerle Michael J.
Passera Anthony
Thorp John R.
Zyszkowski Edward S.
Chan Eddie
Monestine Mackly
Torrent Systems, Inc.
Wolf Greenfield & Sacks
LandOfFree
Computer system and computerized method for partitioning... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Computer system and computerized method for partitioning..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computer system and computerized method for partitioning... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2833419