Abstract
Using microarray technology to predict gene function has become important in research. However, microarray data are complicated and require a powerful systematic method to handle these data. Many scholars use clustering algorithms to analyze microarray data, but these algorithms can find only the same expression mode, not the transcriptional relation between genes. Moreover, most traditional approaches involve all-against-all comparisons that are time consuming. To reduce the comparison time and find more relations, a proposed method is to use an a priori algorithm to filter possible related genes first, which can reduce number of candidate genes, and then apply a dynamic Bayesian network to find the gene’s interaction. Unlike the previous techniques, this method not only reduces the comparison complexity but also reveals more mutual interaction among genes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Becquet, C., Blachon, S., Jeudy, B., Boulicaut, J.F., Gandrillon, O.: Strong-association-rule mining for large-scale gene-expression data analysis: a case study o human SAGE data. Genome Biol 12, 1–16 (2003)
Creighton, C., Hanash, S.: Mining gene expression databases for association rules. Bioinformatics 19, 79–86 (2003)
Doddi, S., Marathe, A., Ravi, S.S., Torney, D.C.: Discovery of association rules in medical data. Med Information Internet Med. 26, 25–33 (2001)
Eisen, M.B., Spellman, P.T., Brown, P.O., Botstein, D.: Cluster analysis and display of genome-wide expression patterns. Proc. Natl. Acad. Science (USA?) 95, 14863–14868 (1998)
Eisenberg, D., Marcotte, M.E., Xenarios, I., Yeates, O.T.: Protein function in the post-genomic era. Nature 405, 823–826 (2000)
Ewing, B., Green, P.: Analysis of expressed sequence tags indicates 35,000 human genes. Nature Genet 25, 232–234 (2000)
Hieter, P., Boguski, M.: Functional genomics: it’s all how you read it. Science 278, 601–602 (1997)
Kim, S.Y., Imoto, S., Miyano, S.: Inferring gene networks from time series microarray data using Dynamic Bayesian Networks. Briefing Bioinformatics 4(3), 228–235 (2003)
Kim, S.Y., Imoto, S., Miyano, S.: Dynamic Bayesian networks and nonparametric regression for nonlinear modeling of gene networks from time series gene expression data. Biosystems 75, 57–65 (2004)
Murphy, K., Mian, S.: Modeling gene expression data using dynamic Bayesian networks. Technical Report, Computer Science Division, University of California, Berkeley, CA (1999)
Tamayo, P., Slonim, D., Mesirov, J., Zhu, Q., Kitareewan, S., Dmitrovsky, E., Lander, E.S., Golub, T.R.: Interpreting patterns of gene expression with self-organizing maps methods and application to hematopoietic differentiation. Nature Genetics 96, 2907–2912 (1999)
Tavazoie, S., Hughes, J.D., Campbell, M.J., Cho, R.J., Church, G.M.: Systematic determination of genetic network architecture. Nature Genetics 22, 281–285 (1999)
Torgeir, R.H., Astrid, L., Jan, K.: Learning rule-based models of biological process from gene expression time profiles using Gene Ontology. Bioinformatics 19, 1116–1123 (2002)
Zou, M., Conzen, S.D.: A new dynamic Bayesian network approach for identifying gene regulatory networks from time course microarray data. Bioinformatics, 1–29 (Advance Access published on August 12, 2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, HC., Lee, YS. (2005). Gene Network Prediction from Microarray Data by Association Rule and Dynamic Bayesian Network. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424857_34
Download citation
DOI: https://doi.org/10.1007/11424857_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25862-9
Online ISBN: 978-3-540-32045-6
eBook Packages: Computer ScienceComputer Science (R0)