# Finding Collections of k-Clique Percolated Components in Attributed Graphs

@inproceedings{Mougel2012FindingCO, title={Finding Collections of k-Clique Percolated Components in Attributed Graphs}, author={Pierre-Nicolas Mougel and Christophe Rigotti and Olivier Gandrillon}, booktitle={PAKDD}, year={2012} }

In this paper, we consider graphs where a set of Boolean attributes is associated to each vertex, and we are interested in k -clique percolated components (components made of overlapping cliques) in such graphs. We propose the task of finding the collections of homogeneous k -clique percolated components, where homogeneity means sharing a common set of attributes having value true. A sound and complete algorithm based on subgraph enumeration is proposed. We report experiments on two real…

## 38 Citations

### Local Knowledge Discovery in Attributed Graphs

- Computer Science2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI)
- 2015

An algorithm to enumerate triples (c,e,l) where c is a (global) closed pattern which leads in the region e of the graph to a local closed pattern l and define a basis of implication rules expressing what new attributes l\c appear when focussing in this region.

### Graph abstraction for closed pattern mining in attributed networks

- Computer Science, MathematicsECAI
- 2014

The core idea is to define graph abstractions as subsets of the vertices satisfying some connectivity property within the corresponding induced subgraphs of a graph, typically representing a social network.

### Local Pattern Detection in Attributed Graphs

- Computer ScienceSolving Large Scale Learning Tasks
- 2016

The network of authors who have cooperated at some time with Katharina Morik according to the data available in DBLP database is studied to mine the topology of a large attributed graph by finding regularities among vertex descriptors.

### Finding homogeneous collections of dense subgraphs using constraint-based data mining approaches. (Découverte de collections homogènes de sous-graphes denses par des méthodes de fouille de données sous contraintes)

- Computer Science
- 2012

This thesis proposes two new classes of patterns along with sound and complete algorithms to compute them efficiently using constraint-based approaches for the analysis of attributed graphs, and shows that the proposed approaches scale well for large datasets.

### Local rules associated to k-communities in an attributed graph

- Mathematics2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)
- 2015

The problem of finding local patterns and local rules in an attributed graph is addressed and it is shown that there is a closure operator such that, given a pattern q subgraph and a k-community in this subgraph, returns the local closed pattern shared by all the members of the community.

### Abstract and Local Rule Learning in Attributed Networks

- Computer ScienceISMIS
- 2015

We address the problem of finding local patterns and related local knowledge, represented as implication rules, in an attributed graph. Our approach consists in extending frequent closed pattern…

### Cohesive Co-evolution Patterns in Dynamic Attributed Graphs

- Computer ScienceDiscovery Science
- 2012

This work designs the first algorithm to mine the complete set of cohesive co-evolution patterns in a dynamic graph and demonstrates that the algorithm enables to discover relevant patterns inA feasible time.

### Formal Concept Analysis of Attributed Networks

- Computer ScienceFormal Concept Analysis of Social Networks
- 2017

This work considers attribute pattern mining in an attributed graph through recent developments of Formal Concept Analysis and considers in particular the detection and ordering of k-communities in subgraphs of an attributed network.

### Supporting the Discovery of Relevant Topological Patterns in Attributed Graphs

- Computer Science2012 IEEE 12th International Conference on Data Mining Workshops
- 2012

We propose TopGraphVisualizer, a tool to support the discovery of relevant topological patterns in attributed graphs. It relies on a new pattern detection method that crucially needs for…

### Bi-Pattern Mining of Two Mode and Directed Networks

- Computer ScienceWWW
- 2018

The same methodology applies to hub-authority cores of directed networks in which each vertex subset is associated to a role (in or out) and is illustrated both on a two-mode network of epistemological data and on a directed advice network of lawyers.

## References

SHOWING 1-10 OF 16 REFERENCES

### Constraint-Based Mining of Sets of Cliques Sharing Vertex Properties

- Computer Science
- 2010

A method to compute all maximal homogeneous clique sets that satisfy user-defined constraints on the number of separated cliques, on the size of the clique, and on theNumber of labels shared by all the vertices is proposed.

### Structural correlation pattern mining for large graphs

- Computer ScienceMLG '10
- 2010

This paper proposes an efficient algorithm, called SCORP, to extract SCPs from large graphs, and compares it against a naive approach for SCP mining, demonstrating its scalability and efficiency.

### Finding Itemset-Sharing Patterns in a Large Itemset-Associated Graph

- Computer SciencePAKDD
- 2010

This paper introduces a new problem which is called itemset-sharing subgraph (ISS) set enumeration, where the task is to find sets of subgraphs with common itemsets in a large graph, and proposes an efficient algorithm ROBIN for finding ISS sets in such graph.

### Clustering Large Attributed Graphs: An Efficient Incremental Approach

- Computer Science2010 IEEE International Conference on Data Mining
- 2010

An efficient algorithm Inc-Cluster is proposed to incrementally update the random walk distances given the edge weight increments to achieve significant speedup over SA-Clusters on large graphs, while achieving exactly the same clustering quality in terms of intra-cluster structural cohesiveness and attribute value homogeneity.

### Properties of Bridge Nodes in Social Networks

- Computer ScienceICCCI
- 2009

The main goal of the paper is to describe the properties of the nodes within a social network that connect the peripheral nodes and peripheral groups with the rest of the network. These nodes are…

### Fast best-effort pattern matching in large attributed graphs

- Computer ScienceKDD '07
- 2007

The G-Ray ("Graph X-Ray") method finds high-quality subgraphs in time linear on the size of the data graph, where nodes have attributes, such as a social network where the nodes are labelled with each person's job title.

### Graph Clustering Based on Structural/Attribute Similarities

- Computer ScienceProc. VLDB Endow.
- 2009

This paper proposes a novel graph clustering algorithm, SA-Cluster, based on both structural and attribute similarities through a unified distance measure, which partitions a large graph associated with attributes into k clusters so that each cluster contains a densely connected subgraph with homogeneous attribute values.

### The worst-case time complexity for generating all maximal cliques and computational experiments

- Computer Science, MathematicsTheor. Comput. Sci.
- 2006

### Joint cluster analysis of attribute data and relationship data

- Computer ScienceSDM
- 2006

This article introduces the novel Connected k-Center (CkC) problem, a clustering model taking into account attribute data as well as relationship data, and presents NetScan, a heuristic algorithm that is efficient and effective for large real databases.

### Joint cluster analysis of attribute and relationship data withouta-priori specification of the number of clusters

- Computer ScienceKDD '07
- 2007

This paper introduces and formalizes the problem of discovering an a-priori unspecified number of clusters in the context of joint cluster analysis of attribute and relationship data, called Connected X Clusters (CXC) problem and presents JointClust, an algorithm which adopts a dynamic two-phase approach.