Determining a location and area of a place based on distances between the first mean and check in locations
First Claim
Patent Images
1. A method comprising, by one or more computing devices:
- accessing a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between them, the nodes comprising;
a plurality of user nodes corresponding to a plurality of users of an online social network; and
a plurality of concept nodes corresponding to a plurality of places;
accessing geographic location data for a plurality of check-in locations associated with a place, wherein each of the check-in locations corresponds to an edge of the social graph corresponding to a check-in activity between a user node of a user and a concept node of the place;
calculating a first mean of the plurality of check-in locations;
selecting a subset of the check-in locations based on distances between the first mean and the check-in locations; and
determining a central location and at least a portion of a perimeter of the place based on the subset of the check-in locations.
2 Assignments
0 Petitions
Accused Products
Abstract
In one embodiment, a method includes calculating a first mean of check-in locations associated with a place; selecting a subset of the check-in locations based on distances between the first mean and the check-in locations; and determining a central location and at least a portion of a perimeter of the place based on the subset of the check-in locations.
49 Citations
23 Claims
-
1. A method comprising, by one or more computing devices:
-
accessing a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between them, the nodes comprising; a plurality of user nodes corresponding to a plurality of users of an online social network; and a plurality of concept nodes corresponding to a plurality of places; accessing geographic location data for a plurality of check-in locations associated with a place, wherein each of the check-in locations corresponds to an edge of the social graph corresponding to a check-in activity between a user node of a user and a concept node of the place; calculating a first mean of the plurality of check-in locations; selecting a subset of the check-in locations based on distances between the first mean and the check-in locations; and determining a central location and at least a portion of a perimeter of the place based on the subset of the check-in locations. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. One or more computer-readable non-transitory storage media embodying software that is operable when executed to:
-
access a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between them, the nodes comprising; a plurality of user nodes corresponding to a plurality of users of an online social network; and a plurality of concept nodes corresponding to a plurality of places; access geographic location data for a plurality of check-in locations associated with a place, wherein each of the check-in locations corresponds to an edge of the social graph corresponding to a check-in activity between a user node of a user and a concept node of the place; calculate a first mean of the plurality of check-in locations; select a subset of the check-in locations based on distances between the first mean and the check-in locations; and determine a central location and at least a portion of a perimeter of the place based on the subset of the check-in locations. - View Dependent Claims (11, 12, 13, 14, 15, 16, 17, 18)
-
-
19. An apparatus comprising:
-
one or more processors; and one or more computer-readable non-transitory storage media embodying instructions operable, when executed by the processors, to cause the processors to; access a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between them, the nodes comprising; a plurality of user nodes corresponding to a plurality of users of an online social network; and a plurality of concept nodes corresponding to a plurality of places; access geographic location data for a plurality of check-in locations associated with a place, wherein each of the check-in locations corresponds to an edge of the social graph corresponding to a check-in activity between a user node of a user and a concept node of the place; calculate a first mean of the plurality of check-in locations; select a subset of the check-in locations based on distances between the first mean and the check-in locations; and determine a central location and at least a portion of a perimeter of the place based on the subset of the check-in locations. - View Dependent Claims (20, 21, 22, 23)
-
Specification