skip to main content
10.1145/3388440.3415989acmconferencesArticle/Chapter ViewAbstractPublication PagesbcbConference Proceedingsconference-collections
research-article

Post-Processing Summarization for Mining Frequent Dense Subnetworks

Authors Info & Claims
Published:24 November 2020Publication History

ABSTRACT

Gene expression data for multiple biological and environmental conditions is being collected for multiple species. Functional modules and subnetwork biomarkers discovery have traditionally been based on analyzing a single gene expression dataset. Research has focused on discovering modules from multiple gene expression datasets. Gene coexpression network mining methods have been proposed for mining frequent functional modules. Moreover, biclustering algorithms have been proposed to allow for missing coexpression links. Existing approaches report a large number of edgesets that have high overlap. In this work, we propose an algorithm to mine frequent dense modules from multiple coexpression networks using a post-processing data summarization method. Our algorithm mines a succinct set of representative subgraphs that have little overlap which reduce the downstream analysis of the reported modules. Experiments on human gene expression data show that the reported modules are biologically significant as evident by Gene Ontology molecular functions and KEGG pathways enrichment.

References

  1. Gary D. Bader and Christopher W.V. Hogu. 2003. An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinformatics 4, 2 (2003).Google ScholarGoogle Scholar
  2. Alvis Brazma and Jaak Vilo. 2000. Gene expression data analysis. FEBS Letters 480, 1 (2000), 17--24.Google ScholarGoogle ScholarCross RefCross Ref
  3. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2001. Introduction to Algorithms (2nd ed.). The MIT Press.Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Michael B. Eisen, Paul T. Spellman, Patrick O. Brown, and David Botstein. 1998. Cluster analysis and display of genome-wide expression patterns. Proceedings of the National Academy of Sciences 95, 25 (1998), 14863--14868.Google ScholarGoogle ScholarCross RefCross Ref
  5. Elisabeth Georgii, Sabine Dietmann, Takeaki Uno, Philipp Pagel, and Koji Tsuda. 2009. Enumeration of condition-dependent dense modules in protein interaction networks. Bioinformatics 25, 7 (2009), 933--940.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Aditya Goparaju, Tyler Brazier, and Saeed Salem. 2015. Mining representative maximal dense cohesive subnetworks. Network Modeling Analysis in Health Informatics and Bioinformatics 4, 1 (2015), 1--11.Google ScholarGoogle ScholarCross RefCross Ref
  7. Haiyan Hu, Xifeng Yan, Yu Huang, and Xianghong Jasmine Zhou. 2005. Mining coherent dense subgraphs across massive biological networks for functional discovery. Bioinformatics 21 Suppl 1 (2005), i213-i221.Google ScholarGoogle Scholar
  8. Yu Huang, Haifeng Li, Haiyan Hu, Xifeng Yan, Michael S. Waterman, Haiyan Huang, and Xianghong Jasmine Zhou. 2007. Systematic discovery of functional modules and context-specific functional annotation of human genome. Bioinformatics 23, 13 (2007), i222-i229.Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Daxin Jiang and Jian Pei. 2009. Mining frequent cross-graph quasi-cliques. ACM Trans. Knowl. Discov. Data 2, 4 (jan 2009), 16:1-16:42.Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Daxin Jiang, Jian Pei, and Aidong Zhang. 2003. DHC: A Density-Based Hierarchical Clustering Method for Time Series Gene Expression Data. In Proceedings of the 3rd IEEE Symposium on BioInformatics and BioEngineering (BIBE '03). IEEE Computer Society, Washington, DC, USA, 393-.Google ScholarGoogle Scholar
  11. Daxin Jiang, Chun Tang, and Aidong Zhang. 2004. Cluster Analysis for Gene Expression Data: A Survey. IEEE Trans. on Knowl. and Data Eng. 16, 11 (Nov. 2004), 1370--1386.Google ScholarGoogle Scholar
  12. Mehmet Koyuturk, Ananth Grama, and Wojciech Szpankowski. 2004. An Efficient Algorithm for Detecting Frequent Subgraphs in Biological Networks. Bioinformatics 20, Suppl 1 (2004), i200-i207.Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Homin K. Lee, Amy K. Hsu, Jon Sajdak, Jie Qin, and Paul Pavlidis. 2004. Coexpression analysis of human genes across many microarray data sets. Genome Res. 14, 6 (2004), 1085--1094.Google ScholarGoogle ScholarCross RefCross Ref
  14. Emma Pierson, the GTEx Consortium, Daphne Koller, Alexis Battle, and Sara Mostafavi. 2015. Sharing and Specificity of Co-expression Networks across 35 Human Tissues. PLOS Computational Biology 11, 5 (05 2015), 1--19. https://doi.org/10.1371/journal.pcbi.1004220Google ScholarGoogle Scholar
  15. Saeed Salem. 2017. Template edge similarity graph clustering for mining multiple gene expression datasets. International Journal of Data Mining and Bioinformatics 18, 1 (2017), 28--39.Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Saeed Salem and Cagri Ozcaglar. 2013. MFMS: Maximal Frequent Module Set Mining from Multiple Human Gene Expression Data Sets. In Proceedings of the 12th international Workshop on Data Mining in Bioinformatics (Chicago, Illinois) (BioKDD '13). ACM, New York, NY, USA, 51--57.Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Saeed Salem and Cagri Ozcaglar. 2014. Hybrid coexpression link similarity graph clustering for mining biological modules from multiple gene expression datasets. BioData Mining 7, 1 (2014), 16.Google ScholarGoogle ScholarCross RefCross Ref
  18. San Ha Seo and Saeed Salem. 2020. Mining approximate frequent dense modules from multiple gene expression datasets. In Proceedings of the 12th International Conference on Bioinformatics and Computational Biology (EPiC Series in Computing, Vol. 70), Qin Ding, Oliver Eulenstein, and Hisham Al-Mubaid (Eds.). EasyChair, 129--138.Google ScholarGoogle Scholar
  19. Roded Sharan and Ron Shamir. 2000. Center CLICK: A Clustering Algorithm with Applications to Gene Expression Analysis. In Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology. AAAI Press, 307--316.Google ScholarGoogle Scholar
  20. Xifeng Yan, Xianghong Jasmine Zhou, and Jiawei Han. 2005. Mining closed relational graphs with connectivity constraints. In Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining (Chicago, Illinois, USA) (KDD '05). ACM, New York, NY, USA, 324--333.Google ScholarGoogle ScholarDigital LibraryDigital Library
  1. Post-Processing Summarization for Mining Frequent Dense Subnetworks

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          BCB '20: Proceedings of the 11th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics
          September 2020
          193 pages
          ISBN:9781450379649
          DOI:10.1145/3388440

          Copyright © 2020 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 24 November 2020

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article
          • Research
          • Refereed limited

          Acceptance Rates

          Overall Acceptance Rate254of885submissions,29%
        • Article Metrics

          • Downloads (Last 12 months)0
          • Downloads (Last 6 weeks)0

          Other Metrics

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader