Identification of real-best-pages on online social networks

One or more computer-readable non-transitory storage media embodying software that is operable when executed to:

• access a first place-entity cluster of a redirection graph, wherein the first place-entity cluster comprises a plurality of place-entity nodes, and wherein the plurality of place-entity nodes comprises an initial canonical place-entity node for the cluster, each other place-entity node of the first place-entity cluster being connected to the initial canonical place-entity node by a redirection edge;
• calculate, for each place-entity node in the first place-entity cluster of the redirection graph, a cluster-score for the place-entity node, wherein the cluster-score indicates a quality of the place-entity node with respect to the first place-entity cluster;
• identify one or more place-entity nodes having a cluster-score greater than a threshold cluster-score;
• receive a selection of one of the identified place-entity nodes as a replacement canonical place-entity node for the first place-entity cluster, wherein the replacement canonical place-entity node is different from the initial canonical place-entity node;
• and
• in response to the selection of the replacement canonical place-entity node that is different from the initial canonical place-entity node, update the first place-entity cluster by redefining the first place-entity cluster to:
• add at least one additional place-entity node of the redirection graph, wherein each added place-entity node has a duplication-value with respect to the replacement canonical place-entity node that is greater than a threshold duplication-value;
• or
• remove at least one place-entity node from the first place-entity cluster, wherein each removed place-entity node has a duplication-value with respect to the replacement canonical place-entity node that is less than or equal to the threshold duplication-value.

A system comprising:

• one or more processors;
• and a memory coupled to the processors comprising instructions executable by the processors, the processors operable when executing the instructions to:
• access a first place-entity cluster of a redirection graph, wherein the first place-entity cluster comprises a plurality of place-entity nodes, and wherein the plurality of place-entity nodes comprises an initial canonical place-entity node for the cluster, each other place-entity node of the first place-entity cluster being connected to the initial canonical place-entity node by a redirection edge;
• calculate, for each place-entity node in the first place-entity cluster of the redirection graph, a cluster-score for the place-entity node, wherein the cluster-score indicates a quality of the place-entity node with respect to the first place-entity cluster;
• identify one or more place-entity nodes having a cluster-score greater than a threshold cluster-score;
• receive a selection of one of the identified place-entity nodes as a replacement canonical place-entity node for the first place-entity cluster, wherein the replacement canonical place-entity node is different from the initial canonical place-entity node;
• and
• in response to the selection of the replacement canonical place-entity node that is different from the initial canonical place-entity node, update the first place-entity cluster by redefining the first place-entity cluster to:
• add at least one additional place-entity node of the redirection graph, wherein each added place-entity node has a duplication-value with respect to the replacement canonical place-entity node that is greater than a threshold duplication-value;
• or
• remove at least one place-entity node from the first place-entity cluster, wherein each removed place-entity node has a duplication-value with respect to the replacement canonical place-entity node that is less than or equal to the threshold duplication-value.