Explainable subgraphs with surprising densities : a subgroup discovery approach

The connectivity structure of graphs is typically related to the attributes of the nodes. In social networks for example, the probability of a friendship between any pair of people depends on a range of attributes, such as their age, residence location, workplace, and hobbies. The high-level structure of a graph can thus possibly be described well by means of patterns of the form `the subgroup of all individuals with a certain properties X are often (or rarely) friends with individuals in another subgroup defined by properties Y', in comparison to what is expected. Such rules present potentially actionable and generalizable insight into the graph. We present a method that finds node subgroup pairs between which the edge density is interestingly high or low, using an information-theoretic definition of interestingness. Additionally, the interestingness is quantified subjectively, to contrast with prior information an analyst may have about the connectivity. This view immediatly enables iterative mining of such patterns. This is the first method aimed at graph connectivity relations between different subgroups. Our method generalizes prior work on dense subgraphs induced by a subgroup description. Although this setting has been studied already, we demonstrate for this special case considerable practical advantages of our subjective interestingness measure with respect to a wide range of (objective) interestingness measures

A fractal fragmentation model for rockfalls

The final publication is available at Springer via http://dx.doi.org/10.1007/s10346-016-0773-8The impact-induced rock mass fragmentation in a rockfall is analyzed by comparing the in situ block size distribution (IBSD) of the rock mass detached from the cliff face and the resultant rockfall block size distribution (RBSD) of the rockfall fragments on the slope. The analysis of several inventoried rockfall events suggests that the volumes of the rockfall fragments can be characterized by a power law distribution. We propose the application of a three-parameter rockfall fractal fragmentation model (RFFM) for the transformation of the IBSD into the RBSD. A discrete fracture network model is used to simulate the discontinuity pattern of the detached rock mass and to generate the IBSD. Each block of the IBSD of the detached rock mass is an initiator. A survival rate is included to express the proportion of the unbroken blocks after the impact on the ground surface. The model was calibrated using the volume distribution of a rockfall event in Vilanova de Banat in the Cadí Sierra, Eastern Pyrenees, Spain. The RBSD was obtained directly in the field, by measuring the rock block fragments deposited on the slope. The IBSD and the RBSD were fitted by exponential and power law functions, respectively. The results show that the proposed fractal model can successfully generate the RBSD from the IBSD and indicate the model parameter values for the case study.Peer ReviewedPostprint (author's final draft

A Survey on Graph Kernels

Graph kernels have become an established and widely-used technique for solving classification tasks on graphs. This survey gives a comprehensive overview of techniques for kernel-based graph classification developed in the past 15 years. We describe and categorize graph kernels based on properties inherent to their design, such as the nature of their extracted graph features, their method of computation and their applicability to problems in practice. In an extensive experimental evaluation, we study the classification accuracy of a large suite of graph kernels on established benchmarks as well as new datasets. We compare the performance of popular kernels with several baseline methods and study the effect of applying a Gaussian RBF kernel to the metric induced by a graph kernel. In doing so, we find that simple baselines become competitive after this transformation on some datasets. Moreover, we study the extent to which existing graph kernels agree in their predictions (and prediction errors) and obtain a data-driven categorization of kernels as result. Finally, based on our experimental results, we derive a practitioner's guide to kernel-based graph classification

VoG: Summarizing and Understanding Large Graphs

How can we succinctly describe a million-node graph with a few simple sentences? How can we measure the "importance" of a set of discovered subgraphs in a large graph? These are exactly the problems we focus on. Our main ideas are to construct a "vocabulary" of subgraph-types that often occur in real graphs (e.g., stars, cliques, chains), and from a set of subgraphs, find the most succinct description of a graph in terms of this vocabulary. We measure success in a well-founded way by means of the Minimum Description Length (MDL) principle: a subgraph is included in the summary if it decreases the total description length of the graph. Our contributions are three-fold: (a) formulation: we provide a principled encoding scheme to choose vocabulary subgraphs; (b) algorithm: we develop \method, an efficient method to minimize the description cost, and (c) applicability: we report experimental results on multi-million-edge real graphs, including Flickr and the Notre Dame web graph.Comment: SIAM International Conference on Data Mining (SDM) 201