IP Library › Granted Patent US 11,308,165
Granted Patent B2
US 11,308,165 · App. 16/396,166 · Granted Apr 19, 2022

Methods and systems for merging point-of-interest datasets

Inventors: Wesley Boyer (Denver, CO); Aleksei Maximillian Kac (Parker, CO); Mark Romanak (Lone Tree, CO); Thomas M. Baker, Jr. (Denver, CO); Jeremy McKay (Denver, CO); Jared David Barnes (Denver, CO); Rossi Guiliani (Denver, CO)
Assignee: Verizon Patent and Licensing Inc.
G06F16/906
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,308,165
App. No.
16/396,166
Granted
Apr 19, 2022
Kind
B2
Abstract

An exemplary point-of-interest merging system accesses point-of-interest data records. Each point-of-interest data record includes data representative of a distinct set of features for a distinct point-of-interest. The merging system generates, based on the distinct sets of features of the point-of-interest data records, a graph data structure that includes the point-of-interest data records and weighted feature relationships interconnecting the point-of-interest data records. The merging system clusters, based on the graph data structure, the point-of-interest data records into subset groups of point-of-interest data records. The merging system generates one or more merged point-of-interest data records based on the clustered subset groups of point-of-interest data records.

Claims (55)

1. A method comprising:

accessing, by a computing system, a plurality of point-of-interest datasets from different sources;

batching, by the computing system and from the plurality of point-of-interest datasets from different sources, a plurality of point-of-interest data records together based on similarity between a feature included in distinct sets of features of the plurality of point-of-interest data records, each of the plurality of point-of-interest data records including data representative of a distinct set of features for a distinct point-of-interest;

generating, by the computing system based on the distinct sets of features of the plurality of point-of-interest data records, a graph data structure that includes the plurality of point-of-interest data records and a plurality of weighted feature relationships interconnecting the plurality of point-of-interest data records;

clustering, by the computing system based on the graph data structure, the plurality of point-of-interest data records into groups of point-of-interest data records, each group of point-of-interest data records including a different subset of the plurality of point-of-interest data records; and

generating, by the computing system, one or more merged point-of-interest data records based on the clustered groups of point-of-interest data records.

2. The method of claim 1 , further comprising providing, by the computing system, the one or more merged point-of-interest data records to a computer-implemented mapping system for use by the computer-implemented mapping system to indicate one or more points-of-interest on a user interface map of a geographic area.

3. The method of claim 1 , wherein the generating of the graph data structure comprises:

comparing the distinct sets of features of the plurality of point-of-interest data records to one another; and

generating the plurality of weighted feature relationships interconnecting the plurality of point-of-interest data records based on the comparing.

4. The method of claim 1 , wherein the clustering of the plurality of point-of-interest data records into the groups of point-of-interest data records comprises:

determining, based on the plurality of weighted feature relationships interconnecting the plurality of point-of-interest data records, strengths of relationships between the plurality of point-of-interest data records; and

defining the groups of point-of-interest data records based on the strengths of relationships between the plurality of point-of-interest data records.

5. The method of claim 1 , wherein the distinct set of features for a point-of-interest data record of the plurality of point-of-interest data records comprises at least two of:

a point-of-interest name;

a point-of-interest phone number;

a point-of-interest website;

a point-of-interest email address;

a point-of-interest street address; and

a point-of-interest category.

6. The method of claim 1 , wherein the feature on which the batching is based comprises at least one of a point-of-interest name and a point-of-interest geographic location.

7. The method of claim 6 , wherein the point-of-interest geographic location comprises at least one of a point-of-interest street address and a point-of-interest postal code.

8. The method of claim 1 , wherein the generating of the graph data structure based on the plurality of point-of-interest data records comprises associating a tag with each weighted feature relationship of the plurality of weighted feature relationships, the tag indicating the feature based upon which the plurality of point-of-interest data records are batched.

9. A system comprising:

a memory storing instructions;

a processor communicatively coupled to the memory and configured to execute the instructions to:

access a plurality of point-of-interest datasets from different sources;

batch, from the plurality of point-of-interest datasets from different sources, a plurality of point-of-interest data records together based on similarity between a feature included in distinct sets of features of the plurality of point-of-interest data records, each of the plurality of point-of-interest data records including data representative of a distinct set of features for a distinct point-of-interest;

