发明名称 Scoring User Characteristics
摘要 In one embodiment, one or more computing devices access a social graph including nodes and edges between nodes; the nodes include user nodes corresponding to users of a social-networking system and concept nodes corresponding to concepts of the social-networking system; the computing devices identify first user nodes in the social graph corresponding to users having a particular user characteristic; the computing devices assign a characteristic score to each first user node; for a second user node without an assigned characteristic score, the computing devices also select neighboring user nodes connecting to the second user node based on affinity, and estimate a characteristic score for the second user node by aggregating iteratively characteristic scores while traversing the social graph from at least one first user node to the second user node through paths that each includes at least one selected neighboring node.
申请公布号 US2014297740(A1) 申请公布日期 2014.10.02
申请号 US201313851847 申请日期 2013.03.27
申请人 Narayanan Chandrasekher;Srinivasan Sundhar Ram;Hoon Jeremy;Liao Yihua;Ledvina Andrew Fabian 发明人 Narayanan Chandrasekher;Srinivasan Sundhar Ram;Hoon Jeremy;Liao Yihua;Ledvina Andrew Fabian
分类号 H04L29/08 主分类号 H04L29/08
代理机构 代理人
主权项 1. A method comprising: by one or more computing devices, accessing a social graph comprising a plurality of nodes and a plurality of edges between nodes, the nodes comprising user nodes corresponding to users of a social-networking system and concept nodes corresponding to concepts of the social-networking system; by one or more computing devices, identifying one or more first user nodes corresponding to users having a particular user characteristic; by one or more computing devices, assigning to each first user node a characteristic score; and by one or more computing devices, for at least a second user node without an assigned characteristic score: selecting one or more neighboring user nodes connecting to the second user node based at least in part on affinity between each selected neighboring user node and the second user node; andestimating a characteristic score for the second user node by aggregating iteratively characteristic scores while traversing the social graph from at least one of the first user nodes to the second user node, the at least one first user node being one or more hops away from the second user node, the traversing comprising one or more paths each comprising at least one of the selected neighboring user nodes.
地址 Fremont CA US