Graph Neural Net Intro

– Information about the non euclidean space incorporated – 2D conversion of image as input vs 3D image as input – Ideas about no connectivity in cases of pixels – Atoms, molecules, SMILE notation, what it leaves behind is the actual structural information – Nodes, edges, labels, attributes, rule(function that gives another node from one node) – Static and dynamic graphs will have different ways – Graph embedding: process of representing graphs vectorically with lower dimensions with as low information loss as possible – Adjacency Matrix are mostly used. – Laplcian matrix = Degree - adjacency matrix – Generally all three types of matrices are used in many of the approaches. – Degree Matrix are diagonal matrices with the value of degree along the diagonal. – In case of undirected graphs, the no of connections is the degree. – In case of directed graphs, degree is either out degree or in degree – In case of weighted graphs, it is the sum of weights on all nodes – Node level, Sub graph level embeddings