[
https://issues.apache.org/jira/browse/TINKERPOP-1008?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
stephen mallette closed TINKERPOP-1008.
---------------------------------------
Resolution: Won't Do
Closing all the tutorial ideas - if we want to come back to these at some point
then we can re-open them.
> The Grateful Gremlin Dead Tutorial (Standard Graph Algorithms in Gremlin)
> -------------------------------------------------------------------------
>
> Key: TINKERPOP-1008
> URL: https://issues.apache.org/jira/browse/TINKERPOP-1008
> Project: TinkerPop
> Issue Type: Improvement
> Components: documentation
> Affects Versions: 3.1.0-incubating
> Reporter: Marko A. Rodriguez
> Priority: Major
>
> Like TINKERPOP3-1007, we need more tutorials. Russell Jurney recommended we
> do a "graph algorithms" with Gremlin tutorial. We can use the Grateful Dead
> data set as its deployed with Gremlin and is very "graphy" and thus,
> conducive to classical graph algorithms.
> In this tutorial the user learns how to do:
> * Path analysis
> ** Shortest path
> ** Cyclic paths
> ** {{path}} with {{by}}-projections.
> * Centrality -- "make a greatest hits album"
> ** Degree Centrality
> ** Eigenvector Centrality
> ** PageRank (using {{PageRankVertexProgram}}).
> * Community Detection -- "which songs group together?"
> ** Cliques
> ** Peer-pressure (using {{PeerPressureVertexProgram}}).
> * Assortative Mixing -- "birds of a feather flock together."
> ** Find a Java stats library and pull it in via {{:install}}.
> ** Pearson correlation, Spearman rank, Cramer's Chi, etc.
> ** My ACM presentation has all the examples we need.
> Get stuff from:
> http://www.slideshare.net/slidarko/acm-dbpl-keynote-the-graph-traversal-machine-and-language
> http://firstmonday.org/article/view/2273/2064
--
This message was sent by Atlassian JIRA
(v7.6.3#76005)
