{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T01:12:04Z","timestamp":1654132324189},"reference-count":31,"publisher":"IGI Global","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,10,1]]},"abstract":"<p>In this tutorial article, the author reviews basics about frequent pattern mining algorithms, including itemset mining, association rule mining, and graph mining. These algorithms can find frequently appearing substructures in discrete data. They can discover structural motifs, for example, from mutation data, protein structures, and chemical compounds. As they have been primarily used for business data, biological applications are not so common yet, but their potential impact would be large. Recent advances in computers including multicore machines and ever increasing memory capacity support the application of such methods to larger datasets. The author explains technical aspects of the algorithms, but do not go into details. Current biological applications are summarized and possible future directions are given.<\/p>","DOI":"10.4018\/ijkdb.2012100101","type":"journal-article","created":{"date-parts":[[2014,2,12]],"date-time":"2014-02-12T15:41:44Z","timestamp":1392219704000},"page":"1-14","source":"Crossref","is-referenced-by-count":0,"title":["Data Mining for Biologists"],"prefix":"10.4018","volume":"3","author":[{"given":"Koji","family":"Tsuda","sequence":"first","affiliation":[{"name":"Max Planck Institute for Biological Cybernetics, T\u00fcbingen, Germany"}]}],"member":"2432","reference":[{"key":"ijkdb.2012100101-0","unstructured":"Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules in large databases. Proc. VLDB 1994 (pp. 487\u2013499)."},{"key":"ijkdb.2012100101-1","doi-asserted-by":"crossref","unstructured":"Asai, T., Abe, K., Kawasoe, S., Arimura, H., Sakamoto, H., & Arikawa, S. (2002). Efficient substructure discovery from large semi-structured data. Proc 2nd SIAM Data Mining Conference (SDM) (pp. 158\u2013174).","DOI":"10.1137\/1.9781611972726.10"},{"key":"ijkdb.2012100101-2","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkl198"},{"key":"ijkdb.2012100101-3","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btg037"},{"key":"ijkdb.2012100101-4","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti1007"},{"key":"ijkdb.2012100101-5","doi-asserted-by":"crossref","unstructured":"Cong, G., Tan, K.-L., Tung, A., & Xu, X. (2005). Mining top-k covering rule groups for gene expression data. Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data (pp. 670\u2013681).","DOI":"10.1145\/1066157.1066234"},{"key":"ijkdb.2012100101-6","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/19.1.79"},{"key":"ijkdb.2012100101-7","unstructured":"Fiedler, M., & Borgelt, C. (2007). Support computation for mining frequent subgraphs in a single graph. Mining and Learning with Graphs (MLG)."},{"key":"ijkdb.2012100101-8","doi-asserted-by":"crossref","unstructured":"Gasteiger, J., & Engel, T. (2003). Chemoinformatics: A textbook. Wiley-VCH.","DOI":"10.1002\/3527601643"},{"key":"ijkdb.2012100101-9","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl431"},{"key":"ijkdb.2012100101-10","unstructured":"Han, J., & Kamber, M. (2000). Data mining: Concepts and techniques. Morgan Kaufmann."},{"key":"ijkdb.2012100101-11","unstructured":"Inokuchi, A. (2005). Mining generalized substructures from a set of labeled graphs. Proceedings of the 4th IEEE Internatinal Conference on Data Mining (pp. 415\u2013418). IEEE Computer Society."},{"key":"ijkdb.2012100101-12","doi-asserted-by":"publisher","DOI":"10.1021\/ci0503715"},{"key":"ijkdb.2012100101-13","unstructured":"Liu, B., Hsu, W., & Ma, Y. (1998). Integrating classification and association rule mining. Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining (KDD-98) (pp. 80\u201386)."},{"key":"ijkdb.2012100101-14","doi-asserted-by":"publisher","DOI":"10.1002\/bip.360290621"},{"key":"ijkdb.2012100101-15","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0409515102"},{"key":"ijkdb.2012100101-16","doi-asserted-by":"publisher","DOI":"10.1126\/science.298.5594.824"},{"key":"ijkdb.2012100101-17","doi-asserted-by":"crossref","unstructured":"Nijssen, S., & Kok, J. (2004). A quickstart in frequent structure mining can make a difference. Proceedings of the 10th ACM SIGKDD International Conference on Know ledge Discovery and Data Mining (pp. 647\u2013652). ACM Press.","DOI":"10.1145\/1014052.1014134"},{"key":"ijkdb.2012100101-18","doi-asserted-by":"crossref","unstructured":"Nowozin, S., Bakir, G., & Tsuda, K. (2007). Discriminative subsequence mining for action classification. Proceedings of the 11th IEEE International Conference on Computer Vision (ICCV 2007). IEEE Computer Society.","DOI":"10.1109\/ICCV.2007.4409049"},{"key":"ijkdb.2012100101-19","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.77"},{"key":"ijkdb.2012100101-20","article-title":"gBoost: a mathematical programming approach to graph classification and regression.","author":"H.Saigo","year":"2008","journal-title":"Machine Learning"},{"key":"ijkdb.2012100101-21","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btm353"},{"key":"ijkdb.2012100101-22","doi-asserted-by":"crossref","unstructured":"Schoelkopf, B., Tsuda, K., & Vert, J. (Eds.). (2004). Kernel methods for computational biology. MIT Press.","DOI":"10.7551\/mitpress\/4057.001.0001"},{"key":"ijkdb.2012100101-23","unstructured":"Sun, G., Liu, X., Cong, G., Zhou, M., Xiong, Z., Lin, C.-Y., & Lee, J. (2007). Detecting erroneous sentences using automatically mined sequential patterns. ACL 2007, Proceedings of the 45th Annual Meeting of the Association for Computational Linguistics."},{"key":"ijkdb.2012100101-24","article-title":"Microbial genotype-phenotype mapping by class association rule mining.","author":"M.Tamura","year":"2008","journal-title":"Bioinformatics (Oxford, England)"},{"key":"ijkdb.2012100101-25","first-page":"267","article-title":"Regression shrinkage and selection via LASSO. J. R. Stat. Soc. Ser. B","volume":"58","author":"R.Tibshirani","year":"1996","journal-title":"Statistical Methodology"},{"key":"ijkdb.2012100101-26","doi-asserted-by":"crossref","unstructured":"Tsuda, K. (2007). Entire regularization paths for graph data. Proceedings of the 24th International Conference on Machine Learning (pp. 919\u2013926).","DOI":"10.1145\/1273496.1273612"},{"key":"ijkdb.2012100101-27","doi-asserted-by":"crossref","unstructured":"Uno, T., Kiyomi, M., & Arimura, H. (2005). LCM ver.3: collaboration of array, bitmap and prefix tree for freque nt itemset mining. OSDM \u201905: Proceedings of the 1st international workshop on open so urce data mining (pp. 77\u201386). Chicago, Illinois.","DOI":"10.1145\/1133905.1133916"},{"key":"ijkdb.2012100101-28","unstructured":"Yan, X., & Han, J. (2002). gSpan: graph-based substructure pattern mining. Proceedings of the 2002 IEEE International Conference on Data Mining (pp. 721\u2013724). IEEE Computer Society."},{"key":"ijkdb.2012100101-29","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btk008"},{"key":"ijkdb.2012100101-30","doi-asserted-by":"crossref","unstructured":"Zaki, M., Parthasarathy, S., Ogihara, M., & Li, W. (1997). New algorithms for fast discovery of association rules. Proc. KDD 1997 (pp. 283\u2013286).","DOI":"10.1007\/978-1-4615-5669-5_1"}],"container-title":["International Journal of Knowledge Discovery in Bioinformatics"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=101239","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T00:43:14Z","timestamp":1654130594000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/ijkdb.2012100101"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2012,10,1]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,10]]}},"URL":"https:\/\/doi.org\/10.4018\/ijkdb.2012100101","relation":{},"ISSN":["1947-9115","1947-9123"],"issn-type":[{"value":"1947-9115","type":"print"},{"value":"1947-9123","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,1]]}}}