(a) Using the MDL principle, compress graph G2 in Figure 11.23 using the best one edge, two vertex substructure. Find the best one edge, two vertex substructure, and compress the resulting graph again...

(a) Using the MDL principle, compress graph G2 in Figure 11.23 using the best one edge, two vertex substructure. Find the best one edge, two vertex substructure, and compress the resulting graph again to find the minimal graph representation. The frequency of the best substructure should be greater than one in both cases.

(b) What is the description length of the new graph in terms of the number of vertices? Compare this result with the original number of vertices.

(c) Using the definition that anomalies are occurrences different from the usual data, which nodes are anomalous in graph G2?

Figure 11.23