Brussels, Belgium Belgium
Dec. 10, 2012 to Dec. 10, 2012
Methods for the analysis of network data can be divided into two approaches, there are structural pattern recognition methods that act directly upon the relational data and alternatively the application of well studied standard statistical techniques which first require a transformation of the data to a vector representation. There are a number of methods available for the comparison of networks within the structural field, for example Frequent Sub graph Mining can beused to classify a collection of graphs into classes and spectral decomposition allows for anomaly detection. In this paper we detour from the standard structural methods and instead propose a novel combination of network embedding and Canonical Correlation Analysis(CCA) that allows comparison of coherent networks. We construct a test based on CCA that allows us to detect statistically significant differences between two graphs. This methodis demonstrated on a number of simulated networks and also on the VAST Challenge 2008 cell phone call records data. These experiments suggest that the method is well suited for comparing networks of different types and hence is a new unsupervised method for graph comparison that does not look for specific changes in any one feature of a graph.
Approximation methods, Gaussian distribution, Correlation, Vectors, Mathematical model, Computational modeling, Probabilistic logic, Canonical Correlation Analysis, network embedding, change detection
Aidan OSullivan, Niall M. Adams, Iead Rezek, "Canonical Correlation Analysis for Detecting Changes in Network Structure", ICDMW, 2012, 2013 IEEE 13th International Conference on Data Mining Workshops, 2013 IEEE 13th International Conference on Data Mining Workshops 2012, pp. 250-257, doi:10.1109/ICDMW.2012.143