Loading patent…
AssigneeInternational Business Machines Corporation
InventorsAbhishek Seth, Soma Shekar Naganna, Mahendra Singh Kanyal, Devbrat Sharma
Estimating the term…
Described are techniques for disintegrating an entity into smaller entities. A graph (“first graph”) for the entity of records to be disintegrated is constructed, where each vertex of the first graph represents a record in the entity of records to be disintegrated. The edges in the first graph connecting records in the entity of records represent matching links between the records, where each edge is associated with a weight corresponding to a similarity score. Furthermore, two or more additional graphs representing two or more sub-entities of the entity of records to be disintegrated are constructed. Such graphs are constructed based on selecting edges with a maximum weight out of the edges connected between each pair of records in the first graph or based on the number of connections each record has with other records in the first graph exceeding a threshold value.
A computer-implemented method for disintegrating an entity of records into smaller entities, the method comprising:
A computer program product for disintegrating an entity of records into smaller entities, the computer program product comprising one or more computer readable storage mediums having program code embodied therewith, the program code comprising programming instructions for:
A system, comprising:
Dependencies are inferred from the claim text.