Graph Analytics, Pagerank, Spectral Clustering, Machine Learning, AI.
node is a patient and every edge is a similarity between two nodes (two patients). Once we have this graph representation we can store this efficiently using a matrix. Similar to what we described in page ranks we could use the same adjacency matrix representation Second step is to find the top k