Hi, Time complexity Similarity algorithms has time complexity O(n3) and space complexity O(n2). neo4j is a graph database and all the nodes are connected other nodes with respect to their relationship. Basically I wanted to build a content based movies recommender systems. content based RS is only dependent on user personalised content and his history. I had created a movie graph database in neo4j and i had two possibilities one is recommend 1st, 2nd connectioned movie nodes that the user watched movies or another solution is to use any node similarity like jaccard. I'm little bit confused why we need node similarity in the first place when all the nodes are connected to each other, i mean we can use some constraints to return the closest node data right?
# node-similarity
