Github user mengxr commented on the pull request:
https://github.com/apache/spark/pull/4254#issuecomment-71942958
For spectral clustering, the input should be pairwise distances, e.g.,
`RDD[(Long, Long, Double)]`. It could be converted into a Graph easily with
`fromEdgeRDD`. Besides, we can accept adjacency list `RDD[(Long, Vector)]` as
input. How to compute the distance is definitely not part of spectral
clustering and we should separate the implementation.
---
If your project is set up for it, you can reply to this email and have your
reply appear on GitHub as well. If your project does not have this feature
enabled and wishes so, or if the feature is enabled but not working, please
contact infrastructure at [email protected] or file a JIRA ticket
with INFRA.
---
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
