Mining maximal dense subgraphs in uncertain PPI network

Jiacai Liu, Xuequn Shang, Ya Meng, Miao Wang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Several studies have shown that the prediction of protein function using PPI data is promising. However, the PPI data generated from experiments are noisy, incomplete and inaccurate, which promotes to represent PPI dataset as an uncertain graph. In this paper, we proposed a novel algorithm to mine maximal dense subgraphs efficiently in uncertain PPI network. It adopted several techniques to achieve efficient mining. An extensive experimental evaluation on yeast PPI network demonstrated that our approach had good performance in terms of precision and efficiency.

Original languageEnglish
Title of host publicationAdvances in Science and Engineering II
Pages609-615
Number of pages7
DOIs
StatePublished - 2012
Event2011 WASE Global Conference on Science Engineering, GCSE 2011 - Taiyuan and Xian, China
Duration: 10 Dec 201111 Dec 2011

Publication series

NameApplied Mechanics and Materials
Volume135-136
ISSN (Print)1660-9336
ISSN (Electronic)1662-7482

Conference

Conference2011 WASE Global Conference on Science Engineering, GCSE 2011
Country/TerritoryChina
CityTaiyuan and Xian
Period10/12/1111/12/11

Keywords

  • Dense subgraph
  • Expected density
  • PPI
  • Uncertain graph

Fingerprint

Dive into the research topics of 'Mining maximal dense subgraphs in uncertain PPI network'. Together they form a unique fingerprint.

Cite this