{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T11:40:30Z","timestamp":1725709230561},"publisher-location":"Dordrecht","reference-count":13,"publisher":"Springer Netherlands","isbn-type":[{"type":"print","value":"9789400758599"},{"type":"electronic","value":"9789400758605"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-94-007-5860-5_114","type":"book-chapter","created":{"date-parts":[[2012,12,10]],"date-time":"2012-12-10T12:00:32Z","timestamp":1355140832000},"page":"947-956","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Isomorphic Decision for Mining Sub Graphs with a Cyclic Form"],"prefix":"10.1007","author":[{"given":"Gangin","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Unil","family":"Yun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,12,11]]},"reference":[{"key":"114_CR1","doi-asserted-by":"crossref","unstructured":"Bifet A, Holmes G, Pfahringer B, Gavalda R (2011) Mining frequent closed graphs on evolving data streams. In: KDD\u201911 Proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining, pp 591\u2013599","DOI":"10.1145\/2020408.2020501"},{"key":"114_CR2","doi-asserted-by":"crossref","unstructured":"Bogdanov P, Mongiovi M, Singh AK (2011) Mining heavy subgraphs in time-evolving networks. ICDM, pp 81\u201390","DOI":"10.1109\/ICDM.2011.101"},{"key":"114_CR3","first-page":"133","volume":"6119","author":"S G\u00fcnnemann","year":"2010","unstructured":"G\u00fcnnemann S, Seidl T (2010) Subgraph mining on directed and weighted graphs. PAKDD 6119:133\u2013146","journal-title":"PAKDD"},{"key":"114_CR4","volume-title":"Data mining: concepts and techniques","author":"J Han","year":"2005","unstructured":"Han J, Kamber M (2005) Data mining: concepts and techniques. Morgan Kaufmann, Publishers, San Francisco"},{"issue":"3","key":"114_CR5","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s10115-009-0253-8","volume":"24","author":"M Lahiri","year":"2010","unstructured":"Lahiri M, Berger TY (2010) Periodic subgraph mining in dynamic networks. Knowl Inf Syst 24(3):467\u2013497","journal-title":"Knowl Inf Syst"},{"key":"114_CR6","unstructured":"Lini T, Thomas SR, Valluri KK (2006) MARGIN: Maximal frequent Subgraph mining. ICDM, pp 1097\u20131101"},{"issue":"1","key":"114_CR7","doi-asserted-by":"crossref","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":"114_CR8","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":"5","key":"114_CR9","first-page":"466","volume":"5","author":"A Silva","year":"2012","unstructured":"Silva A, Meira W Jr, Zaki MJ (2012) Mining attribute-structure correlated patterns in large attributed graphs. PVLDB 5(5):466\u2013477","journal-title":"PVLDB"},{"key":"114_CR10","unstructured":"Yan X, Han J (2002) gSpan: graph-based substructure pattern mining. In: Proceedings of the 2002 IEEE international conference on data mining, pp 721\u2013724"},{"issue":"4","key":"114_CR11","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1109\/TKDE.2010.224","volume":"24","author":"Y Zhiwen","year":"2012","unstructured":"Zhiwen Y, Zhiyong Y, Xingshe Z, Christian B, Yuichi N (2012) Tree-based mining for discovering patterns of human interaction in meetings. IEEE Trans Knowl Data Eng 24(4):759\u2013768","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"9","key":"114_CR12","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1109\/TKDE.2010.80","volume":"22","author":"Z Zou","year":"2010","unstructured":"Zou Z, Li J, Gao H, Zhang S (2010) Mining frequent subgraph patterns from uncertain graph data. IEEE Trans Knowl Data Eng 22(9):1203\u20131218","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"114_CR13","doi-asserted-by":"crossref","unstructured":"Zhu F, Yan X, Han J Yu PS (2007) gPrune: a constraint pushing framework for graph pattern mining. In: Proceeding 2007 Pacific-Asia conference on knowledge discovery and data mining (PAKDD\u201907), pp 388\u2013400","DOI":"10.1007\/978-3-540-71701-0_38"}],"container-title":["Lecture Notes in Electrical Engineering","IT Convergence and Security 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-94-007-5860-5_114","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T22:01:57Z","timestamp":1557439317000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-94-007-5860-5_114"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,11]]},"ISBN":["9789400758599","9789400758605"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-94-007-5860-5_114","relation":{},"ISSN":["1876-1100","1876-1119"],"issn-type":[{"type":"print","value":"1876-1100"},{"type":"electronic","value":"1876-1119"}],"subject":[],"published":{"date-parts":[[2012,12,11]]}}}