generate, based on the distinct sets of features of the plurality of point-of-interest data records, a graph data structure that includes the plurality of point-of-interest data records and a plurality of weighted feature relationships interconnecting the plurality of point-of-interest data records;

cluster, based on the graph data structure, the plurality of point-of-interest data records into groups of point-of-interest data records, each group of point-of-interest data records including a different subset of the plurality of point-of-interest data records; and

generate one or more merged point-of-interest data records based on the clustered groups of point-of-interest data records.

10. The system of claim 9 , wherein the processor is further configured to execute the instructions to provide the one or more merged point-of-interest data records to a computer-implemented mapping system for use by the computer-implemented mapping system to indicate one or more points-of-interest on a user interface map of a geographic area.

11. The system of claim 9 , wherein the generating of the graph data structure comprises:

comparing the distinct sets of features of the plurality of point-of-interest data records to one another; and

generating the plurality of weighted feature relationships interconnecting the plurality of point-of-interest data records based on the comparing.

12. The system of claim 9 , wherein the clustering of the plurality of point-of-interest data records into the groups of point-of-interest data records comprises:

determining, based on the plurality of weighted feature relationships interconnecting the plurality of point-of-interest data records, strengths of relationships between the plurality of point-of-interest data records; and

defining the groups of point-of-interest data records based on the strengths of relationships between the plurality of point-of-interest data records.

13. The system of claim 9 , wherein the generating of the graph data structure based on the plurality of point-of-interest data records comprises associating a tag with each weighted feature relationship of the plurality of weighted feature relationships, the tag indicating the feature based upon which the plurality of point-of-interest data records are batched.

14. A non-transitory computer-readable medium storing instructions that, when executed, direct at least one processor of a computing device to:

access a plurality of point-of-interest datasets from different sources;

batch, from the plurality of point-of-interest datasets from different sources, a plurality of point-of-interest data records together based on similarity between a feature included in distinct sets of features of the plurality of point-of-interest data records, each of the plurality of point-of-interest data records including data representative of a distinct set of features for a distinct point-of-interest;

generate, based on the distinct sets of features of the plurality of point-of-interest data records, a graph data structure that includes the plurality of point-of-interest data records and a plurality of weighted feature relationships interconnecting the plurality of point-of-interest data records;

cluster, based on the graph data structure, the plurality of point-of-interest data records into groups of point-of-interest data records, each group of point-of-interest data records including a different subset of the plurality of point-of-interest data records; and

generate one or more merged point-of-interest data records based on the clustered groups of point-of-interest data records.

15. The computer-readable medium of claim 14 , the computer-readable medium further storing instructions that, when executed, further direct the at least one processor of the computing device to provide the one or more merged point-of-interest data records to a computer-implemented mapping system for use by the computer-implemented mapping system to indicate one or more points-of-interest on a user interface map of a geographic area.

16. The computer-readable medium of claim 14 , wherein the generating of the graph data structure comprises:

comparing the distinct sets of features of the plurality of point-of-interest data records to one another; and

generating the plurality of weighted feature relationships interconnecting the plurality of point-of-interest data records based on the comparing.

17. The computer-readable medium of claim 14 , wherein the clustering of the plurality of point-of-interest data records into the groups of point-of-interest data records comprises:

determining, based on the plurality of weighted feature relationships interconnecting the plurality of point-of-interest data records, strengths of relationships between the plurality of point-of-interest data records; and

defining the groups of point-of-interest data records based on the strengths of relationships between the plurality of point-of-interest data records.

18. The method of claim 1 , further comprising providing, by the computer-implemented mapping system and based on the merged point-of-interest data records, the user interface map of the geographic area, the user interface map indicating the one or more points-of-interest at one or more locations within the geographic area.

19. The method of claim 1 , wherein the one or more points-of-interest comprise one or more businesses.

20. The method of claim 1 , wherein the one or more points-of-interest comprise one or more places of transit.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 26, 2019
From: BOYER, WESLEY; KAC, ALEKSEI MAXIMILLIAN; ROMANAK, MARK; BAKER, THOMAS M., JR.; MCKAY, JEREMY; BARNES, JARED DAVID; GUILIANI, ROSSI
To: VERIZON PATENT AND LICENSING INC.
Reel/Frame 049009/0637 →
Continuity (1)
Related Publication 20200342026A1 · Oct 29, 2020