You are viewing a plain text version of this content. The canonical link for it is here.

Posted to issues@flink.apache.org by "Greg Hogan (JIRA)" <ji...@apache.org> on 2016/05/11 14:03:12 UTC

[jira] [Created] (FLINK-3898) Adamic-Adar Similarity

Greg Hogan created FLINK-3898:
---------------------------------

             Summary: Adamic-Adar Similarity
                 Key: FLINK-3898
                 URL: https://issues.apache.org/jira/browse/FLINK-3898
             Project: Flink
          Issue Type: New Feature
          Components: Gelly
    Affects Versions: 1.1.0
            Reporter: Greg Hogan
            Assignee: Greg Hogan


The implementation of Adamic-Adar Similarity [0] is very close to Jaccard Similarity. Whereas Jaccard Similarity counts common neighbors, Adamic-Adar Similarity sums the inverse logarithm of the degree of common neighbors.

Consideration will be given to the computation of the inverse logarithm, in particular whether to pre-compute a small array of values.

[0] http://social.cs.uiuc.edu/class/cs591kgk/friendsadamic.pdf



--
This message was sent by Atlassian JIRA
(v6.3.4#6332)