Abstract: In one embodiment, a method includes identifying one or more place-entity nodes in a heterogeneous graph, wherein the heterogenous graph comprises place-entity nodes, user nodes, and n-gram nodes, and wherein each place-entity node corresponds to a place-entity associated with a particular geographic location, assigning, for each identified place-entity node, an initial quality-score for the place-entity node, and calculating, for each identified place-entity node, a final quality-score for the identified place-entity node, wherein each final quality-score is calculated by iteratively propagating the initial quality-scores corresponding to the identified place-entity nodes, respectively, through the place-entity nodes, n-gram nodes, and user nodes of the heterogeneous graph until the quality-scores associated with the place-entity nodes, n-gram nodes, and user nodes reach convergence.

Abstract: In one embodiment, a method includes identifying one or more place-entity nodes in a heterogeneous graph, wherein the heterogenous graph comprises place-entity nodes, user nodes, and n-gram nodes, and wherein each place-entity node corresponds to a place-entity associated with a particular geographic location, assigning, for each identified place-entity node, an initial quality-score for the place-entity node, and calculating, for each identified place-entity node, a final quality-score for the identified place-entity node, wherein each final quality-score is calculated by iteratively propagating the initial quality-scores corresponding to the identified place-entity nodes, respectively, through the place-entity nodes, n-gram nodes, and user nodes of the heterogeneous graph until the quality-scores associated with the place-entity nodes, n-gram nodes, and user nodes reach convergence.

Abstract: In one embodiment, an online social network accesses a social graph that includes a number of place-entity nodes each corresponding to a place-entity, and a number of user nodes each corresponding to a user. A heterogeneous graph is generated based on the place-entity nodes, user nodes, and n-gram nodes, each n-gram node corresponding to an n-gram in the name of at least one place-entity. Each n-gram node is connected to corresponding place-entity nodes containing the n-gram, and user nodes with a social networking interaction with the corresponding place-entity nodes. Each place-entity node is assigned an initial quality-score. The quality-scores are propagated through the redirection graph based on the connections between the place-entity nodes, the n-gram nodes, and the user nodes. A final quality-score is assigned to each place-entity node when the propagation of the quality-scores through the redirection graph reaches convergence.

Abstract: In one embodiment, an online social network accesses a social graph that includes a number of place-entity nodes each corresponding to a place-entity, and a number of user nodes each corresponding to a user. A heterogeneous graph is generated based on the place-entity nodes, user nodes, and n-gram nodes, each n-gram node corresponding to an n-gram in the name of at least one place-entity. Each n-gram node is connected to corresponding place-entity nodes containing the n-gram, and user nodes with a social networking interaction with the corresponding place-entity nodes. Each place-entity node is assigned an initial quality-score. The quality-scores are propagated through the redirection graph based on the connections between the place-entity nodes, the n-gram nodes, and the user nodes. A final quality-score is assigned to each place-entity node when the propagation of the quality-scores through the redirection graph reaches convergence.