A Complexity analysis Most demanding component of Algorithm 1 is the iterative message passing over the edges (lines 10-14), with time complexity O(ml 2 r), where m = |E| is the number of edges in the connotation graph, l = |L|, the classes, and r, the iterations until convergence.
often, l is quite small (in our case, l = 2) and r m. running time grows linearly with the number of edges and is scalable to large datasets.