19 results about "Record linkage" patented technology

The invention provides a privacy record linking method for low-quality data, which can be applied to the technical field of data fusion entity alignment. The method comprises the following steps: a link participant carries out multiple rounds of negotiation communication based on a link scene, and determines parameter information for subsequently executing a privacy record link; bloom filter coding operation is executed on respective data of link participants, the data missing number is recorded synchronously, and a coding table and a missing table are generated; the link unit analyzes the data of the coding table and the missing table by using the dynamic locality sensitive hash parameter, generates a record partitioning flag bit, and completes record partitioning according to the flag bit to form a partitioning group; a link unit extracts records in the corresponding blocks from the block group, marks the records in the blocks to form record pairs, and calculates a dynamic threshold value and Jaccard similarity of each record pair according to a reference filtering threshold value and a threshold value reduction amount; and in response to the Jaccard similarity being greater than or equal to the dynamic threshold, outputting the corresponding record pair identifier as a result.

In an embodiment, a computer-implemented method includes parsing a communication record, determining one or more intents of the communication record using a trained machine learning model, linking the communication record to one or more record IDs, identifying one or more fields within the communication record, presenting the communication record in a standardized form, including identification of intent, the standardized form resulting from the identified one or more fields, and determining a corresponding intent related action on the determined one or more intents.

This invention provides a method, device, and storage medium for generating and utilizing a multimodal discourse tree (MMDT). [Solution] The method generates an Extended Discourse Tree (EDT) from a text corpus (e.g., from a Discourse Tree (DT) or Communication DT (CDT)), links data records (e.g., records containing numerical data) to the Extended Discourse Tree, and generates a Multimedia Discourse Tree (MMDT). The MMDT links any suitable text / records from heterogeneous sources. For example, entities identified from the basic discourse units of the EDT are matched with entities in the data records. The method also identifies causal links between EDTs and / or between data records, identifies rhetorical relationships for each entity match / causal link match, and merges the data records with the EDT to generate the MMDT.

A permissioned blockchain, using off-chain storage, provides advantages over blockchains that rely on consensus and / or store information within the blockchain. Advantages include enhanced viability, compactness, and the ability to register material with distribution limitations (e.g., military classified). Examples create an immutable public record of data signatures that confirm when data is intact, without distributing the data itself, so that widespread availability of the blockchain (beyond those privileged to see the data) advantageously increases the size of the community that is able to detect spoofing or forgery attempts. A permissioning entity limits submissions to manage blockchain growth, foreclosing problematic material that may risk long-term viability. Examples render blockchain operations resistant to advanced persistent threats (APTs), leverage digital signatures as additional trust elements for high-risk data, link records to track pedigree and enable identification of superseded (obsolete) data, and leverage out-of-band date proof to enable independent verification of integrity and no-later-than data-of-existence.

Records linking is provided. Two records are selected from a plurality of records corresponding to a customer for pair-wise record comparison. It is determined whether the two records are included in different entities. A local auto-link-threshold value of the different entities is identified in response to determining that the two records are included in different entities. An attribute comparison is performed between the two records. A comparison score is generated based on the attribute comparison between the two records. It is determined whether the comparison score is greater than the local auto-link-threshold value of the different entities. The two records are linked in response to determining that the comparison score is greater than the local auto-link-threshold value of the different entities.

The invention discloses a unified electronic health record linkage system and method among multi-level medical institutions, and the system comprises a cloud management platform, a middle platform, and a front-end portal, and the linkage system carries out data interaction with each level of medical institution system. The middle stations comprise a technical middle station, a data middle station and a service middle station; the technical medium station provides a unified technical stack for the data medium station and the business medium station so as to realize development, deployment, management and operation and maintenance of the linkage system; the data middle station provides basic technical capabilities such as data integration, unified scheduling, whole-process data management and data service; according to the data set provided by the data middle station, the business middle station carries out data connection with the application system of the front-end portal and provides business services of different business domains; through a linkage system based on a micro-service architecture, unified management and linkage with a multi-level medical institution system are realized, and combined diagnosis and treatment services of the multi-level medical institutions are provided.

The application discloses a three-party efficient private record linkage method and system for large-scale databases, and belongs to the technical field of privacy protection data linkage. The three-party efficient private record linkage method for large-scale databases comprises the following steps: first, second participants respectively perform non-redundant blocking on local records, and send the records to a linkage unit after adding differential privacy disturbance to generate candidate record pairs and randomly and uniformly distribute the candidate record pairs to both parties; a requested party encodes records by using a Bloom filter, encrypts the encoding and an offset list based on quadratic residues, and sends the encoding and the offset list to a requesting party; the requesting party calculates an encrypted intersection cardinality by homomorphic addition, and generates an encrypted similarity result in combination with an encrypted offset; the linkage unit decrypts the result, returns matching record numbers, and both parties output final matching record pairs. The application realizes low computational overhead, low communication volume, high scalability and approximate matching, and improves the efficiency of privacy protection record linkage in large-scale cross-institutional data integration scenarios.

The application provides a privacy record linkage method and system for semantic heterogeneous data, involving multiple linkage participants and a linkage unit. Firstly, the attribute is divided into strong and weak categories by calculating the average difference of semantic similarity of data attribute characters. For weak semantic attributes, an improved CLK-CRBF counter Bloom filter is used to generate integer encoding. For strong semantic attributes, a fine-tuning embedding model is used to generate a dense vector. Then, the integer encoding is fused as a structured disturbance with the dense vector to form a semantic-aware encoding vector and sent to the linkage unit. The linkage unit uses locally sensitive hashing in an adaptive hybrid encoding space to block, generate candidate record pairs in the group, and calculate the similarity. Finally, the matching result is determined according to the negotiated threshold. The method significantly improves the linkage effect of semantic heterogeneous data while ensuring privacy, and the greater the data difference ratio, the more obvious the advantage.

Entity resolution (i.e., record linkage) involves the analysis / discovering of datasets that refer to the same real world entity. Analysis typically involves transformation and comparison of different fields of the dataset followed by the application of often domain / data specific logic for determining datasets that refer to the same real world entity (e.g., person). Consider, a bulk mailing of product catalogs to potential customers. Some individuals may have numerous public records that identify the individual differently. Illustratively, several records associated with Jane Doe at her current home address may exist: one record with her name listed as J. Doe, a second record as Jane H. Doe, a third record as Doe, Jane, and a fourth record as Jan Doe (a misspelling). Conceivably, the bulk mailing could unwittingly send multiple catalogs to Jane Doe at her current address, one for each name variation. The entity resolution process described herein can overcome such problems.

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.

The application discloses a kind of based on big data's wisdom campus safety early warning platform, including following steps: data preprocessing module, for collecting campus multi-source heterogeneous security data and pre-processing, form early warning analysis dataset;Candidate pair generation module, for extracting record link identification and generating candidate record pair set;Candidate pair screening module, for carrying out gate screening based on campus reachable domain constraint;Matching weight formation module, for executing the matching weight formation based on identity-event double-track comparison;Associated record link module, for executing Fellegi-Sunter probability record link algorithm to generate uniform association index;Matching determination result updating module, for executing the three-value determination boundary self-updating of grey zone upgrade backflow;Hierarchical early warning module, for output hierarchical early warning result.The application improves the association merging capability and hierarchical early warning accuracy of wisdom campus multi-source heterogeneous security data.

A computer vision process in which (i) a track record for one or more detected objects is created, the track record defining metadata or parameters for that detected object; and (ii) that track record is then linked to one or more higher-level track records for one or more higher-level objects.

An electronic device for record linkage including a memory storing one or more instructions, and a processor that executes the one or more instructions to generate one or more vectors of one or more strings from a reference database based on a modified Levenshtein distance, and generate a vector database for spelling similarity based on the one or more vectors. The modified Levenshtein distance is based on one or more parameters, including at least one of: a first number of insertions, a second number of deletions, a third number of replacements, or a fourth number of matches, one or more of the one or more parameters including a predefined weight, and one or more fixed strings.

The invention discloses a three-party efficient private record linking method and system for a large-scale database, and belongs to the technical field of privacy protection data linking. The large-scale database-oriented three-party efficient private record linking method comprises the following steps that: a first participant and a second participant respectively carry out non-redundant partitioning on local records, add differential privacy perturbation and then send the local records to a linking unit to generate candidate record pairs, and randomly and uniformly distribute the candidate record pairs to the first participant and the second participant; the requested party encodes the record by using a Bloom filter, encrypts the code and the offset list by using homomorphic encryption based on secondary residual, and sends the code and the offset list to the requesting party; the requester calculates an encryption intersection cardinal number through homomorphic addition, and generates an encryption similarity result in combination with the encryption offset; and the link unit decrypts the result and returns the matching record number, and the two parties output a final matching record pair. According to the method, approximate matching with low calculation overhead, low communication traffic and high expandability is realized, and the privacy protection record linking efficiency in a large-scale cross-mechanism data integration scene is improved.

A key object record is initialized a the data store to store data associated with a physical key object. A digital fingerprint of the physical key object is stored in the key object record. Another digital record is created in the data store that is not the key object record. The digital record is linked to the digital fingerprint of the physical key object. The linking is arranged to provide secure control access to the linked digital record. A tendered access key is received via a programmatic interface or user interface, and the data store is queried based on the tendered access key to identify a matching digital fingerprint of a key object. In a case that the querying identifies the matching digital fingerprint of the key object within a prescribed level of confidence, access to the linked digital record secured by the key object is granted.

This application provides a privacy-preserving record linking method, apparatus, electronic device, and storage medium. The method includes: adding noise to each block corresponding to each data record in each database storing different data records based on output-constrained differential privacy rules, so that the data records with added noise are treated as noisy data records; the output-constrained differential privacy rules are used to select whether to add noise to the data records in the block or add zero noise to the block based on the rounding result of the Laplace noise; based on a sliding window, performing similarity matching on each noisy data record from different databases, and linking the noisy data records that successfully match the similarity to obtain corresponding privacy-preserving record pairs. This application can improve the effectiveness and reliability of record linking while ensuring end-to-end privacy protection and efficient record linking, and can improve the reliability of privacy protection in the end-to-end record linking process.

Methods and apparatuses are described herein for sorting with diverse sets of data. The methods and apparatuses receive a plurality of records from one or more data sources, create superblocks based upon one or more blocking attributes, generate k-mers for all the records based upon a selected k value, perform blocking on the records and place any records with matching k-mers in the appropriate superblocks, define a graph G(V, E) where there is a node per record and connect records via an edge in the graph when the records are found together in at least one of the superblocks and an edit distance between the records is within a given threshold value, and find and output the connected components of graph G(V, E) as final clusters.

A method includes performing by a host system processor: providing a database including a plurality of records, the database having at least one attribute associated therewith; determining a plurality of maximum block sizes as a plurality of ideal maximum numbers of the plurality of records in a plurality of blocks, respectively, based on a plurality of blocking keys; determining a duplication factor based on a number of unique records of the plurality of records based on all of the at least one attribute; and generating candidate pairs of the plurality of records for linkage based on the plurality of maximum block sizes and the duplication factor.

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.