Mining constrained cross-graph cliques in dynamic networks

DOI10.1007/978-1-4419-7738-0_9MaRDI QIDQ3064495zbMATH OpenOpenAlexFDO

Authors Loïc Cerf, Bao Tran Nguyen, Jean-François Boulicaut

Publication date 22 December 2010

Published in Inductive Databases and Constraint-Based Data Mining (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-1-4419-7738-0_9

zbMATH Keywords

dynamic graphsconstrained clique patterns

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Graph theory (including graph drawing) in computer science (68R10) Database theory (68P15)

Recommendations

• Mining preserving structures in a graph sequence
• Mining preserving structures in a graph sequence
• Mining closed patterns in relational, graph and network data
• Closed and noise-tolerant patterns in \(n\)-ary relations
• Finding all maximal cliques in dynamic graphs

Cited in

(3)

• Mining preserving structures in a graph sequence
• Mining preserving structures in a graph sequence
• Closed and noise-tolerant patterns in \(n\)-ary relations

This page was built for publication: Mining constrained cross-graph cliques in dynamic networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3064495)