Graph Procedures Description

• createGraph(String dataPath,String distanceMeasure,Boolean IndexColumn,String graphType,String parameter )

• createGraphFromNodes(String label,String distanceMeasure,String graphType,String parameter )

distanceMeasure :

"euclideanDistance" "manhattanDistance" "canberraDistance" "cosineSimilarity" "jaccardCoefficient" "brayCurtisDistance"

graphType :

"ConnectedGraph" "EpsilonGraph" "knnGraph" "MutualKnnGraph"

IndexColumn: true / false

• true - if you have index column and if it is the first column
• false - else otherwise

parameter:

   - sigma value, an Integer, used for fully connected graph calculation (specify inside string "" in neo4j, will be later converted)
   - k nearest neighbor value, an integer used knn, mutual knn graph (specify inside string "" in neo4j, will be later converted)
   - epsilon value, a double, used for epsilon graph calculation

label: - the label is the name of the group of nodes already present inside neo4J