skip to main content
10.1145/2500863.2500869acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
research-article

MFMS: maximal frequent module set mining from multiple human gene expression data sets

Published: 11 August 2013 Publication History

Abstract

Advances in genomic technologies have allowed vast amounts of gene expression data to be collected. Protein functional annotation and biological module discovery that are based on a single gene expression data suffers from spurious coexpression. Recent work have focused on integrating multiple independent gene expression data sets. In this paper, we propose a two-step approach for mining maximally frequent collection of highly connected modules from coexpression graphs. We first mine maximal frequent edge-sets and then extract highly connected subgraphs from the edge-induced subgraphs. Experimental results on the collection of modules mined from 52 Human gene expression data sets show that coexpression links that occur together in a significant number of experiments have a modular topological structure. Moreover, GO enrichment analysis shows that the proposed approach discovers biologically significant frequent collections of modules.

References

[1]
Gary D. Bader and Christopher W. V. Hogu. An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinformatics, 4(2), 2003.
[2]
Imre Derenyi, Gergely Palla, and Tamas Vicsek. Clique percolation in random networks. Phys. Rev. Lett., 94(16):160202, 2005.
[3]
Audrey P Gasch and Michael B Eisen. Exploring the conditional coregulation of yeast gene expression through fuzzy k-means clustering. Genome Biology, 3(11):research0059.1--0059.22, 2002.
[4]
Karam Gouda and Mohammed J. Zaki. GenMax: An efficient algorithm for mining maximal frequent itemsets. Data Mining and Knowledge Discovery: An International Journal, 11 (3):223--242, Nov 2005.
[5]
Haiyan Hu, Xifeng Yan, Yu Huang, and Xianghong Jasmine Zhou. Mining coherent dense subgraphs across massive biological networks for functional discovery. Bioinformatics, 21 Suppl 1:i213--i221, 2005.
[6]
Yu Huang, Haifeng Li, Haiyan Hu, Xifeng Yan, Michael S. Waterman, Haiyan Huang, and Xianghong Jasmine Zhou. Systematic discovery of functional modules and context-specific functional annotation of human genome. Bioinformatics, 23(13):i222--i229, 2007.
[7]
Daxin Jiang and Jian Pei. Mining frequent cross-graph quasi-cliques. ACM Trans. Knowl. Discov. Data, 2(4):16:1--16:42, jan 2009.
[8]
Mehmet Koyuturk, Ananth Grama, and Wojciech Szpankowski. An efficient algorithm for detecting frequent subgraphs in biological networks. Bioinformatics, 20(Suppl 1): i200--i207, 2004.
[9]
Homin K. Lee, Amy K. Hsu, Jon Sajdak, Jie Qin, and Paul Pavlidis. Coexpression analysis of human genes across many microarray data sets. Genome Res., 14(6):1085--1094, 2004.
[10]
Pierre-Nicolas Mougel, Mark Plantevit, Christophe Rigotti, Olivier Gandrillon, and Jean-Francois Boulicaut. Constraint-based mining of sets of cliques sharing vertex properties. In In: Workshop on Analysis of Complex NEtworks (ACNE 2010) co-located with ECML/PKDD 2010, 2010.
[11]
Jian Pei, Daxin Jiang, and Aidong Zhang. On mining cross-graph quasi-cliques. In Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, KDD '05, pages 228--238, 2005.
[12]
Ahsanur Rahman, Christopher L Poirel, David J Badger, and TM Murali. Reverse engineering molecular hypergraphs. In Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine, pages 68--75. ACM, 2012.
[13]
Xifeng Yan, Xianghong Jasmine Zhou, and Jiawei Han. Mining closed relational graphs with connectivity constraints. In Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, KDD '05, pages 324--333, 2005.
[14]
Barry R. Zeeberg, Weimin Feng, Geoffrey Wang, May D. Wang, Anthony T. Fojo, Margot Sunshine, Sudarshan Narasimhan, David W. Kane, William C. Reinhold, Samir Lababidi, and Kimberly. Gominer: A resource for biological interpretation of genomic and proteomic data. Genome Biology, 4(4):R28, 2003.

Cited By

View all
  • (2020)Post-Processing Summarization for Mining Frequent Dense SubnetworksProceedings of the 11th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics10.1145/3388440.3415989(1-9)Online publication date: 21-Sep-2020
  • (2020)Mining representative approximate frequent coexpression subnetworksProceedings of the 11th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics10.1145/3388440.3415584(1-8)Online publication date: 21-Sep-2020
  • (2019)MiMod: A New Algorithm for Mining Biological Network ModulesIEEE Access10.1109/ACCESS.2019.29099467(49492-49503)Online publication date: 2019
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
BioKDD '13: Proceedings of the 12th International Workshop on Data Mining in Bioinformatics
August 2013
64 pages
ISBN:9781450323277
DOI:10.1145/2500863
  • General Chairs:
  • Jake Chen,
  • Mohammed Zaki,
  • Program Chairs:
  • Gaurav Pandey,
  • Huzefa Rangwala,
  • George Karypis
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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 11 August 2013

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article

Funding Sources

Conference

KDD' 13
Sponsor:

Acceptance Rates

BioKDD '13 Paper Acceptance Rate 7 of 16 submissions, 44%;
Overall Acceptance Rate 7 of 16 submissions, 44%

Upcoming Conference

KDD '25

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 05 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2020)Post-Processing Summarization for Mining Frequent Dense SubnetworksProceedings of the 11th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics10.1145/3388440.3415989(1-9)Online publication date: 21-Sep-2020
  • (2020)Mining representative approximate frequent coexpression subnetworksProceedings of the 11th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics10.1145/3388440.3415584(1-8)Online publication date: 21-Sep-2020
  • (2019)MiMod: A New Algorithm for Mining Biological Network ModulesIEEE Access10.1109/ACCESS.2019.29099467(49492-49503)Online publication date: 2019
  • (2019)Listing all maximal cliques in large graphs on vertex-centric modelThe Journal of Supercomputing10.1007/s11227-019-02770-475:8(4918-4946)Online publication date: 1-Aug-2019
  • (2018)Performance and characteristic analysis of maximal frequent pattern mining methods using additional factorsSoft Computing - A Fusion of Foundations, Methodologies and Applications10.1007/s00500-017-2820-322:13(4267-4273)Online publication date: 1-Jul-2018
  • (2017)Template edge similarity graph clustering for mining multiple gene expression datasetsInternational Journal of Data Mining and Bioinformatics10.1504/IJDMB.2017.08609818:1(28-39)Online publication date: 1-Jan-2017
  • (2017)Mining quasi frequent coexpression subnetworks2017 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)10.1109/BIBM.2017.8217922(1736-1740)Online publication date: Nov-2017
  • (2016)Analysis of Recent Maximal Frequent Pattern Mining ApproachesAdvances in Computer Science and Ubiquitous Computing10.1007/978-981-10-3023-9_135(873-877)Online publication date: 23-Nov-2016
  • (2014)Hybrid coexpression link similarity graph clustering for mining biological modules from multiple gene expression datasetsBioData Mining10.1186/1756-0381-7-167:1Online publication date: 18-Aug-2014

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media