Abstract: A predictive model is used to populate a cache in a videogame system. The predictive model takes as an input a sequence of file sections that have been requested for the associated videogame thus far. The predictive model then returns the names or indicators of one or more file sections that will likely be requested in the future along with a probability that those file sections will be requested. A cache driver executing in the background of the videogame system may then use the predictive model to reduced load times during the execution of a videogame by retrieving the predicted file sections from the optical disk and placing them in a cache during periods of low CPU activity.

Abstract: A script driven infrastructure is provided in order to selectively move structure and data from a source database to a target database. The structure and data is moved using a data transfer mechanism, where the data is contained in disk files stored on the source database and it has corresponding script files describing the structure of the data. The transfer of the data is driven by the script files which allows for selective transfer of structure and data. In one aspect of the invention, the disk files are stored in SQL format and the script files are saved in SQL format and XML format, where the script files saved in SQL format create objects and relational constraints in the target database, and the script files stored in XML format drive the transfer process of the data stored in the disk files.

Abstract: Systems and methods of digitally distributing digital game content and tracking royalties for the digital game content may include a correlated title key, retail key, and license key. The a correlated title key, retail key, and license key may be used to generate a royalty rate. For example, a royalty rate may be generated based on the license key. Additionally, a royalty price may be generated based on the title key. Then, a royalty amount may be computed by multiplying the royalty rate and the royalty price. The royalty amount may be stored in a retailer account that corresponds to the retail key.

Abstract: Systems and methods of providing digital game content to a portable game system may include a digital content source and an authentication system in communication with the portable game system. The portable game system may receive a digital game content from the digital content source. The digital game content may be stored in a storage component in the portable game system. The digital game content may be activated by a user of the portable game system, for example. After activating, the digital game content may be changed from a demonstration version when an electronic credential may be present in the portable game system.

Abstract: A predictive model is used to populate a cache in a videogame system. The predictive model takes as an input a sequence of file sections that have been requested for the associated videogame thus far. The predictive model then returns the names or indicators of one or more file sections that will likely be requested in the future along with a probability that those file sections will be requested. A cache driver executing in the background of the videogame system may then use the predictive model to reduced load times during the execution of a videogame by retrieving the predicted file sections from the optical disk and placing them in a cache during periods of low CPU activity.

Abstract: The operation of a data flow is improved by providing for validation of the consistency of the data flow with the external data files it works with, even in the face of changes in those external data files Metadata is stored regarding the external data files. Because external data files may change, this metadata is used when determining whether the external data files are still compatible with the data flow. In such performing such validation, the metadata tracks what changes in the external data files have occurred, and allows increased flexibility in presenting the user with options or in automatically fixing the data flow to correspond with changes in external data files. When the external data files are not available, the stored metadata can be used to validate the data flow to the last information regarding the external data files. The external metadata can be resynchronized to the data flow or to the external data files to provide updated external metadata for later validation.

Abstract: Selection of certain attributes as output and input attributes is provided so a decision tree may be created more efficiently. For each possible output attribute an interestingness score is calculated. This interestingness score is based on entropy of the output attribute and a desirable entropy constant. The attributes with the highest interestingness score are used as output attributes in the creation of the decision tree. Score gains for the input attribute over the output attributes are calculated using a conventional scoring algorithm. The sum of the score gains over all output attributes for each input attribute is calculated. The attributes with the highest score gain sums are used as input attributes in the creation of the decision tree.

Abstract: Continuous attributes are used as input attributes in decision tree creation. Buckets are created by dividing the range of values for the continuous attribute into sub-ranges of equal extent. These buckets form initial partitions. Mergers of adjacent partitions are considered to determine score gains from such mergers, and the most useful mergers occur. The resulting partitions are used as the discretization of the continuous attribute for use as an input attribute.

Abstract: A system and method for use with a data mining application for a large database having a large number of records. A selection attribute is chosen from one of a plurality of attributes contained by records within the database. Records are scanned in the database and a randomizing function is applied to the selection attribute of each record to create a randomized record value. A selection criteria is then applied to identify records for inclusion within a subset of records (smaller than the original data set) by comparing the randomized record value of each record with the selection criteria. The subset of records having a randomized record value satisfying the selection criteria approximates the entire database but takes up less memory and can be evaluated or scanned much more quickly.

Abstract: Disclosed is a system for approximating conditional probabilities using an annotated decision tree where predictor values that did not exist in training data for the system are tracked, stored, and referenced to determine if statistical aggregation should be invoked. Further disclosed is a system for storing statistics for deriving a non-leaf probability corresponding to predictor values, and a system for aggregating such statistics to approximate conditional probabilities.

Abstract: High-cardinality attributes are used as input attributes and as output attributes in decision tree creation. When determining which attribute test to use at a node, a distribution of states for the high-cardinality attribute in the testing data at the node is created. A certain number of the most common states for the high-cardinality attribute are selected. The most common states are used as the states for the high-cardinality attribute in determining which attribute test to use. The remaining states are combined into one state and used as a single state for the high-cardinality attribute in determining which attribute test to use. The high-cardinality attribute may be either an input attribute or an output attribute to the decision tree.

Abstract: Selection of certain attributes as output and input attributes is provided so a decision tree may be created more efficiently. For each possible output attribute an interestingness score is calculated. This interestingness score is based on entropy of the output attribute and a desirable entropy constant. The attributes with the highest interestingness score are used as output attributes in the creation of the decision tree. Score gains for the input attribute over the output attributes are calculated using a conventional scoring algorithm. The sum of the score gains over all output attributes for each input attribute is calculated. The attributes with the highest score gain sums are used as input attributes in the creation of the decision tree.

Abstract: Continuous attributes are used as input attributes in decision tree creation. Buckets are created by dividing the range of values for the continuous attribute into sub-ranges of equal extent. These buckets form initial partitions. Mergers of adjacent partitions are considered to determine score gains from such mergers, and the most useful mergers occur. The resulting partitions are used as the discretization of the continuous attribute for use as an input attribute.

Abstract: Determination as to whether a variable is numeric or non-numeric. In one embodiment, a variable is input having a plurality of values, where each value has a count. The variable is determined to be numeric or non-numeric by assessing closeness of counts for adjacent values of the variable. Whether the variable is numeric or non-numeric is then output.

Abstract: A system and method for use with a data mining application for a large database having a large number of records. A selection attribute is chosen from one of a plurality of attributes contained by records within the database. Records are scanned in the database and a randomizing function is applied to the selection attribute of each record to create a randomized record value. A selection criteria is then applied to identify records for inclusion within a subset of records (smaller than the original data set) by comparing the randomized record value of each record with the selection criteria. The subset of records having a randomized record value satisfying the selection criteria approximates the entire database but takes up less memory and can be evaluated or scanned much more quickly.