{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T06:10:21Z","timestamp":1738217421685,"version":"3.34.0"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540681243"},{"type":"electronic","value":"9783540681250"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68125-0_114","type":"book-chapter","created":{"date-parts":[[2008,5,10]],"date-time":"2008-05-10T07:40:05Z","timestamp":1210405205000},"page":"1062-1068","source":"Crossref","is-referenced-by-count":5,"title":["Efficient Mining of Minimal Distinguishing Subgraph Patterns from Graph Databases"],"prefix":"10.1007","author":[{"given":"Zhiping","family":"Zeng","sequence":"first","affiliation":[]},{"given":"Jianyong","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Lizhu","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"114_CR1","unstructured":"Ji, X., Bailey, J., Dong, G.: Mining minimal distinguishing subsequence patterns with gap constraints. In: ICDM 2005, Houston, Texas, USA, pp. 194\u2013201 (2005)"},{"key":"114_CR2","doi-asserted-by":"crossref","unstructured":"Li, J., Liu, H., Ng, S.-K., Wong, L.: Discovery of significant rules for classifying cancer diagnosis data. In: ECCB 2003, pp. 93\u2013102 (2003)","DOI":"10.1093\/bioinformatics\/btg1066"},{"key":"114_CR3","doi-asserted-by":"crossref","unstructured":"Ramamohanarao, K., Bailey, J., Fan, H.: Efficient mining of contrast patterns and their application to classification. In: ICISIP 2006, Bangalore, India (2006)","DOI":"10.1109\/ICISIP.2005.1619410"},{"key":"114_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"Secure Data Management","author":"R.M.H. Ting","year":"2006","unstructured":"Ting, R.M.H., Bailey, J.: Mining minimal contrast subgraph patterns. In: Jonker, W., Petkovi\u0107, M. (eds.) SDM 2006. LNCS, vol.\u00a04165, Springer, Heidelberg (2006)"},{"key":"114_CR5","doi-asserted-by":"crossref","unstructured":"Wang, J., Zeng, Z., Zhou, L.: Clan:an algorithm for mining closed cliques from large dense graph databases. In: ICDE 2006, April 2006, pp. 73\u201382 (2006)","DOI":"10.1109\/ICDE.2006.34"},{"key":"114_CR6","unstructured":"Yan, X., Han, J.: gspan: Graph-based substructure pattern mining. In: ICDM 2002, Washington, DC, USA, pp. 721\u2013724 (2002)"},{"key":"114_CR7","doi-asserted-by":"crossref","unstructured":"Zeng, Z., Wang, J., Zhou, L., Karypis, G.: Out-of-core coherent closed quasi-clique mining from large dense graph databases. ACM Transactions on Database Systems\u00a032(2) (2007)","DOI":"10.1145\/1242524.1242530"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68125-0_114.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T05:49:25Z","timestamp":1738216165000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68125-0_114"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540681243","9783540681250"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68125-0_114","relation":{},"subject":[]}}