[ 
https://issues.apache.org/jira/browse/MADLIB-1121?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
 ]

Frank McQuillan updated MADLIB-1121:
------------------------------------
    Description: 
Follow on from  https://issues.apache.org/jira/browse/MADLIB-1072. Given that 
this story is complete, what measures can we compute from APSP?

Betweenness may use APSP result set, or implement as a separate algorithm, 
e.g., [1].

References

[1] A Faster Algorithm for Betweenness Centrality
http://www.algo.uni-konstanz.de/publications/b-fabc-01.pdf
(used in Gephi)

[2] Network properties
https://en.wikipedia.org/wiki/Network_science#Network_properties


  was:
Follow on from  https://issues.apache.org/jira/browse/MADLIB-1072. Given that 
this story is complete, what measures can we compute from APSP?

Story

As a MADlib developer, I want to implement the following measures:

1 Betweenness (possibly use APSP)
2 Closeness (uses APSP)
3 Eigenvector centrality
4 Graph diameter  (uses APSP)
5 HITS  
6 Average path length   
7 In/out degrees
8 Clustering coefficient  (uses triangle/triplet counting)

Acceptance

1) Interface defined
2) Design document updated
3) Documentation and on-line help
4) IC and Tinc tests
5) Scale tests

References

[1] A Faster Algorithm for Betweenness Centrality
http://www.algo.uni-konstanz.de/publications/b-fabc-01.pdf
(used in Gephi)

[2] Network properties
https://en.wikipedia.org/wiki/Network_science#Network_properties



> Graph - Betweenness centrality
> ------------------------------
>
>                 Key: MADLIB-1121
>                 URL: https://issues.apache.org/jira/browse/MADLIB-1121
>             Project: Apache MADlib
>          Issue Type: New Feature
>          Components: Module: Graph
>            Reporter: Frank McQuillan
>             Fix For: v1.12
>
>
> Follow on from  https://issues.apache.org/jira/browse/MADLIB-1072. Given that 
> this story is complete, what measures can we compute from APSP?
> Betweenness may use APSP result set, or implement as a separate algorithm, 
> e.g., [1].
> References
> [1] A Faster Algorithm for Betweenness Centrality
> http://www.algo.uni-konstanz.de/publications/b-fabc-01.pdf
> (used in Gephi)
> [2] Network properties
> https://en.wikipedia.org/wiki/Network_science#Network_properties



--
This message was sent by Atlassian JIRA
(v6.4.14#64029)

Reply via email to