Facebook, Inc.

Timothy A Stanke

Samuel Wharton Lessin

Robert Michael Baldwin

Jeffrey Huang

Caitlin Rothrock Winner

Matthew Vincent Sain

Steven Jay Young

Aapo Kyrölä

Amir Hussain Memon

Scott J Bratsman

Joshua Chaim Roberts

In one embodiment, a method includes receiving, from a client system of a first user of an online social network, a request for a user-list, generating a structured query corresponding to the user-list, where the structured query is selected from a plurality of structured queries, and identifying one or more second users of the online social network that match the structured query and have a social connection or non-social connection with the first user. The social connection between the first user and the second user being based on social interactions on the online social network. The non-social connection between the first user and the second user being based on non-social interactions on a third-party application on the client system and being accessed by the online social network from the third-party application. The method includes sending, to the client system, instructions for displaying the user-list to the first user.

Implicit contacts in an online social network

In one embodiment, a method includes receiving, from a client system associated with a first user, a request to access a user-card interface. The method includes generating, in response to the request, multiple user-cards, each user-card being associated with a pre-selected query. Each user-card includes references to second users matching the pre-selected query associated with the user-card. The method includes calculating a user-card score for each user-card. The user-card score represents a relevance of the pre-selected query to the first user and a relevance of the second users referenced in the user-card to the first user. The relevance of each second user referenced in the user-card is based on an affinity coefficient of the first user with respect to the second user. The method includes sending, to the client system, instructions for presenting the user-card interface with user-cards in ranked order based on the user-card score associated with each user-card.

User-card interfaces

In one embodiment, a method includes receiving, from a client system of a first user of an online social network, a request for a user-list including one or more second users of the online social network. The method includes calculating, for each of the second users, a contact-score between the first user and the second user based on social interactions and non-social interactions between the users. The social interactions are interactions on the online social network visible to the first user based on privacy settings associated with the second user and the respective social interaction. The non-social interactions are interactions on a third-party application accessed by the online social network, shared based on a privacy setting associated with the third-party application. The method includes generating the user-list with references to second users having a contact-score above a threshold contact-score. The method includes providing instructions for displaying the user-list.

In one embodiment, a method includes identifying a first node and a second node in a social graph. The historical location data is available for the first node and for the second node. The method also includes accessing one or more component metrics for computing a geo-metric. The geo-metric represents an assessment of a spatial commonality between the first node and the second node. The spatial commonalities are determined based on historical location data stored for the first node and historical location data stored for the second node. The method also includes accessing one or more coefficients each corresponding to one of the component metrics; calculating the geo-metric by applying the received coefficients to the component metrics and combining the component metrics; and providing the calculated geo-metric.

Geo-metric

In one embodiment, a method includes accessing a social graph including a number of nodes and a number of edges connecting the nodes. Each of the edges between two of the nodes represent a single degree of separation between them. The nodes include a first node corresponding to a first user associated with an online social network and a number of second nodes that each correspond to a concept or a second user associated with the online social network. The method also includes generating a number of user-cards in response to a request by the first user for a list of second users. Each user-card is associated with a structured query referencing nodes or edges of the social graph. Each user-card contains references to a number of second users corresponding to one or more second nodes that match the structured query associated with the user-card.

Dynamic ranking of user cards

In one embodiment, a method includes accessing a social graph including a number of nodes and a number of edges connecting the nodes. Each of the edges between two of the nodes represent a single degree of separation between them. The nodes include a first node corresponding to a first user associated with an online social network and a number of second nodes that each correspond to a concept or a second user associated with the online social network. The method also includes generating a user-list containing references to a number of second users. A contact-score for each second user may be calculated based on interactions between the first user and second user on the online social network, or interactions not on the online social network but accessed by the online social network. A user-list is generated containing references to second users with contact-scores above a threshold contact-score.

Growing community of inventors

Los Gatos, CA, United States of America

Timothy A Stanke