Abstract: An association rule is extracted by processing a database partitioned into record units in which the same attribute is missing, from a database including missing values. The association rule is extracted from the database including the missing by means for partitioning a database so that a database including a missing analysis object becomes record blocks in which the same attribute is missing, and means for estimating an upper threshold of a support value in the entire database from local support counts in partitioned databases and thereby limiting records for which the support count is counted.

Abstract: Disclosed are method and system for generating history of behavior that is capable of simplifying input of a behavior content of a human behavior pattern determined from data measured by a sensor. A computer obtains biological information measured by a sensor which is mounted to a person and accumulates the biological information, obtains motion frequencies from the accumulated biological information, obtains time-series change points of the motion frequencies, extracts a period between the change points as a scene which is a period of being in the state of an identical motion, compares the motion frequencies with a preset condition for each extracted scene and identifies the action contents in the scene, estimates the behavior content performed by the person in the scene on the basis of the appearance sequence of the action contents, and generates the history of the behaviors on the basis of the estimated behavior contents.

Abstract: An association rule is extracted by processing a database partitioned into record units in which the same attribute is missing, from a database including missing values. The association rule is extracted from the database including the missing by means for partitioning a database so that a database including a missing analysis object becomes record blocks in which the same attribute is missing, and means for estimating an upper threshold of a support value in the entire database from local support counts in partitioned databases and thereby limiting records for which the support count is counted.

Abstract: A data relay server connected between a client computer and a database server produces a query message obtained by encrypting a retrieval condition designated by the client computer, and transmits the query message to the database server. The database server encrypts a specific data item which is designated by the retrieval condition and read out from the database, retrieves service information matched with the retrieval condition by encrypted data matching, and replies the service information as a retrieval result to the data relay server.

Abstract: A data relay server connected between a client computer and a database server produces a query message obtained by encrypting a retrieval condition designated by the client computer, and transmits the query message to the database server. The database server encrypts a specific data item which is designated by the retrieval condition and read out from the database, retrieves service information matched with the retrieval condition by encrypted data matching, and replies the service information as a retrieval result to the data relay server.

Abstract: A data analysis apparatus has a first storage for storing information, a second storage for storing association between information, a unit for setting a condition to divide the information into a plurality of groups on the basis of association between the information stored in the second storage, a unit for setting an item to compare information divided into a plurality of groups, a unit for setting a condition to extract information to be compared, and an evaluation unit for extracting information that satisfies the condition for extracting information from the first storage, dividing information extracted on the basis of the condition for dividing the information into groups into a plurality of groups, and calculating evaluation values to conduct comparison as to a comparison item for each group.

Abstract: By corresponding the external databases to the predicates used in query processing according to a predetermined ontology, it is allowed to issue a query through the ontology. The query thrown into the integrated database is expanded into the set of approximate queries according to approximation rules provided in the ontology. The optimization module refers to the query capability of the external databases to perform the query optimizing in which these approximate queries can be executed efficiently as a whole.

Abstract: By introducing the concept of negation into an association rule, the number of combinations of items, serving as candidates of the association rule containing negative items, becomes enormous for mining. The invention sorts out frequent itemsets to be included in an association rule in advance by ensuing its upper bound of confidence satisfying conditions of a confidence and a confidence increment input by an user. Also, by checking a logic product for each bit of a bit string reflecting the presence of each item in the itemset, the combinations of items as candidates are pruned. The pruning of unnecessary combinations is effectively carried out. The number of combinations of the items for compiling association rules is reduced.

Abstract: The present invention aims to provide a medical data analytic system which can efficiently generate relationships between data forming the evidence from large volumes of medical data, and support a doctor's diagnosis. The system includes a calculating device comprising a medical data analysis unit, a database comprising a medical data storage unit, and an input/output device comprising a condition input unit for inputting n diagnosis-related conditions. Depending on the aforesaid n conditions, the ratio of 2n groups of medical data for analysis corresponding to all combinations of conditions is calculated for the case when the conditions are satisfied and the case when they are not satisfied, and displayed on an output unit of the input/output device.

Abstract: An item pattern straddling over two or more databases with different structure and/or attributes is extracted from the databases based on a comparison of partial data. The support count for the item pattern is counted by communicating a list of identifiers for records, the number of the identifiers, or a subset of the item pattern between the databases. For an item pattern with a known support count, an upper-bound value of the support counts for subsets of that item pattern is calculated on the basis of a difference in the support counts for the subsets, thereby limiting the item patterns for which the support counts are to be counted.

Abstract: By introducing the concept of negation into an association rule, the number of combinations of items, serving as candidates of the association rule containing negative items, becomes enormous for mining. The invention sorts out frequent itemsets to be included in an association rule in advance by ensuing its upper bound of confidence satisfying conditions of a confidence and a confidence increment input by an user. Also, by checking a logic product for each bit of a bit string reflecting the presence of each item in the itemset, the combinations of items as candidates are pruned. The pruning of unnecessary combinations is effectively carried out. The number of combinations of the items for compiling association rules is reduced.

Abstract: By corresponding the external databases to the predicates used in query processing according to a predetermined ontology, it is allowed to issue a query through the ontology. The query thrown into the integrated database is expanded into the set of approximate queries according to approximation rules provided in the ontology. The optimization module refers to the query capability of the external databases to perform the query optimizing in which these approximate queries can be executed efficiently as a whole.

Abstract: A data relay server connected between a client computer and a database server produces a query message obtained by encrypting a retrieval condition designated by the client computer, and transmits the query message to the database server. The database server encrypts a specific data item which is designated by the retrieval condition and read out from the database, retrieves service information matched with the retrieval condition by encrypted data matching, and replies the service information as a retrieval result to the data relay server.