[WIP] Adding new sections (#699)

* [WIP] Adding preprocessing section

* add similarity section

* similarity section

* add to index

* add similarity to top

* add cosine

* add euclidean

Author: mneedham

doc/asciidoc/index.adoc

@@ -21,6 +21,7 @@ The guide covers the following areas:
 * <<algorithms-centrality>> -- A detailed guide to each of the centrality algorithms, including use-cases and examples.
 * <<algorithms-community>> -- A detailed guide to each of the community detection algorithms, including use-cases and examples.
 * <<algorithms-path-finding>> -- A detailed guide to each of the path finding algorithms, including use-cases and examples.
+* <<algorithms-similarity>> -- A detailed guide to each of the similarity algorithms, including use-cases and examples.
 
 [[introduction]]
 == Introduction
@@ -62,6 +63,8 @@ include::../../target/generated-documentation/documentation.csv[]
 include::algorithms-centrality.adoc[leveloffset=1]
 include::algorithms-community.adoc[leveloffset=1]
 include::algorithms-path-finding.adoc[leveloffset=1]
+include::algorithms-preprocessing.adoc[leveloffset=1]
+include::algorithms-similarity.adoc[leveloffset=1]
 
 ifndef::env-docs[]
 == Implementers section

readme.adoc

@@ -62,6 +62,20 @@ These algorithms help find the shortest path or evaluate the availability and qu
 * <<algorithms-yens-k-shortest-path, Yen’s K-shortest paths>> (`algo.kShortestPaths`)
 * <<algorithms-random-walk, Random Walk>> (`algo.randomWalk`)
 
+=== Similarity
+
+These algorithms help calculate the similarity of nodes:
+
+* <<algorithms-similarity-jaccard, Jaccard Similarity>> (`algo.similarity.jaccard`)
+* <<algorithms-similarity-cosine, Cosine Similarity>> (`algo.similarity.cosine`)
+* <<algorithms-similarity-euclidean, Euclidean Distance>> (`algo.similarity.euclidean`)
+
+=== Preprocessing
+
+These are utility functions and procedures that transform data for use further along the data pipeline:
+
+** <<algorithms-one-hot-encoding, One Hot Encoding>> (`algo.ml.oneHotEncoding`)
+
 // end::algorithms[]
 
 These procedures work either on the whole graph, or on a subgraph filtered by label and relationship-type.