Name
Abstract | ||
|---|---|---|
Graph clustering becomes difficult as the graph size and complexity increase. In particular, in interaction graphs, the clusters are small and the data on the underlying interaction are not only complex, but also noisy due to the lack of information and experimental errors. The graphs representing such data consist of (possibly overlapping) clusters of non-uniform size with some false positive and false negative links. In this article, we propose a new approach, assuming that clusters in the graphs of protein-protein interaction (PPI) networks resemble corrupted cliques. Therefore, the problem can be reduced to looking for clusters only among nodes of approximately similar degrees. This idea was implemented using a soft version of the Farthest-Point-First (FPF) clustering algorithm with the Jaccard distance function modified to perform on slightly overlapping clusters. The StripClust program developed by us was tested on a synthetic network and on the yeast PPI network. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1089/cmb.2013.0095 | JOURNAL OF COMPUTATIONAL BIOLOGY |
DocType | Volume | Issue |
Journal | 21.0 | 2 |
ISSN | Citations | PageRank |
1066-5277 | 0 | 0.34 |
References | Authors | |
6 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nissan Lev-Tov | 1 | 137 | 7.91 |
| Sandeep Amberkar | 2 | 0 | 0.34 |
| Zakharia M. Frenkel | 3 | 0 | 1.01 |
| Lars Kaderali | 4 | 161 | 16.32 |
| Z. Volkovich | 5 | 74 | 13.19 |