1. Home
  2. IT
  3. Digital documents and content management
  4. Detection community

  5. Main overlap detection methods

Article | REF: H7444 V1

Detection community

Authors: Michel CRAMPES, Michel PLANTIÉ

Publication date: May 10, 2014

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

Already subscribed? Log in!

Français

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 . Gregory

You do not have access to this resource.

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? Log in!

The Ultimate Scientific and Technical Reference

A Comprehensive Knowledge Base, with over 1,200 authors and 100 scientific advisors
+ More than 10,000 articles and 1,000 how-to sheets, over 800 new or updated articles every year
From design to prototyping, right through to industrialization, the reference for securing the development of your industrial projects

This article is included in

Digital documents and content management

This offer includes:

Knowledge Base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

Practical Path

Operational and didactic, to guarantee the acquisition of transversal skills

Doc & Quiz

Interactive articles with quizzes, for constructive reading

Subscribe now!

Ongoing reading
Main overlap detection methods
Outline