[
https://issues.apache.org/jira/browse/FLINK-2254?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15681106#comment-15681106
]
Ivan Mushketyk commented on FLINK-2254:
---------------------------------------
Regarding the metrics that we need for the bipartite graph. I read the paper
mentioned in this JIRA issue and here is a list of metrics that I think should
be implemented for bipartite graph:
* Number of top nodes
* Number of bottom nodes
* Number of links
* Top average degree
* Bottom average degree
* Average degree
* Clustering coefficient
* Maximum top degree
* Maximum bottom degree
Are there any other metrics that should be implemented?
The white paper in this JIRA issue provides multiple ways to calculate
clustering coefficient. Should we implement all of them?
> Add Bipartite Graph Support for Gelly
> -------------------------------------
>
> Key: FLINK-2254
> URL: https://issues.apache.org/jira/browse/FLINK-2254
> Project: Flink
> Issue Type: New Feature
> Components: Gelly
> Affects Versions: 0.10.0
> Reporter: Andra Lungu
> Assignee: Ivan Mushketyk
> Labels: requires-design-doc
>
> A bipartite graph is a graph for which the set of vertices can be divided
> into two disjoint sets such that each edge having a source vertex in the
> first set, will have a target vertex in the second set. We would like to
> support efficient operations for this type of graphs along with a set of
> metrics(http://jponnela.com/web_documents/twomode.pdf).
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
