Main overlap detection methods
Detection community
Archive REF: H7444 V1
Main overlap detection methods
Detection community

Authors : Michel CRAMPES, Michel PLANTIÉ

Publication date: May 10, 2014 | Lire en français

Logo Techniques de l'Ingenieur You do not have access to this resource.
Request your free trial access! Free trial

Already subscribed?

3. Main overlap detection methods

3.1 Unipartite graphs

Strategies for detecting overlapping communities from possibly weighted unipartite graphs often extend partitioning methods. For example, they use k-clique percolation , or random walk in a graph

You do not have access to this resource.
Logo Techniques de l'Ingenieur

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource. Click here to request your free trial access!

Already subscribed?

Article included in this offer

"Digital documents and content management"

( 71 articles )

Complete knowledge base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

View offer details
Contact our team FAQ