2012
DOI: 10.5402/2012/726429
|View full text |Cite
|
Sign up to set email alerts
|

Partitioning a PPI Network into Overlapping Modules Constrained by High-Density and Periphery Tracking

Abstract: This paper presents an algorithm called DPClusO for partitioning simple graphs into overlapping modules, that is, clusters constrained by density and periphery tracking. The major advantages of DPClusO over the related and previously published algorithm DPClus are shorter running time and ensuring coverage, that is, each node goes to at least one module. DPClusO is a general-purpose clustering algorithm and useful for finding overlapping cohesive groups in a simple graph for any type of application. This work … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
25
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
6
1

Relationship

3
4

Authors

Journals

citations
Cited by 29 publications
(25 citation statements)
references
References 25 publications
0
25
0
Order By: Relevance
“…The DPClus algorithm is a graph-clustering algorithm that can be used to extract densely connected nodes as a cluster [25, 32]. This algorithm can be applied to an undirected simple graph G = ( N , E ) that consists of a finite set of nodes N and a finite set of edges E .…”
Section: Methodsmentioning
confidence: 99%
“…The DPClus algorithm is a graph-clustering algorithm that can be used to extract densely connected nodes as a cluster [25, 32]. This algorithm can be applied to an undirected simple graph G = ( N , E ) that consists of a finite set of nodes N and a finite set of edges E .…”
Section: Methodsmentioning
confidence: 99%
“…The numbers of sub graphs of a given density are too many in networks of reasonable size [11]. The algorithm of Georgii et al [15] attempted to find all possible sub graphs of a given density, but the results indicate that the number of clusters as well as computational time would be very high and would not be feasible for big and dense networks.…”
Section: Cluster Filteringmentioning
confidence: 99%
“…We mention here definitions for some terms from our previously published paper [11] which are also relevant to this work.…”
Section: Relevant Definitionsmentioning
confidence: 99%
See 2 more Smart Citations