Attributed Graph Mining

Illustration of the possible extensions of a pattern with automorphisms.

Active from 2012 to 2014

Research rationale

Graphs are well suited to model complex structures present in the real world. Because of this ubiquitousness, graphs are extensively studied in graph theory, and, more recently, in the field of data mining. Until the 2000s, most research focused either on unlabeled graphs or on graphs with nodes associated with a single label. However, in many applications, objects (represented by nodes) are associated with multiple characteristics, and these can be represented as node attributes. Graphs in which nodes are annotated with sets of attributes (or itemsets) are named attributed graphs and up to now, only few studies are devoted to their analysis.

Mining attributed graphs is very difficult because the search space is much larger than for labeled graphs. However, there is a need for effective methods that can help identify hidden structural patterns, but which can also highlight the relationship between node attributes.

Results

A new mining algorithm combining itemset extension and structural extension

The strategy for searching for frequent patterns that we have proposed is to start from a set of initial patterns composed of nodes associated with a single item and to build the search tree from the spanning tree originating from these nodes, using an order based on a code that we have defined. We proposed a complete method for navigating the search space that combines two extension types: itemset extension and structure extension. We empirically defined the notion of closure on attributed graphs by considering that an attributed graph is closed if it is not included in any other attributed graph that has the same support as it. We have also proposed two concise representations of the patterns that are defined either according to the inclusion on itemsets (c-closed patterns), or according to the inclusion on the structures (s-closed patterns). We have shown that the enumeration of c-closed patterns allows to drastically reduce both the number of returned patterns and the execution time. Tests have shown that this condensed representation offers a good compromise between speed of execution and conciseness of results(Pasquier et al. 2013a; b, 2016).

Handling of cycles and isomorphic patterns

The consideration of cycles in a graph required a special treatment of the isomorphic patterns that are inevitably generated for all explorations that start on another node that is part of the cycle. Patterns that have many subgraph isomorphisms with the analyzed pattern present difficulties for all existing algorithms because the problem of subgraph isomorphisms is NP-complete. We have proposed two optimizations that make it possible, on the one hand, to trim the search tree generated from an automorphic pattern and, on the other hand, to delete certain ways of obtaining automorphic patterns that do not allow new canonical patterns to be generated (Pasquier et al. 2014, 2017).

A new condensed representation of weighted paths

We have addressed the problem of extracting frequent weighted paths in a single attributed directed acyclic graph (aDAG) where each weight expresses the frequency of a transition. Frequent paths are used to analyze the causal relationship between sequences of events and/or attributes. As the number of patterns can be very large, we have designed a condensed representation for such collections(Sanhes et al. 2013a; b).

Integrating mathematical models defined by experts into the extraction process

By noting that in many data science contexts, experts have often capitalized part of their knowledge in mathematical models, we have proposed to use these models to derive new constraints that can be used during the data mining phase to improve both pattern relevancy and computational efficiency We have defined a method of patterns mining under constraint of a modele. We also studied some properties of predicates and constraints in order to use them to optimize pattern calculations. We have shown that taking into account constraints from mathematical models makes it possible to better target analysis, while improving performance through model properties. We have thus obtained more relevant patterns, complementing or contradicting the expert knowledge on the studied phenomena (Flouvat et al. 2014a; b).

Funding

Program ANR Program FOSTER
Year 2011-2013
Funder ANR
Grant name Spatio-temporal data mining: application to the understanding and monitoring of soil erosion
Grant id ANR-10-COSI-012
Project coordinator Nazha-Selmaoui Folcher

Softwares

  • AADAGE: Extraction of frequent patterns in attributed graphs
  • IMIT: Mining frequent patterns in attributed trees

Flouvat, F., Sanhes, J., Pasquier, C., Selmaoui-folcher, N., and Boulicaut, J.-F. (2014a), “Improving pattern discovery relevancy by deriving constraints from expert models,” in 21st european conference on artificial intelligence (ecai’14), proceedings published by ios press in frontiers in artificial intelligence and applications serie volume 263, Prague: IOS Press, pp. 327–332.

Flouvat, F., Sanhes, J., Pasquier, C., Selmaoui-Folcher, N., and Boulicaut, J.-F. (2014b), “Les modèles des experts au service de l’extraction de motifs pertinents,” in 19ème congrès sur la reconnaissance de formes et l’Intelligence artificielle (rfia’14), Rouen.

Pasquier, C., Flouvat, F., Sanhes, J., and Selmaoui-folcher, N. (2014), “Extraction de motifs dans des graphes orientés attribués en présence d’automorphisme,” in 14ème conférence francophone sur l’Extraction et la gestion des connaissances (egc’14), revue des nouvelles technologies de l’Information, volume e-26, Rennes: RNTI, pp. 371–382.

Pasquier, C., Flouvat, F., Sanhes, J., and Selmaoui-Folcher, N. (2017), “Attributed graph mining in the presence of automorphism,” Knowledge and Information Systems, Springer London, 50, 569–584. https://doi.org/10.1007/s10115-016-0953-9.

Pasquier, C., Sanhes, J., Flouvat, F., and Selmaoui-Folcher, N. (2013a), “Extraction de motifs fréquents dans des arbres attribués,” in 13ème conférence francophone sur l’Extraction et la gestion des connaissances (egc’13). revue des nouvelles technologies de l’Information, volume e-24, Toulouse: RNTI, pp. 193–204.

Pasquier, C., Sanhes, J., Flouvat, F., and Selmaoui-Folcher, N. (2013b), “Frequent Pattern Mining in Attributed trees,” in 17th pacific asia conference on knowledge discovery and data mining (pakdd’13), j. pei et al. (eds.): PAKDD 2013, part i, lnai 7818, pp. 26–37. springer, heidelberg (2013), Gold Coast: Springer Berlin Heidelberg, pp. 26–37.

Pasquier, C., Sanhes, J., Flouvat, F., and Selmaoui-Folcher, N. (2016), “Frequent pattern mining in attributed trees: algorithms and applications,” Knowledge and Information Systems, Springer London, 46, 491–514. https://doi.org/10.1007/s10115-015-0831-x.

Sanhes, J., Flouvat, F., Pasquier, C., Selmaoui-Folcher, N., and Boulicaut, J.-F. (2013a), “Extraction de motifs condensés dans un unique graphe orienté acyclique attribué,” in 13ème conférence francophone sur l’Extraction et la gestion des connaissances (egc’13), revue des nouvelles technologies de l’Information, volume e-24, Toulouse: RNTI.

Sanhes, J., Flouvat, F., Pasquier, C., Selmaoui-Folcher, N., and Boulicaut, J.-F. (2013b), “Weighted Path as a Condensed Pattern in a Single Attributed DAG,” in 23rd international joint conference on artificial intelligence (ijcai’13), Beijing, pp. 1642–8.

Avatar
Claude Pasquier
Researcher in Computer Science / Computational Biology

Université côte d’Azur, CNRS, I3S Laboratory, Sophia Antipolis

Related