56 results about "Record linkage" patented technology

A method for probabilistic record linkage includes providing a record pair comprising a plurality of fields, providing a plurality of scenarios, each scenario relating to a distribution of patterns among a plurality of attribute statuses, and comparing the record pair to determine a record difference. The method includes determining a probability of a status for each of a plurality of attributes based on the distance metric of the plurality of fields, wherein each field corresponds to a respective attribute, wherein the field is observable and the attribute is hidden, determining a probability of each scenario based on the probability of the status for each attribute and the Bayesian net representing the probabilistic model on the relationship between scenarios and attributes, and outputting a probability of duplication or non-duplication of the record pair determined from the probabilities of the plurality of scenarios.

Enhanced links in a message composition surface are described. A uniform resource locator (URL) may be identified while a user is composing a message in a message composition surface of an electronic message such as an email. A source of the URL and the file type of the document linked to by the URL can be determined and a preview of the document can be rendered in the message composition surface. When the source is a cloud storage location, access permissions for the document can be adjusted from within email—without the user navigating to a file management site of the cloud storage. When the file type is a productivity application, a link rendering element can call a productivity application service to provide interaction functionality for the productivity application file and facilitate the rendering of the productivity application file.

Record Linkage (RL) is the task of identifying two or more records referring to the same entity (e.g., a person, a company, etc.). RL models can be based on Cost Sensitive Alternating Decision Trees (ADTree), an algorithm that uniquely combines boosting and decision trees algorithms to create shorter and easier-to-interpret linking rules. These models can be naturally trained to operate at industrial precision/recall operating points, and the shorter output rules are so clear that it can effectively explain its decisions to non-technical users via score aggregation or visualization. The models significantly outperform other baselines on the desired industrial operating points, and the improved understanding of the model's decisions led to faster debugging and feature development cycles.

A database system stores data relating to media objects and includes a meta table, a supplementary meta table, a content table, a supplementary content table, each supplementary content data record being linked to a supplementary metadata record and to a content data record. An object type link table links together records in the meta table, and a content data link table links together records in the content data table. An information retrieval system analyzes the tables and provides, for a selected instance of an object, information about that object's attributes and relationships with other objects in a hierarchical form.

A geographic database storing map data is provided. The geographic database is stored in a non-transitory computer readable medium. The geographic database comprises a plurality of records corresponding to drivable surfaces of a road network. The plurality of records comprise a plurality of lane records corresponding to particular lanes of the road network. Each first record of the plurality of records comprises a plurality of instances of adjacency information. Each instance of adjacency information/data (a) links the first record corresponding to a first drivable surface of the road network to a second record of the plurality of records corresponding to a second drivable surface of the road network. The first drivable surface is adjacent to the second drivable surface. Each instance of adjacency information/data indicates crossing parameters between the first drivable surface and the second drivable surface.

Methods, systems, and computer-readable media are provided for facilitating record matching and entity resolution and for enabling improvements in record linkage. A power-spectrum-based temporal pattern-specific weight may be incorporated into record linkage methods to enhance the record linkage accuracy and statistical performance. For example, in embodiments, a value-specific weight may be calculated from a population-based frequency of field-specific values and provides an opportunity to capture and measure the relative importance of specific values found in a field. A timeseries-derived Bayesian power spectrum weight may be calculated from the population-based frequency of temporal pattern-specific values in terms of intensities at various frequencies of the power spectrum computed from the timeseries, and further provides an opportunity to capture and measure the relative importance of specific sequences of care episodes.

A system and method for record linkage includes performing an entity augmentation process for linking new data records with existing entities in a database. Performing the entity augmentation process includes performing an exact matching sub-process that includes accessing existing entity unique identifier (UID) keys in a memory cache layer and comparing a new data record UID key to the existing entity UID keys.

Methods, systems, and devices for a cross-linked distributed ledger. The cross-referencing system includes multiple computing devices including a first computing device and a second computing device. A computing device of the multiple computing devices is configured to maintain a first cross-linked distributed ledger. The first cross-linked distributed ledger has a first set of multiple linked records that are associated with a first identifier. The first computing device includes a processor. The processor is configured to link or provide a first record associated with the first identifier to the first cross-linked distributed ledger. The first record has a first reference to a second record. The second record is within a second set of multiple cross-linked records of a second cross-linked distributed ledger.

A method for gathering and recording temporal information for a linked entity, the method including identifying a link related activity within a linked source entity, and recording a time stamp in association with the link related activity.

