{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:10:15Z","timestamp":1743063015824,"version":"3.40.3"},"publisher-location":"Dordrecht","reference-count":9,"publisher":"Springer Netherlands","isbn-type":[{"type":"print","value":"9789400767379"},{"type":"electronic","value":"9789400767386"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-94-007-6738-6_24","type":"book-chapter","created":{"date-parts":[[2013,5,2]],"date-time":"2013-05-02T15:22:19Z","timestamp":1367508139000},"page":"185-192","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Frequent Graph Pattern Mining with Length-Decreasing Support Constraints"],"prefix":"10.1007","author":[{"given":"Gangin","family":"Lee","sequence":"first","affiliation":[]},{"given":"Unil","family":"Yun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,5,3]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"G\u00fcnnemann S, Seidl T (2010) Subgraph mining on directed and weighted graphs. In: Proceedings of the 14th Pacific-Asia conference on knowledge discovery and data mining, pp 133\u2013146","DOI":"10.1007\/978-3-642-13672-6_14"},{"issue":"1","key":"24_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10618-008-0106-1","volume":"17","author":"P Hintsanen","year":"2008","unstructured":"Hintsanen P, Toivonen H (2008) Finding reliable subgraphs from large probabilistic graphs. Data Mining Knowl Discov 17(1):3\u201323","journal-title":"Data Mining Knowl Discov"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Lee G, Yun U (2012) An efficient approach for mining frequent sub-graphs with support affinities. In: Proceedings of the 6th international conference on convergence and hybrid information technology, Korea, pp 525\u2013532","DOI":"10.1007\/978-3-642-32645-5_66"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Nijssen S, Kok JN (2004) A quickstart in frequent structure mining can make a difference. In: Proceedings of the tenth ACM SIGKDD international conference on knowledge discovery and data mining, pp 647\u2013652","DOI":"10.1145\/1014052.1014134"},{"issue":"1","key":"24_CR5","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.entcs.2004.12.039","volume":"127","author":"S Nijssen","year":"2005","unstructured":"Nijssen S, Kok JN (2005) The Gaston tool for frequent subgraph mining. Electron Notes Theor Comput Sci 127(1):77\u201387","journal-title":"Electron Notes Theor Comput Sci"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Ozaki T, Etoh M (2011) Closed and maximal subgraph mining in internally and externally weighted graph databases. In: 25th IEEE international conference on advanced information networking and applications workshops, pp 626\u2013631","DOI":"10.1109\/WAINA.2011.48"},{"issue":"1","key":"24_CR7","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10994-008-5089-z","volume":"75","author":"H Saigo","year":"2009","unstructured":"Saigo H, Nowozin S, Kadowaki T, Kudo T, Tsuda K (2009) gBoost: a mathematical programming approach to graph classification and regression. Mach Learn 75(1):69\u201389","journal-title":"Mach Learn"},{"issue":"3","key":"24_CR8","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s10618-005-0364-0","volume":"10","author":"M Seno","year":"2005","unstructured":"Seno M, Karypis G (2005) Finding frequent patterns using length-decreasing support constraints. Data Min Knowl Disc 10(3):197\u2013228","journal-title":"Data Min Knowl Disc"},{"issue":"4","key":"24_CR9","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1142\/S0219622010003968","volume":"9","author":"U Yun","year":"2010","unstructured":"Yun U, Ryu KH (2010) Discovering important sequential patterns with length-decreasing weighted support constraints. Int J Inf Technol Decis Making 9(4):575\u2013599","journal-title":"Int J Inf Technol Decis Making"}],"container-title":["Lecture Notes in Electrical Engineering","Multimedia and Ubiquitous Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-94-007-6738-6_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T14:45:56Z","timestamp":1675953956000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-94-007-6738-6_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9789400767379","9789400767386"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-94-007-6738-6_24","relation":{},"ISSN":["1876-1100","1876-1119"],"issn-type":[{"type":"print","value":"1876-1100"},{"type":"electronic","value":"1876-1119"}],"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"3 May 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}