A primer to frequent itemset mining for bioinformatics

Briefings in Bioinformatics

Volumn 16, Issue 2, 2015, Pages 216-231

  Naulaerts, Stefan ^a   Meysman, Pieter ^a   Bittremieux, Wout ^a   Vu, Trung Nghia ^a   Berghe, Wim Vanden ^a   Goethals, Bart ^a   Laukens, Kris ^a  

^a UNIVERSITY OF ANTWERP   (Belgium)

Author keywords

Association rule; Biclustering; Frequent item set; Market basket analysis; Pattern mining

Indexed keywords

ALGORITHM; ANIMAL; AUTOMATED PATTERN RECOGNITION; BIOLOGY; CLUSTER ANALYSIS; DATA MINING; GENE EXPRESSION PROFILING; GENE REGULATORY NETWORK; HIGH THROUGHPUT SEQUENCING; HUMAN; SINGLE NUCLEOTIDE POLYMORPHISM; SOFTWARE; STATISTICS AND NUMERICAL DATA;

ALGORITHMS; ANIMALS; CLUSTER ANALYSIS; COMPUTATIONAL BIOLOGY; DATA MINING; GENE EXPRESSION PROFILING; GENE REGULATORY NETWORKS; HIGH-THROUGHPUT NUCLEOTIDE SEQUENCING; HUMANS; PATTERN RECOGNITION, AUTOMATED; POLYMORPHISM, SINGLE NUCLEOTIDE; SOFTWARE;

EID: 84925392773     PISSN: 14675463     EISSN: 14774054     Source Type: Journal    
DOI: 10.1093/bib/bbt074     Document Type: Article

References (102)

