You are viewing a plain text version of this content. The canonical link for it is here.
Posted to issues@spark.apache.org by "Ankur Dave (JIRA)" <ji...@apache.org> on 2014/12/06 10:05:12 UTC

[jira] [Commented] (SPARK-4659) Implement K-core decomposition algorithm

    [ https://issues.apache.org/jira/browse/SPARK-4659?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14236695#comment-14236695 ] 

Ankur Dave commented on SPARK-4659:
-----------------------------------

Great! Submit it it as a PR when you get the chance. For reference, we also have an implementation here: https://github.com/ankurdave/spark/blob/vldb/graphx/src/main/scala/org/apache/spark/graphx/lib/KCoreFast.scala

> Implement K-core decomposition algorithm 
> -----------------------------------------
>
>                 Key: SPARK-4659
>                 URL: https://issues.apache.org/jira/browse/SPARK-4659
>             Project: Spark
>          Issue Type: New Feature
>          Components: Examples, GraphX
>    Affects Versions: 1.0.2
>            Reporter: Xiaoming Li
>
> I found that Graphx has no algorithm for *K-core/K-shell decomposition algorithm* yet.Based on the paper[http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=6189336],I have Implemented the k-core decomposition algorithm, which can be used for analyzing large scale complex networks.Compared with traditional K-core decomposition algorithm, it transfers the value of K-shell by messages, instead of restructuring the topology iteratively, to reduce the iteration times enormously.



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

---------------------------------------------------------------------
To unsubscribe, e-mail: issues-unsubscribe@spark.apache.org
For additional commands, e-mail: issues-help@spark.apache.org