Disclosed is a system for, and method of, calculating parameters used to determine whether records and entity representations should be linked. The system and method use a symmetric and reflexive function to allow for linking records and entity representations whose field values differ. The system and method apply iterative techniques such that parameters from each linking iteration are used in the next linking iteration. The system and method need no human interaction in order to calibrate and utilize record matching formulas used for the linking decisions. These techniques may be used for geographic location proximity matching.

A database storage system based on optical disk includes a database management system installed on a server, a magnetic disk storage device and an optical disk storage device connecting, via a data connection, to the server. The database management system processes database management and data management in response to data requests and a database is created in the magnetic disk storage device, and includes a field structure generation module, a record index generation module, a storage space allocation module, a storage space status module, a record linkage module, a record split module and a database creation on optical disk module. The integrity of data is maintained during a database backup process. The optical disk containing a subdatabase accepts the management of the database management system to serve as a normal data source. The databases are hierarchically stored using the storage devices. The methods for database backup and restoration are provided.

Linking accounts corresponding to different products together to create a group so that group processing can be performed at the group level while independent processing of the accounts is performed at the account level. The method links the accounts into a group by linking a financial record for each account to group master data for the group. The group master data includes information about the group, including group parameters and a group identifier. A group typically includes a key account and one or more dependent accounts. The relationship between a dependent account and the group is specified by a dependent strategy. A dependent strategy specifies group level processing options for the account. The relationships between the accounts and the group are flexible to accommodate changes in the status of the group cardholders.

The invention discloses a block-based Web record linkage system which comprises a Web crawler, a Sample database, a Web record database, a block attribute analysis module, a blocking module, a block balancing module, a paired matching module, a matching determination module and a record linkage result set. According to a block-based Web record linkage method, data from various data sources are quickly blocked by a Mapreduce model, and the data are compared and recorded in the blocks, therefore, the record matching efficiency is improved to a large extent; on the basis, the sizes of blocks are balanced, so that the record matching efficiency is further improved. The recalling rate of record linkage is also improved by adopting a method for blocking a data set with a multi-block function from multiple angles.

A database storage system based on Jukebox comprises a server, a jukebox and a magnetic disk storage. The database management system comprises a field structure generation module, a record index generation module, a storage space allocation module, a storage space status module, a record linkage module, a record split module; further comprises a database creation and input on optical disk module, a search-term storage module, a search-term index generation module. By means of the present invention, a database is directly created on a write-once optical disk or an optical disk of other types, data is input into the database on the optical disk; full-text search for the databases on the optical disks in the jukebox can be performed within seconds, an original file of a database file on an optical disk can be retrieved within seconds, solving effectively the technical problems of managing and accessing large-scale optical disks with databases.

Methods, systems, and computer-readable media are provided for facilitating record matching and entity resolution and for enabling improvements in record linkage. A power-spectrum-based temporal pattern-specific weight may be incorporated into record linkage methods to enhance the record linkage accuracy and statistical performance. For example, in embodiments, a value-specific weight may be calculated from a population-based frequency of field-specific values or dichotomized values of selected phenotypic variables, and provides an opportunity to capture and measure the relative importance of specific values found in a field. A phenotypic bit-vector “fingerprint” pattern-specific weight or Bayesian power spectrum weight may be determined and incorporated into record linkage methods.

A computer on which an SIP message delivery program is running stores records for respective entities of an SIP message that contains location information into a table in a storage device. Each record links virtual host identifying information to identify a virtual host that receives an SIP message only when the entities contain predetermined location information with the predetermined location information that is a content of the receipt condition. The computer receives an SIP message from an SIP server on a network, and searches the table for a record whose receipt condition in an entity matches location information in the corresponding entity in the received SIP message, for each of entities in a predetermined order. When a record is detected, the computer delivers the received SIP message to the virtual host that is distinguished by the virtual host identifying information included in the detected record.

The invention provides a multi-party record linkage method, comprising the steps of: data preprocessing: dividing data sources of a plurality of participants into blocks, and converting records in thedata sources into bit arrays; record approximate matching: calculating the ratio of the bit arrays corresponding to the position of bit 1, and determining the corresponding positions of the interestrate as candidate matching positions when the interest rate reaches a dynamic threshold; similarity calculation: calculating the similarity between the candidate matching positions and judging whetherthe similarity reaches the global threshold. If yes, the matching is successful, otherwise the matching fails. The invention also relates to an electronic device, a storage medium and a multi-party record linkage system. The invention adopts the ratio to mark the similarity between the records at a certain position, thereby improving the fault tolerance; By using dynamic threshold and candidatematching positions to check and determine the successful matching position, so that the recall ratio and precision ratio are high; the similarity between records with quality problems can be effectively calculated; the invention realizes multi-party record linkage, can effectively protect privacy, and has good scalability and fault tolerance.