add description

neo4j-documentation · Jul 28, 2020 · b3d85f4 · b3d85f4
1 parent a40456c
commit b3d85f4
Show file tree

Hide file tree

Showing 6 changed files with 6 additions and 0 deletions.
diff --git a/...e/community-detection-algorithms/community-detection-algorithms-key-topics.adoc b/...e/community-detection-algorithms/community-detection-algorithms-key-topics.adoc
@@ -11,6 +11,7 @@
 :author: Mark Needham
 :category: graph-data-science
 :tags: graph-data-science, graph-algorithms, community-detection, clustering
+:description: This guide covers community detection algorithms in the Neo4j Data Science Library, like Louvain, Label Propagation, Weakly Connected Components, and more.
 
 .Goals
 [abstract]

diff --git a/graph-data-science/graph-embeddings/graph-embeddings-key-topic.adoc b/graph-data-science/graph-embeddings/graph-embeddings-key-topic.adoc
@@ -11,6 +11,7 @@
 :author: Mark Needham
 :category: graph-data-science
 :tags: graph-data-science, graph-algorithms, graph-embeddings, machine-learning
+:description: This guide covers graph embeddings in the Neo4j Data Science Library, like node2Vec, GraphSAGE, and Random Projection.
 
 .Goals
 [abstract]

diff --git a/graph-data-science/graph-embeddings/graph-embeddings-tutorial.adoc b/graph-data-science/graph-embeddings/graph-embeddings-tutorial.adoc
@@ -12,6 +12,7 @@
 :category: graph-data-science
 :tags: graph-data-science, graph-algorithms, graph-embeddings, machine-learning
 :gds-version: 1.3-preview
+:description: This guide provides a hands on walk through of the node2Vec graph embedding algorithm in the Neo4j Data Science Library.
 
 ++++
 <script src="https://cdn.jsdelivr.net/npm/vega@5"></script>

diff --git a/graph-data-science/graph-search-algorithms/graph-search-algorithms-key-topic.adoc b/graph-data-science/graph-search-algorithms/graph-search-algorithms-key-topic.adoc
@@ -11,6 +11,7 @@
 :author: Mark Needham
 :category: graph-data-science
 :tags: graph-data-science, graph-algorithms, graph-search, bfs, dfs
+:description: This guide covers the graph search algorithms in the Neo4j Data Science Library, Breadth First Search (BFS) and Depth First Search (DFS).
 
 .Goals
 [abstract]

diff --git a/graph-data-science/nlp/neo4j-nlp.adoc b/graph-data-science/nlp/neo4j-nlp.adoc
@@ -11,6 +11,7 @@
 :author: Mark Needham
 :category: graph-data-science
 :tags: graph-platform, nlp, tools, similarity, apoc, graphaware, analytics, search, recommendations, labs
+:description: This guide explains the available tools for doing Natural Language Processing (NLP) with Neo4j.
 
 Neo4j offers powerful querying capabilities for structured data, but a lot of the world's data exists in text documents.
 NLP techniques can help to extract the latent structure in these documents.

diff --git a/graph-data-science/path-finding-algorithms/path-finding-algorithms-key-topic.adoc b/graph-data-science/path-finding-algorithms/path-finding-algorithms-key-topic.adoc
@@ -11,6 +11,7 @@
 :author: Mark Needham
 :category: graph-data-science
 :tags: graph-data-science, graph-algorithms, graph-search, path-finding, shortest-path
+:description: This guide covers path finding algorithms in the Neo4j Data Science Library, like Shortest Path, A*, All-Pairs Shortest Path, and more.
 
 .Goals
 [abstract]