Online summarization of dynamic graphs using subjective interestingness for sequential data

Many real-world phenomena can be represented as dynamic graphs, i.e., networks that change over time. The problem of dynamic graph summarization, i.e., to succinctly describe the evolution of a dynamic graph, has been widely studied. Existing methods typically use objective measures to find fixed structures such as cliques, stars, and cores. Most of the methods, however, do not consider the problem of online summarization, where the summary is incrementally conveyed to the analyst as the graph evolves, and (thus) do not take into account the knowledge of the analyst at a specific moment in time. We address this gap in the literature through a novel, generic framework for subjective interestingness for sequential data. Specifically, we iteratively identify atomic changes, called ‘actions’, that provide most information relative to the current knowledge of the analyst. For this, we introduce a novel information gain measure, which is motivated by the minimum description length (MDL) principle. With this measure, our approach discovers compact summaries without having to decide on the number of patterns. As such, we are the first to combine approaches for data mining based on subjective interestingness (using the maximum entropy principle) with pattern-based summarization (using the MDL principle). We instantiate this framework for dynamic graphs and dense subgraph patterns, and present DSSG, a heuristic algorithm for the online summarization of dynamic graphs by means of informative actions, each of which represents an interpretable change to the connectivity structure of the graph. The experiments on real-world data demonstrate that our approach effectively discovers informative summaries. We conclude with a case study on data from an airline network to show its potential for real-world applications.

Probabilistic logic reasoning for subjective interestingness analysis

This paper presents an approach that uses probabilistic logic reasoning to compute subjective interestingness scores for classification rules. In the proposed approach, domain knowledge is represented as a probabilistic logic program that encodes information from experts and statistical reports. The computation of interestingness scores is performed by a procedure that applies linear programming to reasoning regarding the probabilities of interest. It provides a mechanism to calculate probability-based subjective interestingness scores. Further, a sample application illustrates the use of the described approach.

Application of Apriori Algorithm in Diagnosis of Stroke

To apply Apriori algorithm to analysis on association of stroke and hemorheology, and obtain the meaningful medical information. A large number of hemorheology data of patients with stroke were collected, including whole blood viscosity low cut, whole blood viscosity medium cut, whole blood viscosity high cut, blood sedimentation, hematocrit, plasma viscosity, thrombus, age, sex. Minimum support was 0.2 and minimum confidence was 0.8 as experience for analysis of association rules with apriori algorithm. Four strong association rules were screened by the objective and subjective interestingness, which contained the relation between the stroke and age, sex, whole blood viscosity, plasma viscosity. The results show that Apriori algorithm can be used to study the the diagnosis and prevention of stroke.