1. Agrawal R, Imieliński T, Swami A. Mining association rules between sets of items in large databases. In:Proceedings of the 1993 ACMSIGMODInternational Conference on Management of Data,Washington, DC, USA, 1993, Vol. 22. New York: ACM, 207-16.
2. Carmona-Saez P, Chagoyen M, Rodriguez A, et al. Integrated analysis of gene expression by association rules discovery. BMC Bioinformatics 2006;7:54.
3. Manda P, Ozkan S, Wang H, et al. Cross-ontology multilevel association rule mining in the gene ontology. PLoS One 2012;7:e47411.
4. Koyutürk M, Kim Y, Subramaniam S, et al. Detecting conserved interaction patterns in biological networks. J Comput Biol 2006;13:1299-322.
5. Yoon Y, Lee GG. Subcellular localization prediction through boosting association rules. IEEE/ACM Trans Comput Biol Bioinform 2012;9:609-18.
6. Agrawal R, Srikant R. Fast algorithms for mining association rules. In: Bocca JB, Jarke M, Zaniolo C (eds). Proceedings of the 20th VLDB Conference. Santiago: Morgan Kaufman, 1994, 487-99.
7. Goethals B. Frequent Set Mining. In: Maimon O, Rokach L (eds). The Data Mining and Knowledge Discovery Handbook. Heidelberg: Springer Berlin, 2010, 321-38.
8. Tan P-N, Steinbach M, Kumar V. Chapter 6. Association analysis: basic concepts and algorithms. Introduction to Data Mining. Addison-Wesley: Boston, 2005, 769.
9. Antonie ML, Zai{dotless}ane OR. Mining positive and negative association rules: an approach for confined rules. In:Boulicaut JF, Esposito F, Giannotti F, Pedreschi D (eds). Knowledge Discovery in Databases: PKDD 2004. Heidelberg:Springer Berlin, 2004, 27-38.
10. Besson J, Boulicaut JF, Guns T, Nijssen S. Generalizing itemset mining in a constraint programming setting. In:Džeroski S, Goethals B, Panov P (eds). Inductive Databases and Constraint-Based Data Mining. Heidelberg: Springer Berlin, 2010, 107-26.
11. Tan P-N, Kumar V, Srivastava J. Selecting the right interestingness measure for association patterns. In: Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, Alberta, Canada, 2002. New York: ACM, 32-41.
12. Franceschini A, Szklarczyk D, Frankild S, et al. STRING v9.1: protein-protein interaction networks, with increased coverage and integration. Nucleic Acids Res 2012;41:D808-15.
13. Zaki M, Parthasarathy S, Ogihara M, Li W. New algorithms for fast discovery of association rules. In: Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining (KDD). Newport Beach, CA, USA, 1997. Palo Alto, CA: AAAI Press, 283-6.
14. Han J, Pei J, Yin Y, et al. Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min KnowlDiscov 2004;8:53-87.
15. Artamonova II, Frishman G, Gelfand MS, et al. Mining sequence annotation databanks for association patterns. Bioinformatics 2005;21:iii49-57.
16. Karpinets TV, Park BH, Uberbacher EC. Analyzing large biological datasets with association networks. Nucleic Acids Res 2012;40:e131.
17. Leung K-S, Wong K-C, Chan T-M, et al. Discovering protein-DNA binding sequence patterns using association rule mining. Nucleic Acids Res 2010;38:6324-37.
18. Ha N, Polychronidou M, Lohmann I. COPS: detecting cooccurrence and spatial arrangement of transcription factor binding motifs in genome-wide datasets. PLoS One 2012;7:e52055.
19. Kim J, Zhao S, Heber S. Finding association rules of cis-regulatory elements involved in alternative splicing. In:Proceedings of the 45th Annual Southeast Regional Conference, Winstom-Salem,NC,USA, 2007. New York: ACM, 232-37.
20. Tweedie-Cullen RY, Brunner AM, Grossmann J, et al. Identification of combinatorial patterns of post-translational modifications on individual histones in the mouse brain. PLoS One 2012;7:e36980.
21. Zaki MJ, Jin S, Bystroff C. Mining residue contacts in proteins using local structure predictions. Trans Sys Man Cyber Part B 2003;33:789-801.
22. Aung Z, Tan KL. Automatic protein structure classification through structural fingerprinting. In: Proceedings of the 4th IEEE symposium on Bioinformatics and Bioengeering (BIBE 2004), Taichung, Taiwan, 2004. Washington, DC: IEEE Computer Society, 508-15.
23. Icev A, Ruiz C, Ryder EF. Distance-Enhanced Association Rules for Gene Expression. In: Proceedings of the 3rd ACM SIGKDD Workshop on Data Mining in Bioinformatics (BIOKDD 2003),Washington, DC, USA, 2003. New York:ACM.
24. Zhou C, Meysman P, Cule B, et al. Mining spatially cohesive itemsets in protein molecular structures. In: Proceedingsof the 12th InternationalWorkshop on DataMining in Bioinformatics (BIOKDD 2013), Chicago, IL, 2013. accepted. New York:ACM.
25. Meydan C, Out HH, Sezerman OU. Prediction of peptides binding to MHC class I and II alleles by temporal motif mining. BMC Bioinformatics 2013;14(Suppl 2):S13.
26. Siu WY, Mamoulis N, Yiu SM, Chan HL. A data-mining approach for multiple structural alignment of proteins. Bioinformation 2011;4:366-70.
27. Lopez FJ, Blanco A, Garcia F, et al. Fuzzy association rules for biological data analysis: a case study on yeast. BMC Bioinformatics 2008;9:107.
28. Alves R, Rodriguez-Baena DS, Aguilar-Ruiz JS. Gene association analysis: a survey of frequent pattern mining from gene expression data. Brief Bioinform 2010;11:210-24.
29. Serin A, Vingron M. DeBi: Discovering differentially expressed biclusters using a frequent itemset approach. AlgorithmsMol Biol 2011;6:18.
30. Mukhopadhyay A, Maulik U, Bandyopadhyay S. A novel biclustering approach to association rule mining for predicting HIV-1-human protein interactions. PLoS One 2013;7:e32289.
31. Remmerie N, de Vijlder T, Valkenborg D, et al. Unraveling tobacco BY-2 protein complexes with BN PAGE/LCMS/MS and clustering methods. J Proteomics 2011;74:1201-17.
32. Becquet C, Blachon S, Jeudy B, et al. Strong-associationrule mining for large-scale gene-expression data analysis: a case study on human SAGE data. Genome Biol 2002;3:research0067.
33. Creighton C, Hanash S. Mining gene expression databases for association rules. Bioinformatics 2003;19:79-86.
34. Tuzhilin A. Handling very large numbers of association rules in the analysis of microarray data. proc. In:Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, Alberta, Canada, 2002. New York: ACM, 23-6.
35. Bayardo RJ. Efficiently mining long patterns from databases. In: Proceedings of the 1998 ACMSIGMODInternational Conference on Management of Data, Seattle,WA, USA, 1998, Vol. 27. New York: ACM, 85-93.
36. Gouda K, Zaki MJ. GenMax: an efficient algorithm for mining maximal frequent itemsets. Data Min Knowl Discov 2005;11:223-42.
37. Cai R, Hao Z, Wen W, et al. Kernel based gene expression pattern discovery and its application on cancer classification. Neurocomputing 2010;73:2562-70.
38. Georgii E, Richter L, Rückert U, et al. Analyzing microarray data using quantitative association rules. Bioinformatics 2005;11:123-9.
39. Pan F, Cong G, Tung AK, et al. Carpenter: finding closed patterns in long biological datasets. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and DataMining,Washington, DC, USA, 2003. New York: ACM, 637-42.
40. Pan F, Tung A, Cong G, et al. COBBLER: combining column and row enumeration for closed pattern discovery. In: Proceedings of the16th InternationalConference on Scientific and Statistical Database Management SSDBM, Santorini Island, Greece, 2004. Washington, DC: IEEE Computer Society, 21-30.
41. Cong G, Tung AK, Xu X, et al. FARMER: finding interesting rule groups in microarray datasets. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Paris, France, 2004. New York: ACM, 143-54.
42. Liu H, Han J, Xin D, et al. Top-Down Mining of Interesting Patterns from Very High Dimensional Data. In: Proceedings of the 22nd international conference on Data Engineering, Long Beach, California, USA, 2006. Washington, DC: IEEE Computer Society, 114.
43. Cong G, Tan K, Tung AK, et al. Mining top-K covering rule groups for gene expression data. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Baltimore,MD,USA, 2005. New York: ACM, 670-81.
44. Ashburner M, Ball CA, Blake JA, et al. Gene ontology: tool for the unification of biology. Nat Genet 2000;25:25-9.
45. Kanehisa M, Goto S. KEGG: kyoto encyclopedia of genes and genomes. Nucleic Acids Res 2000;28:27-30.
46. Martinez R, Pasquier N, Pasquier C. Mining association rule bases from integrated genomic data and annotations. In: Masulli F, Tagliaferri R, Verkhivker GM (eds). Computational Intelligence Methods for Bioinformatics and Biostatistics. Heidelberg: Springer Berlin, 2009, 78-90.
47. Tseng VS, Yu H-H, Yang S-C. Efficient mining of multilevel gene association rules from microarray and gene ontology. Inf Syst Front 2009;11:433-47.
48. Liu Y-C, Cheng C-P, Tseng VS. Discovering relationalbased association rules with multiple minimum supports on microarray datasets. Bioinformatics 2011;27:3142-8.
49. Lemmens K, De Bie T, Dhollander T, et al. The conditiondependent transcriptional network in Escherichia coli. AnnN YAcad Sci 2009;1158:29-35.
50. Wang M, Wu S, Cai R. Two novel interestingness measures for gene association rule mining. Neural Comput Appl 2013;23:835-41.
51. Ma L, Assimes T, Asadi N, et al. An almost exhaustive search-based sequential permutation method for detecting epistasis in disease association studies. Genet Epidemiol 2010;34:434-43.
52. Fang G, Haznadar M, Wang W, et al. High-order SNP combinations associated with complex diseases: efficient discovery, statistical power and functional interactions. PLoS One 2012;7:e33531.
53. Shoemaker CA, Ruiz C. Association rule mining algorithms for set-valued data. In: Liu J, Cheung Y, Yin H (eds). Intelligent Data Engineering and Automated Learning. Heidelberg: Springer Berlin, 2003, 669-76.
54. Liu G, Wang Y, Wong L. FastTagger: an efficient algorithm for genome-wide tag SNP selection using multi-marker linkage disequilibrium. BMC Bioinformatics 2010;11:66.
55. Van Leemput K, Verschoren A. Modeling networks as probabilistic sequences of frequent subgraphs. http://win. ua.ac.be/~adrem/bibrem/pubs/MLSB08.pdf (16 October 2013, date last accessed).
56. Bringmann B, Nijssen S. What Is Frequent in a Single Graph? In: Washio T, Suzuki E, Ting KM, Inokuchi A (eds). Advances in Knowledge Discovery and Data Mining. Heidelberg: Springer Berlin, 2008, 858-63.
57. Inokuchi A, Washio T, Motoda H. An Apriori-based algorithm for mining frequent substructures from graph data. PrincDataMin KnowlDiscov 2000;1910:13-23.
58. Kuramochi M, Karypis G. Frequent Subgraph Discovery. In: Proceedings of the 2001IEEE International Conference on Data Mining, San Jose, California, USA, 2001. Washington, DC:IEEE Computer Society, 313-20.
59. Yan X, Han J. gSpan: graph-based substructure pattern mining. In: Proceedings of the 2002 IEEE International Conference on Data Mining, Maebashi City, Japan, 2002. Washington, DC: IEEE Computer Society, 721-4.
60. Yan X, Han J. CloseGraph: mining closed frequent graph patterns. In: Proceedings of the 9thACMSIGKDDInternational Conference on Knowledge Discovery and Data Mining, Washington,DC,USA, 2003. New York: ACM, 286-95.
61. Nijssen S, Kok JN. The gaston tool for frequent subgraph mining. ElectronNotesTheor Comput Sci 2005;127:77-87.
62. Hu H, Yan X, Huang Y, et al. Mining coherent dense subgraphs across massive biological networks for functional discovery. Bioinformatics 2005;21:213-21.
63. Pandey G, Garg T, Steinbach M, et al. Association analysisbased transformations for protein interaction networks: a function prediction case study. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Jose, CA, USA, 2007. New York: ACM, 540-9.
64. Bebek G, Yang J. PathFinder: mining signal transduction pathway segments from protein-protein interaction networks. BMC Bioinformatics 2007;8:335.
65. Besemann C, Denton A, Yekkirala A, et al. Differential association rule mining for the study of protein-protein interaction networks. In: Proceedings of the 4thWorkshop on DataMining in Bioinformatics (SigKDD2004). Toronto, ON:ACM, 2004, 72-80.
66. Oyama T, Kitano K, Satou K, et al. Extraction of knowledge on protein-protein interaction by association rule discovery. Bioinformatics 2002;18:705-14.
67. Liu B, Hsu W, Ma Y. Integrating classification and association rule mining. In: Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining, NewYork, NY, USA,1998. Palo Alto, CA: AAAI Press, 335-40.
68. Li W, Han J, Pei J. CMAR: accurate and efficient classification based on multiple class-association rules. In:Proceedings of the IEEE international conference on Data Mining (ICDM 2001). San Jose, CA, USA, 2001. Washington, DC:IEEE Computer Society, 369-76.
69. Yin X, Han J. CPAR: classification based on predictive association rules. In: Proceedings of the SIAM International Conference onDataMining (SDM'03). San Francisco, CA, USA, 2003. Philadelphia: SIAM, 331-5.
70. Vapnik VN. The nature of statistical learning theory. In:Jordan M, Lawless JF, Lauritzen SL (eds). Statistics for Engineering and Information Science. New York: Springer New York, 1995.
71. He J, Hu H, Chen B, et al. Rule extraction from SVM for protein structure prediction. Rule Extr Support Vector Mach 2008;80:227-52.
72. Giugno R, Pulvirenti A, Cascione L, et al. MIDClass:Microarray Data Classification by association rules and gene expression intervals. PLoS One 2013;8:e69873.
73. Antonie L, Bessonov K. Classifying microarray data with association rules. In: Proceedings of the 2011ACMSymposiumon Applied Computing. Taichung, Taiwan, 2011. New York:ACM, 94-9.
74. Karabatak M, Ince MC. An expert system for detection of breast cancer based on association rules and neural network. Expert Syst Appl 2009;36:3465-9.
75. Park SH, Reyes JA, Gilbert DR, et al. Prediction of proteinprotein interaction types using association rule based classification. BMC Bioinformatics 2009;10:36.
76. Tang Y, Jin B, Zhang Y-Q. Granular support vector machines with association rules mining for protein homology prediction. Artif IntellMed 2005;35:121-34.
77. Tamura M, D'haeseleer P. Microbial genotype-phenotype mapping by class association rule mining. Bioinformatics 2008;24:1523-29.
78. He Y, Hui SC. Exploring ant-based algorithms for gene expression data analysis. Artif IntellMed 2009;47:105-19.
79. Tang L, Zhang L, Luo P, et al. Incorporating occupancy into frequent pattern mining for high quality pattern recommendation (CIKM'12). In: Proceedings of the 21st ACM international conference on Information and Knowledge Management.Maui,Hawaii, 2012. New York: ACM, 75-84.
80. Tatti N, Mampaey M. Using background knowledge to rank itemsets. DataMin Knowl Discov 2010;21:293-309.
81. Bayardo JR, Agrawal R, Gunopulos D. Constraint-based rule mining in large, dense databases. Data Min Knowl Discov 2000;4:217-40.
82. Webb GI. Discovering significant patterns. Mach Learn 2007;68:1-33.
83. Vreeken J, van Leeuwen M, Siebes A. Krimp: mining itemsets that compress. Data Min Knowl Discov 2011;23:169-214.
84. Hahsler M, Chelluboina S, Hornik K, et al. The arules Rpackage ecosystem: analyzing interesting patterns from large transaction data sets. JMach Learn Res 2011;12:2021-5.
85. Leung CK-S, Carmichael CL. FpViz: a visualizer for frequent pattern mining. In: Proceedings of the ACM SIGKDD Workshop on Visual Analytics and Knowledge Discovery: Integrating Automated Analysis with Interactive Exploration (VAK'09), Paris, France. New York: ACM, 2009, 30-9.
86. Leung CK-S, Irani PP, Carmichael CL. WiFIsViz:Effective Visualization of Frequent Itemsets. In: Proceedings of the eighth IEEE international conference on Data Mining (ICDM'08), Pisa, Italy, 2008. Washington, DC: IEEE Computer Society, 875-80.
87. Lallich S, Teytaud O, Prudhomme E. Association rule interestingness:measure and statistical validation. In: Guillet F, Hamilton HJ (eds). Quality Measures in DataMining, Vol. 43. Heidelberg: Springer Berlin, 2007, 251-75.
88. Benjamini Y, Liu W. A step-down multiple hypotheses testing procedure that controls the false discovery rate under independence. JStat Planning Inf 1999;82:163-70.
89. Benjamini Y, Hochberg Y. Controlling the false discovery rate: a practical and powerful approach to multiple testing. JRStat Soc 1995;57:289-300.
90. Liu G, Zhang H, Wong L. Controlling false positives in association rule mining. ProcVldb Endow 2011;5:145-56.
91. Dong G, Li J. Efficient Mining of Emerging Patterns:Discovering Trends and Differences. In: Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining (KDD'99), San Diego, CA, USA. New York: ACM, 1999, 43-52.
92. Bailey J, Manoukian T, Ramamohanarao K. Fast Algorithms for Mining Emerging Patterns. Princ Data Min KnowlDiscov 2002;2431:39-50.
93. Chen X, Chen J. Emerging patterns and classification algorithms for DNA sequence. J Softw 2011;6:6.
94. Borgelt C. Frequent item set mining. Wiley Interdisciplinary Reviews. Data Min Knowl Discov 2012;2:437-56.
95. Burdick D, Calimlim M, Gehrke J. MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases. In: Proceedings of the 17th International Conference on Data Engineering, Heidelberg, Germany, 2001. Washington, DC:IEEE Computer Society, 443-52.
96. McIntosh T, Chawla S. High confidence rule mining for microarray analysis. IEEE/ACM Trans Comput Biol Bioinformatics 2007;4:611-23.
97. Cristofor L, Simovici D. Generating an informative cover for association rules. In: Proceedings of the 2002 IEEE International Conference on Data Mining, Maebashi City, Japan, 2002. Washington, DC: IEEE Computer Society, 597-600.
98. Berthold MR, Cebron N, Dill F, et al. KNIME-the Konstanz information miner: version 2.0 and beyond. SIGKDDExplorNewslett 2009;11:26-31.
99. Goethals B, Moens S, Vreeken J. MIME: a framework for interactive visual pattern mining. In: Proceedings of the 2011 European Conference on Machine Learning and Knowledge Discovery in Databases - Volume Part III, Athens, Greece, 2011. Heidelberg: Springer Berlin, 634-7.
100. Demšar J, Zupan B, Leban G, Curk T. Orange: from experimental machine learning to interactive data mining. In:Boulicaut JF, et al (ed). Knowledge Discovery in Databases (PKDD'04). Heidelberg: Springer Berlin, 2004, 537-9.
101. Mierswa I, Wurst M, Klinkenberg R, et al. YALE: rapid prototyping for complex data mining tasks. In: Ungar L, Craven M, Gunopulos D, Eliassi-Rad T (eds). In:Proceedings of the 12th ACMSIGKDDInternational Conference on Knowledge Discovery and Data Mining (KDD'06), Philadelphia, PA,USA. New York: ACM, 2006, 935-40.
102. Hall M, Frank E, Holmes G, et al. The WEKA data mining software: an update. SIGKDD Explor Newsl 2009;11:10-8.