Volume 6 Number 3 (Mar. 2011)
Home > Archive > 2011 > Volume 6 Number 3 (Mar. 2011) >
JSW 2011 Vol.6(3): 498-507 ISSN: 1796-217X
doi: 10.4304/jsw.6.3.498-507

MFC: Mining Maximal Frequent Dense Subgraphs without Candidate Maintenance in Imbalanced PPI Networks

Miao Wang, Xuequn Shang, Zhanhuai Li

School of Computer Science and Engineering, Northwestern Polytechnical University, Xi’an, China

Abstract—The prediction of protein function is one of the most challenging problems in bioinformatics. Several studies have shown that the prediction using PPI is promising. However, the PPI data generated from highthroughput experiments are very noisy, which renders great challenges to the existing methods. In this paper, we propose an algorithm, MFC, to efficiently mine maximal frequent dense subgraphs without candidate maintenance in PPI networks. Instead of using summary graph, MFC produces frequent dense patterns by extending vertices. It adopts several techniques to achieve efficient mining. Due to the imbalance character of PPI network, we also propose to generate frequent patterns using relative support. We evaluate our approach on four PPI data sets. The experimental results show that our approach has good performance in terms of efficiency. With the help of relative support, more frequent dense functional interaction patterns in the PPI networks can be identified.

Index Terms—frequent dense subgraph, imbalance, relative support, used edge, family subgraph

[PDF]

Cite: Miao Wang, Xuequn Shang, Zhanhuai Li, "MFC: Mining Maximal Frequent Dense Subgraphs without Candidate Maintenance in Imbalanced PPI Networks," Journal of Software vol. 6, no. 3, pp. 498-507, 2011.

General Information

ISSN: 1796-217X (Online)
Frequency:  Quarterly
Editor-in-Chief: Prof. Antanas Verikas
Executive Editor: Ms. Yoyo Y. Zhou
Abstracting/ Indexing: DBLP, EBSCO, CNKIGoogle Scholar, ProQuest, INSPEC(IET), ULRICH's Periodicals Directory, WorldCat, etc
E-mail: jsweditorialoffice@gmail.com
  • Mar 01, 2024 News!

    Vol 19, No 1 has been published with online version    [Click]

  • Apr 26, 2021 News!

    Vol 14, No 4- Vol 14, No 12 has been indexed by IET-(Inspec)     [Click]

  • Nov 18, 2021 News!

    Papers published in JSW Vol 16, No 1- Vol 16, No 6 have been indexed by DBLP   [Click]

  • Jan 04, 2024 News!

    JSW will adopt Article-by-Article Work Flow

  • Nov 02, 2023 News!

    Vol 18, No 4 has been published with online version   [Click]