Detecting dense subgraphs in complex networks based on edge density coefficient

被引：0
|
作者：
机构：
[1] [1,Guan, Bo
[2] Zan, Xiangzhen
[3] Xiao, Biyu
[4] Ma, Runnian
[5] Zhang, Fengyue
[6] Liu, Wenbin
来源：
Guan, B. (guanbo@nbut.cn) | 1600年 / Chinese Institute of Electronics卷 / 22期
基金：
中国国家自然科学基金;
关键词：
Bioinformatics - Gene Ontology - Yeast;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [31] An efficient algorithm for detecting closed frequent subgraphs in biological networks
    Peng Jia-yang
    Yang Lu-ming
    Wang Jian-xin
    Liu Zheng
    Li Ming
    BMEI 2008: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON BIOMEDICAL ENGINEERING AND INFORMATICS, VOL 1, 2008, : 677 - 681
  • [32] An Efficient Framework for Detecting Evolving Anomalous Subgraphs in Dynamic Networks
    Shao, Minglai
    Li, Jianxin
    Chen, Feng
    Chen, Xunxun
    IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2018), 2018, : 2258 - 2266
  • [33] Tradeoffs between Density and Size in Extracting Dense Subgraphs: A Unified Framework
    Wang, Zhefeng
    Chu, Lingyang
    Pei, Jian
    Al-Barakati, Abdullah
    Chen, Enhong
    PROCEEDINGS OF THE 2016 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING ASONAM 2016, 2016, : 41 - 48
  • [34] Greedily Mining l-dense Subgraphs in Protein Interaction Networks
    Li, Min
    Wang, Jianxin
    Chen, Jian'er
    Hu, Bin
    PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE FOR YOUNG COMPUTER SCIENTISTS, VOLS 1-5, 2008, : 1018 - 1023
  • [35] Protein complex prediction via dense subgraphs and false positive analysis
    Hernandez, Cecilia
    Mella, Carlos
    Navarro, Gonzalo
    Olivera-Nappa, Alvaro
    Araya, Jaime
    PLOS ONE, 2017, 12 (09):
  • [36] Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio Measure
    Li, Angsheng
    Peng, Pan
    ALGORITHMS AND COMPUTATION, 2013, 8283 : 655 - 665
  • [37] Algorithm for Detecting Communities in Complex Networks Based on Hadoop
    Hai, Mo
    Li, Haifeng
    Ma, Zhekun
    Gao, Xiaomei
    SYMMETRY-BASEL, 2019, 11 (11):
  • [38] Extracting High-Fidelity Smaller Scale Subgraphs of Complex Networks by Edge-Reinforced Random Walk
    Chen, Dan
    Su, Housheng
    IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS, 2024, 11 (05) : 1 - 11
  • [39] Clustering of tag-induced subgraphs in complex networks
    Pollner, Peter
    Palla, Gergely
    Vicsek, Tamas
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2010, 389 (24) : 5887 - 5894
  • [40] Local heuristics and the emergence of spanning subgraphs in complex networks
    Stauffer, AO
    Barbosa, VC
    THEORETICAL COMPUTER SCIENCE, 2006, 355 (01) : 80 - 95
12345