{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,3]],"date-time":"2026-10-03T09:29:51Z","timestamp":1791019791961,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540245254","type":"print"},{"value":"9783540322627","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-32262-7_1","type":"book-chapter","created":{"date-parts":[[2010,12,20]],"date-time":"2010-12-20T20:48:08Z","timestamp":1292878088000},"page":"1-20","source":"Crossref","is-referenced-by-count":13,"title":["Towards Generic Pattern Mining"],"prefix":"10.1007","author":[{"given":"Mohammed J.","family":"Zaki","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nagender","family":"Parimi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nilanjana","family":"De","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Feng","family":"Gao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Benjarath","family":"Phoophakdee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joe","family":"Urban","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vineet","family":"Chaoji","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammad Al","family":"Hasan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Saeed","family":"Salem","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"1_CR1","first-page":"307","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"R. Agrawal","year":"1996","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Inkeri Verkamo, A.: Fast discovery of association rules. In: Fayyad, U., et al. (eds.) Advances in Knowledge Discovery and Data Mining, pp. 307\u2013328. AAAI Press, Menlo Park (1996)"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Srikant, R.: Mining sequential patterns. In: 11th Intl. Conf. on Data Engg. (1995)","DOI":"10.1109\/ICDE.1995.380415"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Asai, T., Abe, K., Kawasoe, S., Arimura, H., Satamoto, H., Arikawa, S.: Efficient substructure discovery from large semi-structured data. In: 2nd SIAM Int\u2019l Conference on Data Mining (April 2002)","DOI":"10.1137\/1.9781611972726.10"},{"key":"1_CR4","volume-title":"Generic Programming and the STL","author":"M.H. Austern","year":"1999","unstructured":"Austern, M.H.: Generic Programming and the STL. Addison Wesley Longman, Inc., Amsterdam (1999)"},{"issue":"2","key":"1_CR5","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/380995.381017","volume":"2","author":"Yves Bastide","year":"2000","unstructured":"Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., Lakhal, L.: Mining frequent patterns with counting inference. SIGKDD Explorations, 2(2) (December 2000)","journal-title":"ACM SIGKDD Explorations Newsletter"},{"key":"1_CR6","unstructured":"Burdick, D., Calimlim, M., Gehrke, J.: MAFIA: a maximal frequent itemset algorithm for transactional databases. In: Intl. Conf. on Data Engineering (April 2001)"},{"key":"1_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-540-24775-3_9","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Y. Chi","year":"2004","unstructured":"Chi, Y., Yang, Y., Xia, Y., Muntz, R.R.: Cmtreeminer: Mining both closed and maximal frequent subtrees. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol.\u00a03056, pp. 63\u201373. Springer, Heidelberg (2004)"},{"issue":"1","key":"1_CR8","first-page":"60","volume":"6","author":"D. Cristofor","year":"2000","unstructured":"Cristofor, D., Cristofor, L., Simovici, D.: Galois connection and data mining. Journal of Universal Computer Science\u00a06(1), 60\u201373 (2000)","journal-title":"Journal of Universal Computer Science"},{"key":"1_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis: Mathematical Foundations","author":"B. Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1999)"},{"issue":"1","key":"1_CR10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1145\/1007730.1007744","volume":"6","author":"Bart Goethals","year":"2004","unstructured":"Goethals, B., Zaki, M.J.: Advances in frequent itemset mining implementations: report on FIMI 2003. SIGKDD Explorations, 6(1) (June 2003)","journal-title":"ACM SIGKDD Explorations Newsletter"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Gouda, K., Zaki, M.J.: Efficiently mining maximal frequent itemsets. In: 1st IEEE Int\u2019l Conf. on Data Mining (November 2001)","DOI":"10.1109\/ICDM.2001.989514"},{"key":"1_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-45372-5_2","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"A. Inokuchi","year":"2000","unstructured":"Inokuchi, A., Washio, T., Motoda, H.: An apriori-based algorithm for mining frequent substructures from graph data. In: Zighed, D.A., Komorowski, J., \u017bytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol.\u00a01910, pp. 13\u201323. Springer, Heidelberg (2000)"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-540-30570-5_15","volume-title":"Database Theory - ICDT 2005","author":"J.L. Balcazar","year":"2005","unstructured":"Balcazar, J.L., Casas-Garriga, G.: On horn axiomatizations for sequential data. In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol.\u00a03363, pp. 215\u2013229. Springer, Heidelberg (2005)"},{"key":"1_CR14","unstructured":"Knizhnik, K.: Gigabase, object-relational database management system, http:\/\/sourceforge.net\/projects\/gigabase"},{"issue":"4","key":"1_CR15","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1142\/S021821309700027X","volume":"6","author":"R. Kohavi","year":"1997","unstructured":"Kohavi, R., Sommerfield, D., Dougherty, J.: Data mining using mlc++, a machine learning library in c++. International Journal of Artificial Intelligence Tools\u00a06(4), 537\u2013566 (1997)","journal-title":"International Journal of Artificial Intelligence Tools"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: 1st IEEE Int\u2019l Conf. on Data Mining (November 2001)","DOI":"10.1109\/ICDM.2001.989534"},{"key":"1_CR17","unstructured":"Nijssen, S., Kok, J.N.: Efficient discovery of frequent unordered trees. In: 1st Int\u2019l Workshop on Mining Graphs, Trees and Sequences (2003)"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/3-540-49257-7_25","volume-title":"Database Theory - ICDT\u201999","author":"N. Pasquier","year":"1999","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 398\u2013416. Springer, Heidelberg (1999)"},{"key":"1_CR19","unstructured":"Pei, J., Han, J., Mao, R.: Closet: An efficient algorithm for mining frequent closed itemsets. In: SIGMOD Int\u2019l Workshop on Data Mining and Knowledge Discovery (May 2000)"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Srikant, R., Agrawal, R.: Mining sequential patterns: Generalizations and performance improvements. In: 5th Intl. Conf. Extending Database Technology (March 1996)","DOI":"10.1007\/BFb0014140"},{"key":"1_CR21","unstructured":"Termier, A., Rousset, M.-C., Sebag, M.: Dryade: a new approach for discovering closed frequent trees in heterogeneous tree databases. In: IEEE Int\u2019l Conf. on Data Mining (2004)"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Wang, J., Han, J., Pei, J.: Closet+: Searching for the best strategies for mining frequent closed itemsets. In: ACM SIGKDD Int\u2019l Conf. on Knowledge Discovery and Data Mining (August 2003)","DOI":"10.1145\/956755.956779"},{"key":"1_CR23","unstructured":"Wang, J., Han, J.: Bide: Efficient mining of frequent closed sequences. In: IEEE Int\u2019l Conf. on Data Engineering (2004)"},{"key":"1_CR24","unstructured":"Wippler, J.-C.: Metakit, http:\/\/www.equi4.com\/metakit\/"},{"key":"1_CR25","volume-title":"Data Mining: Practical Machine Learning Tools and Techniques with Java Implementations","author":"I.H. Witten","year":"1999","unstructured":"Witten, I.H., Frank, E.: Data Mining: Practical Machine Learning Tools and Techniques with Java Implementations. Morgan Kaufmann Publishers, San Francisco (1999)"},{"key":"1_CR26","unstructured":"Yan, X., Han, J.: gspan: Graph-based substructure pattern mining. In: IEEE Int\u2019l Conf. on Data Mining (2002)"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Yan, X., Han, J.: Closegraph: Mining closed frequent graph patterns. In: ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining (August 2003)","DOI":"10.1145\/956750.956784"},{"issue":"3","key":"1_CR28","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"M.J. Zaki","year":"2000","unstructured":"Zaki, M.J.: Scalable algorithms for association mining. IEEE Transactions on Knowledge and Data Engineering\u00a012(3), 372\u2013390 (2000)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1\/2","key":"1_CR29","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1023\/A:1007652502315","volume":"42","author":"M.J. Zaki","year":"2001","unstructured":"Zaki, M.J.: SPADE: An efficient algorithm for mining frequent sequences. Machine Learning Journal\u00a042(1\/2), 31\u201360 (2001)","journal-title":"Machine Learning Journal"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Efficiently mining frequent trees in a forest. In: 8th ACM SIGKDD Int\u2019l Conf. Knowledge Discovery and Data Mining (July 2002)","DOI":"10.1145\/775047.775058"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Hsiao, C.-J.: CHARM: An efficient algorithm for closed itemset mining. In: 2nd SIAM International Conference on Data Mining (April 2002)","DOI":"10.1137\/1.9781611972726.27"},{"key":"1_CR32","unstructured":"Zaki, M.J., Ogihara, M.: Theoretical foundations of association rules. In: 3rd ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (June 1998)"}],"container-title":["Lecture Notes in Computer Science","Formal Concept Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-32262-7_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:34:57Z","timestamp":1605760497000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-32262-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245254","9783540322627"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-32262-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}