Abstract
DNA microarrays allow simultaneous measurements of expression levels for a large number of genes within a number of different experimental samples. Mining association rules algorithms are used to reveal biologically relevant associations between different genes under different experimental samples. In this paper, we present a new mining association rules algorithm called Mining Maximal High Confidence Rules (MMHCR). The MMHCR algorithm is based on a column (gene) enumeration method which overcomes both the computational time and memory explosion problems of column-enumeration method used in many of the mining microarray algorithms. MMHCR uses an efficient data structure tree in which each node holds a gene’s name and its binary representation. The binary representation is beneficial in two folds. First, it makes MMHCR easily find all maximal high confidence rules. Second, it makes MMHCR more scalable than comparatives. In our experiments on a real microarray dataset, MMHCR attained very promising results and outperformed other counterparts.
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.
Similar content being viewed by others
References
Stekel, D.: Microarray Bioinformatics. Cambridge University Press (2003)
Senthil Kumar, A.V.: Knowledge Discovery Practices and Emerging Applications of Data Mining: Trends and New Domains. In: InformatIon Science Reference (2011)
Wang, M., Shang, X.Q., Li, Z.H.: Strong Association Rules Mining without using Frequent Items for Microarray Analysis. In: The 3rd Int. Conf. on Bioinformatics and Biomedical Engineering (iCBBE 2009), pp. 978–984. IEEE, Beijing (2009)
Alves, R., Rodriguez-Baena, D.S., Aguilar-Ruiz, J.S.: Gene Association Analysis: a Survey of Frequent Pattern Mining from Gene Expression Data. Brief Bioinform (2010)
Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proceedings of the 20th Int. Conf. on Very Large Data Bases (VLDB 1994), Santiago de Chile, Chile, pp. 475–486. Morgan Kaufmann (September 1994)
Han, J., Kamber, M.: Data Mining: Concepts and Techniques, 3rd edn. Morgan Kaufmann (July 6, 2011)
Piatetsky-Shapiro, G., Tamayo, P.: Microarray Data Mining: Facing the Challenges. SIGKDD Explor. Newsl. 5(2), 1–5 (2003)
Becquet, C., Blachon, S., Jeudy, B., Boulicaut, J.-F., Gandrillon, O.: Strong Association Rule Mining for Large Gene Expression Data Analysis: a Case Study on Human SAGE Data. Genome Biology 12 (2002)
McIntosh, T., Chawla, S.: High Confidence Rule Mining for Microarray Analysis. IEEE/ACM TCBB 4(4), 611–623 (2007)
Cong, G., Tan, K.-L., Tung, A., Pan, F.: Mining Frequent Closed Patterns in Microarray Data. In: Proc. Fourth IEEE Int’l Conf. Data Mining (ICDM), vol. 4, pp. 363–366 (2004)
Zaki, M.J., Hsiao, C.: CHARM: An Efficient Algorithm for Closed Association Rule Mining. In: Proc. SIAM Int’l Conf. on Data Mining, SDM (2002)
Agrawal, R., Imielinski, T., Swami, A.N.: Mining Association Rules between Sets of items in Large Databases. In: Proc. of the 1993 ACM SIGMOD Int. Conf. on Management of Data, pp. 207–216 (1993)
Pan, F., Cong, G., Tung, K., Yang, J., Zaki, M.J.: Carpenter: Finding Closed Patterns in Long Biological Datasets. In: Proc. ACM SIGKDD Intl. Conf. Knowledge Discovery and Data Mining (KDD), pp. 637–642 (2004)
Cong, G., Xu, X., Pan, F., Tung, A., Yang, J.: FARMER: Finding Interesting Rule Groups in Microarray Datasets. In: SIGMOD 2004 (2004)
Wang, J., Han, J., Pei, J.: CLOSET+: Searching for the Best Strategies for Mining Frequent Closed Itemsets. In: Proc. ACM SIGKDD Int’l Conf. on Knowledge Discovery and Data Mining, KDD (2003)
Bayardo, R.J.: Efficiently Mining Long Patterns from Databases. In: ACM SIGMOD Conf. Management of Data (June 1998)
Agrwal, J., Ramesh, J.C.: Analysis of Gene Microarray Data using Association Rule Mining. Journal of Computing 4(1) (January 2012)
Hughes, T., et al.: Functional Discovery via a Compendium of Expression Profiles. Cell 102, 109–126 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abd Allah, W.Z., El Sayed, Y.K., Mohamed Ghaleb, F.F. (2013). An Efficient and Scalable Algorithm for Mining Maximal. In: Perner, P. (eds) Machine Learning and Data Mining in Pattern Recognition. MLDM 2013. Lecture Notes in Computer Science(), vol 7988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39712-7_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-39712-7_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39711-0
Online ISBN: 978-3-642-39712-7
eBook Packages: Computer ScienceComputer Science (R0)