US2016210350A1PendingUtilityA1

Scoring relationships between entities based on proximity in space and time

Assignee: IBMPriority: Aug 15, 2013Filed: Mar 25, 2016Published: Jul 21, 2016
Est. expiryAug 15, 2033(~7 yrs left)· nominal 20-yr term from priority
Inventors:Kirk J. Krauss
G06F 17/30604G06F 17/3053G06F 17/3087G06F 17/30241G06F 16/284G06F 16/288G06F 16/24578G06F 16/9537G06F 16/29
56
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

Systems and computer program products for determining a relationship score between a first entity and a second entity. A first computer-readable representation of a first spatial region containing the first entity is generated. A second computer-readable representation of a second spatial region containing the second entity is generated. The first computer-readable representation and the second computer-readable representation are compared at decreasing resolutions until a matching condition is reached. A relationship score is assigned to one or more of the first entity and the second entity based on the resolution at which the matching condition is reached.

Claims

exact text as granted — not AI-modified
1 . A computer program product for determining a relationship score between a first entity and a second entity, the computer program product comprising a computer readable storage medium having program code embodied therewith, the program code executable by a processor to:
 generate, by the processor, a first computer-readable representation of a first spatial region containing the first entity;   generate, by the processor, a second computer-readable representation of a second spatial region containing the second entity;   compare, by the processor, the first computer-readable representation and the second computer-readable representation at decreasing resolutions until a matching condition is reached; and   assign, by the processor, a relationship score to one or more of the first entity and the second entity based on the resolution at which the matching condition is reached.   
     
     
         2 . The computer program product of  claim 1 , wherein the matching condition includes one or more of:
 an exact match of the first computer-readable representation and the second computer-readable representation,   a partial match of the first computer-readable representation and the second computer-readable representation, and   no match between the first computer-readable representation and the second computer-readable representation.   
     
     
         3 . The computer program product of  claim 1 , further comprising program code executable by the processor to:
 determine and take into account a temporal proximity between the first entity and the second entity when assigning the relationship score.   
     
     
         4 . The computer program product of  claim 3 , wherein the program code executable by a processor to determine and take into account a temporal proximity includes program code executable by the processor to:
 generate a first computer-readable representation of a first time interval associated with the first entity;   generate a second computer-readable representation of a second time interval associated with the second entity;   compare the first computer-readable representation and the second computer-readable representation at decreasing resolutions until a temporal matching condition is reached; and   assign a temporal relationship score to one or more of the first entity and the second entity based on the resolution at which the temporal matching condition is reached.   
     
     
         5 . The computer program product of  claim 4 , further comprising program code executable by a processor to:
 multiply the temporal relationship score and the relationship score to obtain a combined temporal and spatial relationship score.   
     
     
         6 . The computer program product of  claim 1 , wherein the first and second computer-readable representations are bit vectors and wherein decreasing the resolutions of the first and second computer-readable representations includes one or more of:
 truncating the bit vectors,   dithering the bit vectors,   applying compression algorithms to the bit vectors,   generating additional bit vectors representing spatial regions adjacent to one or more of the first spatial region and the second spatial region, and   truncating, dithering, or applying compression algorithms to one or more of the additional bit vectors.   
     
     
         7 . The computer program product of  claim 1 , wherein the first and second computer-readable representations are geohash values and wherein decreasing the resolutions of the first and second computer-readable representations includes one or more of:
 truncating the geohash values,   generating additional geohash values representing spatial regions adjacent to one or more of the first spatial region and the second spatial region, and   truncating one or more of the additional geohash values.   
     
     
         8 . The computer program product of  claim 4 , wherein the first and second computer-readable representations reflect time intervals and wherein decreasing the resolutions of the first and second computer-readable representations includes one or more of:
 extending the time intervals forward and backward in time,   fitting the time intervals into larger quanta of a determinate size in a predefined temporal grid.   
     
     
         9 . A system for determining a relationship score between a first entity and a second entity, comprising:
 a processor; and   a memory comprising instructions that when executed by the processor causes the following operations to be performed by the processor:   generating a first computer-readable representation of a first spatial region containing the first entity;   generating a second computer-readable representation of a second spatial region containing the second entity;   comparing the first computer-readable representation and the second computer-readable representation at decreasing resolutions until a matching condition is reached; and   assigning a relationship score to one or more of the first entity and the second entity based on the resolution at which the matching condition is reached.

Join the waitlist — get patent alerts

Track US2016210350A1 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.