Auto-tuning of comparison functions
AssigneeInternational Business Machines Corporation
InventorsMartin Oberhofer, Sergio Luis Olvera Gutierrez, Soma Shekar Naganna, Abhishek Seth, James Albert O'Neill, Jr.
Life of this patent
Estimating the term…
Loading patent…
AssigneeInternational Business Machines Corporation
InventorsMartin Oberhofer, Sergio Luis Olvera Gutierrez, Soma Shekar Naganna, Abhishek Seth, James Albert O'Neill, Jr.
Estimating the term…
A method for relating different types of records. The method may include providing comparison functions, wherein each comparison function corresponds to a semantical class, and wherein a computational cost is associated with each comparison function. The method may include determining one or more attribute pairs between the different types of records. The method may include sorting the comparison functions according to a determined accuracy. The method may include selecting a set of comparison functions associated with semantical classes according to a predefined rule. The method may include determining a total computational cost based on the computational cost of the selected set of comparison functions. The method may include determining whether two or more records are related using the selected set of comparison functions. The method may include relating the two or more records. The method may include determining a rate of false negative records.
A computer-implemented method for relating different types of records associated with a plurality of records, with each of the different types of records comprising a plurality of attributes, the computer-implemented method comprising:
The method according to clause 8, wherein selecting the set of comparison functions, determining the total computation cost, determining whether two or more records are related, and determining the rate of false negative records is performed as long as a public key for the encryption length does not exceed a predefined length.
A computer system for relating different types of records associated with a plurality of records, with each of the different types of records comprising a plurality of attributes, the computer system comprising:
A computer program product for relating different types of records associated with a plurality of records, with each of the different types of records comprising a plurality of attributes, comprising:
Dependencies are inferred from the claim text.
Drawings are temporarily unavailable. Open the PDF at USPTO
From the US filing history. Foreign family members aren’t listed.
No references of this kind are recorded.
Machine learning
Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols: using a plurality of keys…
Computing arrangements using knowledge-based models: dynamic search techniques; Heuristics; Dynamic trees; Branch-and-bound
Computing arrangements using knowledge-based models: inference or reasoning models
About 15 years of term left · ends 19 Oct 2041 (estimated)
The invention relates generally to master data management, and more specifically, to a computer-implemented process for relating a plurality of records to each other.
In business and technical systems, master data management (MDM) is a method used to define and manage data of an organization in a consistent way by using data integration of a single point of reference in a computing system for a real-word entity. One example may be the case of a customer record which may have different attributes in an enterprise resource management system (ERP) than in a customer relationship management system (CRM). In another, more technical example, there may be measurement data of exploration experiments referring to a certain geographical location and a technical description of exploration surroundings having performed exploration experiments. However, in both systems the location and the kind of exploration experiments may have been described differently.
A method for relating different types of records associated with a plurality of records, with each of the different types of records comprising a plurality of attributes is provided. The method may include providing a plurality of comparison functions, wherein each comparison function associated with the plurality of comparison functions corresponds to a semantical class, and wherein a computational cost is associated with each of the plurality of comparison functions. The method may include based on the plurality of comparison functions, determining one or more attribute pairs between the different types of records. The method may include sorting, for each attribute pair of a selected semantical class, the plurality of comparison functions according to a determined accuracy associated with each of the plurality of comparison functions. The method may include, based on the sorted plurality of comparison functions, selecting a set of comparison functions associated with a plurality of semantical classes according to a predefined rule. The method may include determining a total computational cost based on the computational cost of the selected set of comparison functions. The method may include determining a relationship between two or more records associated with the plurality of records using the selected set of comparison functions. The method may include relating the two or more records based on the determined relationship. The method may include determining a rate of false negative records based on the related two or more records.
These and other objects, features and advantages of the present invention will become apparent from the following detailed description of illustrative embodiments thereof, which is to be read in connection with the accompanying drawings. The various features of the drawings are not to scale as the illustrations are for clarity in facilitating one skilled in the art in understanding the invention in conjunction with the detailed description. In the drawings:
FIG. 1 shows a block diagram of an embodiment of the inventive computer-implemented method for relating a plurality of records to each other.
FIG. 2 shows a block diagram of two records of different types with different sets of comparison functions.
In the context of this description, the following conventions, terms and/or expressions may be used:
The term ‘record’ may denote an data structure comprising a plurality of elements, attributes or fields, wherein at least a portion of different attributes are of different datatypes. As an example: a customer record may comprise a name (datatype string, fixed length), address (datatype string, fixed length), a street number (datatype integer), ZIP code (datatype integer), contact history (datatype array of strings, variable length), history of orders (datatype array of product numbers, prices, descriptions, . . . ).
The term ‘types’ may denote here mainly types of records. Two records are of different type if their sequence or datatype of attributes are different to each other. Thus, two records may not be comparable directly because their data structures are different.