Decision tree learning in Neo4j on homogeneous and unconnected graph nodes from biological and clinical datasets

Table 3 Computational complexity analysis

Computational complexity	Time	Space
Train complexity	O(dim*nlogn)	O(n)
Test complexity	O(depth)	O(n)

n = number of instances/nodes dim = number of dimensions/variables depth = depth of generated decision tree

ISSN: 1472-6947