Integration of profile hidden Markov model output into association rule mining

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2005, Pages 538-543

  Besemann, Christopher ^a   Denton, Anne ^a  

^a North Dakota State University   (United States)

Author keywords

Association rule mining; Model mining; Profile hidden Markov model

Indexed keywords

DATA MINING; FUNCTIONS;

ASSOCIATION RULE MINING; MODEL MINING; PROFILE HIDDEN MARKOV MODEL;

MARKOV PROCESSES;

EID: 32344447269     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1081870.1081933     Document Type: Conference Paper

References (29)

1. R. Agrawal, T. Imielinskl, and A. N. Swami, Mining association rules between sets of items in large databases. In Proceedings International Conference on Management of Data, pages 207-216, 1993.
2. R. Agrawal and R. Srikant. Mining sequential patterns. In Eleventh International Conference on Data Engineering, pages 3-14, 1995.
3. A. Apostolico and L. Parida. Incremental paradigms of motif discovery. Computational Biology, 11(1):15-25, 2004.
4. J. Ayres, J. Flannick, J. Gehrke, and T. Yiu. Sequential pattern mining using a bitmap representation. In Proceedings International Conference on Knowledge Discovery and Data Mining, pages 429-35, 2002.
5. A. Bateman, L. Coin, R. Durbin, R. D. Finn, V. Hollich, S. Griffiths-Jones, A. Khanna, M. Marshall, S. Moxon, E. L. L. Sonnhammer, D. J. Studholme, C. Yeats, and S. R. Eddy, The pfam protein families database. Nucleic Acids Research: Database Issue, 32:D138-D141, 2004.
6. C. Besemann, A. Denton, A. Yekkirala, R. Hutchison, and M. Anderson. Differential association rule mining for the study of protein-protein interaction networks. In Proceedings 4th Workshop on Data Mining in Bioinformatica at SIGKDD, 2004.
7. F. Bonchi, F. Giannotti, A. Mazzantil, and D. Pedreschil. Exante: Anticipated data reduction in constrained pattern mining. In Proceedings of PKDD, 2003.
8. C. Borgelt. Apriori. http://fuzzy.cs.uni-magdeburg.de/~borgelt/software.html, accessed August 2003.
9. R. Durbin, S. Eddy, and G. Mitchison, Biological Sequence Analysis. Cambridge University Press, 8th edition, 2003.
10. S. Eddy. Hmmer. http://hmmer.wuatl.edu/, accessed May 2004.
11. S. R. Eddy. Profile hidden markov models. Bioinformatics Review, 14(9):755-63, 1998.
12. S. Henikoff, J. G. Henikoff, W. J. Alford, and S. Pietrokovski, Automated construction and graphical presentation of protein blocks from unaligned sequences. Gene-COMBIS, 163:GC 17-26, 1995.
13. J. Hollmen, J. K. Seppanen, and H. Mannila. Mixture models and frequent sets: combining global and local methods for 0-1 data. In Proceedings of SIAM International Conference on Data Mining, May 2003.
14. A. Inokuchi, T. Washio, and H. Motoda. An apriori-based algorithm for mining frequent substructures from graph data. In Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery, pages 13-23, 2000.
15. A. Krogh. Computational Methods in Molecular Biology, chapter An Introduction to hidden Markov models for biological sequences, pages 45-63. Elsevier, 1998.
16. M. H. Law and J. T. Kwok, Rival penalized competitive learning for model-based sequence clustering. In Proceedings of the International Conference on Pattern Recognition, pages 195-198, 2000.
17. H. Mannila. Local and global methods in data mining: Basic techniques and open problems. In Proceedings of the International Colloquium on Automata, Languages and Programming, 2002.
18. H. Mannila, H. Toivonen, and A. I. Verkamo. Discovering frequent episodes in sequences, In Proceedings of the First International Conference on Knowledge Discovery and Data Mining, 1995.
19. H. Mewes, D. Frishman, et al. Mips: a database for genomes and protein sequences. Nucleic Acids Research, 30(1):31-44, 2002.
20. R. T. Ng, L. V. Lakshmanan, J. Han, and A. Pang. Exploratory mining and pruning optimizations of constrained associations rules. In Proceedings of the ACM SIGMOD Conference, pages 13-24, 1998.
21. A. Panuccio, M. Bicego, and V. Murino, A hidden markov model-based approach to sequential data clustering. In Structural, Syntactic and Statistical Pattern Recognition, pages 734-742, 2002.
22. J. Pel, J. Han, and L. V. Lakshmanan, Pushing convertible constraints in frequent itemset mining. Data Mining and Knowledge Discovery, 8:227-252, 2004.
23. F. Provost, T. Fawcett, and R. Kohavi. The case against accuracy estimation for comparing induction algorithms. In Proc. 15th International Conf. on Machine Learning, pages 445-453, Morgan Kaufmann, San Francisco, CA, 1998.
24. V. Pudi and J. R. Haritsa. Armor: Association rule mining based on oracle. In Proceedings Workshop on Frequent Itemset Mining Implementations at ICDM, 2003.
25. I. Shmulevich, E. Dougherty, and W. Zhang, From boolean to probabilistic boolean networks as models of genetic regulatory networks, In Proceedings of the IEEE, volume 90, pages 1778-1792, 2002.
26. P. Smyth. Clustering sequences with hidden markov models. In Advances in Neural Information Processing Systems, volume 9, page 648, 1997.
27. R. Srlkant, Q. Vu, and R. Agrawal. Mining association rules with item constraints. In Proc. 3rd Int. Conf. Knowledge Discovery and Data Mining, KDD, pages 67-73, 1997.
28. X. Yan and J. Han. gspan: Graph-based substructure pattern mining. In Proceedings of the International Conference on Data Mining, 2002.
29. M. J. Zaki and M. Ogihara. Theoretical foundations of association rules, In DMKD 98, pages 7:1-7:8, 1998.