{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T04:25:01Z","timestamp":1745987101706,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642373817"},{"type":"electronic","value":"9783642373824"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37382-4_10","type":"book-chapter","created":{"date-parts":[[2013,3,25]],"date-time":"2013-03-25T10:09:33Z","timestamp":1364206173000},"page":"138-154","source":"Crossref","is-referenced-by-count":0,"title":["Finding the Most Descriptive Substructures in Graphs with Discrete and Numeric Labels"],"prefix":"10.1007","author":[{"given":"Michael","family":"Davis","sequence":"first","affiliation":[]},{"given":"Weiru","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Miller","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Bishop, C.M.: Pattern Recognition and Machine Learning. Springer (2006)","key":"10_CR1"},{"doi-asserted-by":"crossref","unstructured":"Borgelt, C.: Canonical forms for frequent graph mining. In: 30th Annual Conf. German Classification Society, GfKl 2006, pp. 337\u2013349. Springer (2006)","key":"10_CR2","DOI":"10.1007\/978-3-540-70981-7_38"},{"issue":"2","key":"10_CR3","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1145\/335191.335388","volume":"29","author":"M.M. Breunig","year":"2000","unstructured":"Breunig, M.M., Kriegel, H.P., Ng, R.T., Sander, J.: LOF: Identifying density-based local outliers. SIGMOD Rec.\u00a029(2), 93\u2013104 (2000)","journal-title":"SIGMOD Rec."},{"doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-MAT: A recursive model for graph mining. In: SDM 2004. SIAM (2004)","key":"10_CR4","DOI":"10.1137\/1.9781611972740.43"},{"key":"10_CR5","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/5254.850825","volume":"15","author":"D.J. Cook","year":"2000","unstructured":"Cook, D.J., Holder, L.B.: Graph-based data mining. IEEE Intelligent Systems\u00a015, 32\u201341 (2000)","journal-title":"IEEE Intelligent Systems"},{"doi-asserted-by":"crossref","unstructured":"Davis, M., Liu, W., Miller, P., Redpath, G.: Detecting anomalies in graphs with numeric labels. In: CIKM 2011, pp. 1197\u20131202. ACM (2011)","key":"10_CR6","DOI":"10.1145\/2063576.2063749"},{"doi-asserted-by":"crossref","unstructured":"Eichinger, F., Huber, M., B\u00f6hm, K.: On the usefulness of weight-based constraints in frequent subgraph mining. In: ICAI 2010, pp. 65\u201378. BCS SGAI (December 2010)","key":"10_CR7","DOI":"10.1007\/978-0-85729-130-1_5"},{"unstructured":"Fortin, S.: The graph isomorphism problem. Tech. rep., Univ. of Alberta (1996)","key":"10_CR8"},{"doi-asserted-by":"crossref","unstructured":"Huan, J., Wang, W., Prins, J., Yang, J.: SPIN: Mining maximal frequent subgraphs from graph databases. In: KDD 2004, pp. 581\u2013586. ACM (2004)","key":"10_CR9","DOI":"10.1145\/1014052.1014123"},{"key":"10_CR10","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":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-15105-7_7","volume-title":"Data Warehousing and Knowledge Discovery","author":"C. Jiang","year":"2010","unstructured":"Jiang, C., Coenen, F., Zito, M.: Frequent sub-graph mining on edge weighted graphs. In: Bach Pedersen, T., Mohania, M.K., Tjoa, A.M. (eds.) DAWAK 2010. LNCS, vol.\u00a06263, pp. 77\u201388. Springer, Heidelberg (2010)"},{"issue":"1","key":"10_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1497577.1497578","volume":"3","author":"H.P. Kriegel","year":"2009","unstructured":"Kriegel, H.P., Kr\u00f6ger, P., Zimek, A.: Clustering high-dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clustering. ACM Transactions on Knowledge Discovery in Data 3(1), 1:1\u20131:58 (2009)","journal-title":"ACM Transactions on Knowledge Discovery in Data"},{"doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: ICDM 2001, pp. 313\u2013320. IEEE (2001)","key":"10_CR13","DOI":"10.1109\/ICDM.2001.989534"},{"unstructured":"McKay, B.D., Piperno, A.: Practical graph isomorphism, II (January 2013), http:\/\/arxiv.org\/abs\/1301.1493v1","key":"10_CR14"},{"doi-asserted-by":"crossref","unstructured":"Moser, F., Colak, R., Rafiey, A., Ester, M.: Mining cohesive patterns from graphs with feature vectors. In: SDM, pp. 593\u2013604 (2009)","key":"10_CR15","DOI":"10.1137\/1.9781611972795.51"},{"doi-asserted-by":"crossref","unstructured":"Papadimitriou, S., Kitagawa, H., Gibbons, P., Faloutsos, C.: Loci: fast outlier detection using the local correlation integral. In: Proceedings of the 19th International Conference on Data Engineering 2003, pp. 315\u2013326 (March 2003)","key":"10_CR16","DOI":"10.1109\/ICDE.2003.1260802"},{"doi-asserted-by":"crossref","unstructured":"de Vries, T., Chawla, S., Houle, M.: Finding local anomalies in very high dimensional space. In: ICDM 2010, pp. 128\u2013137. IEEE (2010)","key":"10_CR17","DOI":"10.1109\/ICDM.2010.151"},{"unstructured":"Yan, X., Han, J.: gSpan: Graph-based substructure pattern mining. In: ICDM 2002, pp. 721\u2013724. IEEE (2002)","key":"10_CR18"},{"doi-asserted-by":"crossref","unstructured":"Yan, X., Han, J.: CloseGraph: Mining closed frequent graph patterns. In: KDD 2003, pp. 286\u2013295. ACM (2003)","key":"10_CR19","DOI":"10.1145\/956755.956784"}],"container-title":["Lecture Notes in Computer Science","New Frontiers in Mining Complex Patterns"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37382-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T01:53:31Z","timestamp":1745978011000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37382-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642373817","9783642373824"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37382-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}