Dynamic ranking of user cards
Abstract:
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.
Information query
Patent Agency Ranking
0/0