Patent Document ID: 9367629
Application ID: 14258989

Base Claim:
1. A method comprising, by a computing device: 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 first node corresponding to a first user associated with an online social network; and a plurality of second nodes that each correspond to a concept or a second user associated with the online social network; generating a plurality of cards, each card comprising a suggested query referencing a query-domain associated with the online social network and zero or more query-filters for the query-domain, wherein each query-filter references one or more nodes of the plurality of nodes or one or more edges of the plurality of edges; calculating a card-affinity for each card of the plurality of cards with respect to the other cards of the plurality of cards; generating one or more card clusters from the plurality of cards, each card cluster comprising one or more cards that each have a card-affinity with respect to the other cards in the card cluster that is greater than a threshold card-affinity; and sending one or more card clusters to the first user for display on a page currently accessed by the first user.

---

Claim 4:
4. The method of claim 1 , further comprising modifying the order of one or more subsequent cards of the card cluster based on actions of the first user with respect to one or more previously displayed cards.