[
https://issues.apache.org/jira/browse/SPARK-5832?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14329284#comment-14329284
]
Liang-Chi Hsieh commented on SPARK-5832:
----------------------------------------
The time complexity O(nnz * K) is just for sparse directed graph and in the
graph every pair of distinct vertices is only connected by a unique edge. So it
has constraint. If the directed graph is sparse, but every pair of distinct
vertices is still connected by a pair of unique edges, the time complexity is
O(nnz^2 * K).
> Add Affinity Propagation clustering algorithm
> ---------------------------------------------
>
> Key: SPARK-5832
> URL: https://issues.apache.org/jira/browse/SPARK-5832
> Project: Spark
> Issue Type: New Feature
> Components: MLlib
> Reporter: Liang-Chi Hsieh
> Assignee: Liang-Chi Hsieh
>
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
---------------------------------------------------------------------
To unsubscribe, e-mail: issues-unsubscr...@spark.apache.org
For additional commands, e-mail: issues-h...@spark.apache.org
