{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:15:37Z","timestamp":1743045337109,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540047605"},{"type":"electronic","value":"9783540361756"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36175-8_21","type":"book-chapter","created":{"date-parts":[[2007,7,3]],"date-time":"2007-07-03T16:17:08Z","timestamp":1183479428000},"page":"209-221","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Mining Frequent Instances on Workflows"],"prefix":"10.1007","author":[{"given":"Gianluigi","family":"Greco","sequence":"first","affiliation":[]},{"given":"Antonella","family":"Guzzo","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Manco","sequence":"additional","affiliation":[]},{"given":"Domenico","family":"Sacc\u00e0","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,4,30]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"R. Agrawal, D. Gunopulos, and F. Leymann. Mining Process Models from Workflow Logs. In Proc. 6th Int. Conf. on Extending Database Technology (EDBT), pages 469\u2013483, 1998.","DOI":"10.1007\/BFb0101003"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"R. Agrawal, T. Imielinski, and A. Swami. Mining Association Rules between Sets of Items in Large Databases. In Proc. ACM Conf. on Management of Data (SIGMOD93), pages 207\u2013216, 1993.","DOI":"10.1145\/170036.170072"},{"key":"21_CR3","unstructured":"R. Agrawal, and R. Srikant. Fast Algorithms for Mining Association Rules in Large Databases In Proc. 20th Int. Conf. on Very Large Data Bases(VLDB94), pages 487\u2013499, 1994."},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"R. Agrawal, and R. Srikant. Mining Sequential Patterns. In Proc. 11th Int. Conf. on Data Engineering (ICDE95), pages 3\u201314, 1995.","DOI":"10.1109\/ICDE.1995.380415"},{"issue":"1","key":"21_CR5","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/69.908981","volume":"13","author":"E. Cohen","year":"2001","unstructured":"E. Cohen, M. Datar, S. Fujiwara, A. Gionis, P. Indyk, R. Motwani, J. D. Ullman, and C. Yang. Finding Interesting Associations without Support Pruning. IEEE Transactions on Knowledge and Data Engineering, 13(1), pages 64\u201378, 2001.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"J. E. Cook, and A. L. Wolf. Automating Process Discovery Through Event-Data Analysis. In Proc. 17th Int. Conf. on Software Engineering (ICSE95), pages 73\u201382, 1995.","DOI":"10.1145\/225014.225021"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"H. Davulcu, M. Kifer, C. R. Ramakrishnan, and I. V. Ramakrishnan. Logic Based Modeling and Analysis of Workflows. In Proc. 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 25\u201333, 1998.","DOI":"10.1145\/275487.275491"},{"key":"21_CR8","unstructured":"U. Dayal, M. Hsu, and R. Ladin. Business Process Coordination: State of the Art, Trends, and Open Issues. In Proc. 27th Int. Conf. on Very Large Data Bases (VLBDB01), pages 3\u201313, 2001."},{"issue":"1","key":"21_CR9","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1009863704807","volume":"3","author":"L. Dehaspe","year":"1999","unstructured":"L. Dehaspe, and H. Toivonen. Discovery of Frequent DATALOG Patterns. Data Mining and Knowledge Discovery, 3(1), pages 7\u201336, 1999.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"T. Feder, P. Hell, S. Klein, and R. Motwani. Complexity of Graph Partition Problems. STOC, pages 464\u2013472, 1999","DOI":"10.1145\/301250.301373"},{"key":"21_CR11","volume-title":"A Guide to the Theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey, and D. S. Johnson. Computers and Intractability. A Guide to the Theory of NP-completeness, Freeman and Comp., NY, USA, 1979."},{"issue":"2","key":"21_CR12","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BF01277643","volume":"3","author":"D. Georgakopoulos","year":"1995","unstructured":"D. Georgakopoulos, M. Hornick, and A. Sheth. An overview of Workflow Management: From Process Modeling to Workflow Automation Infrastructure. Distributed and Parallel Databases, 3(2), pages 119\u2013153, 1995.","journal-title":"Distributed and Parallel Databases"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"M. Gillmann, W. Wonner, and G. Weikum. Workflow Management with Service Quality Guarantees. In Proc. ACM Conf. on Management of Data (SIGMOD02), 2002.","DOI":"10.1145\/564691.564718"},{"issue":"4","key":"21_CR14","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/s007780100056","volume":"10","author":"P. Grefen","year":"2001","unstructured":"P. Grefen, J. Vonk, and P. M. G. Apers. Global transaction support for workflow management systems: from formal specification to practical implementation. VLDB Journal 10(4), pages 316\u2013333, 2001.","journal-title":"VLDB Journal"},{"issue":"3","key":"21_CR15","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/PL00011672","volume":"3","author":"G. Lee","year":"2001","unstructured":"G. Lee, K. L. Lee, and A. L. P. Chen. Efficient Graph-Based Algorithms for Discovering and Maintaining Association Rules in Large Databases. Knowledge and Information Systems 3(3), pages 338\u2013355, 2001.","journal-title":"Knowledge and Information Systems"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"M. Kamath, and K. Ramamritham. Failure handling and coordinated execution of concurrent workflows. In Proc. 14th Int. Conf. on Data Engineering (ICDE98), pages 334\u2013341, 1998.","DOI":"10.1109\/ICDE.1998.655796"},{"issue":"1","key":"21_CR17","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/273244.273265","volume":"27","author":"P. Koksal","year":"1998","unstructured":"P. Koksal, S. N. Arpinar, and A. Dogac. Workflow History Management. SIGMOD Record, 27(1), pages 67\u201375, 1998.","journal-title":"SIGMOD Record"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"A. Inokuchi, T. Washio, and H. Motoda. An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data. In Proc. 4th European Conf. on Principles of Data Mining and Knowledge Discovery, pages 13\u201323, 2000.","DOI":"10.1007\/3-540-45372-5_2"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"T. Miyahara and others. Discovery of Frequent Tag Tree Patterns in Semistructured Web Documents. In Proc 6th Pacific-Asia Conf. on Advances in Knowledge Discovery and Data Mining, pages 356\u2013367, 2002.","DOI":"10.1007\/3-540-47887-6_35"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"W. M. P. van der Aalst, and K. M. van Hee. Workflow Management: Models, Methods, and Systems. MIT Press, 2002.","DOI":"10.7551\/mitpress\/7301.001.0001"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"D. Wodtke, and G. Weikum. A Formal Foundation for Distributed Workflow Execution Based on State Charts. In Proc. 6th Int. Conf. on Database Theory (ICDT97), pages 230\u2013246, 1997.","DOI":"10.1007\/3-540-62222-5_48"},{"key":"21_CR22","unstructured":"The Workflow Management Coalition, http:\/\/www.wfmc.org\/."},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"M. Zaki. Efficiently Mining Frequent Trees in a Forest. In Proc. 8th Int. Conf. On Knowledge Discovery and Data Mining (SIGKDD02), 2002. to appear.","DOI":"10.1145\/775047.775058"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36175-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T04:05:23Z","timestamp":1737173123000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-36175-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540047605","9783540361756"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-36175-8_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"30 April 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}