Github user mengxr commented on a diff in the pull request:
https://github.com/apache/spark/pull/4254#discussion_r23876361
--- Diff: docs/mllib-clustering.md ---
@@ -34,6 +34,26 @@ a given dataset, the algorithm returns the best
clustering result).
* *initializationSteps* determines the number of steps in the k-means\|\|
algorithm.
* *epsilon* determines the distance threshold within which we consider
k-means to have converged.
+### Power Iteration Clustering
+
+Power iteration clustering is a scalable and efficient algorithm for
clustering points given pointwise mutual affinity values. Internally the
algorithm:
+
+* accepts a
[Graph](https://spark.apache.org/docs/0.9.2/api/graphx/index.html#org.apache.spark.graphx.Graph)
that represents a normalized pairwise affinity between all input points.
--- End diff --
Should use relative path "api/graphx/...". See examples in this markdown
file.
---
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]
