{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T21:05:55Z","timestamp":1725829555816},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319240749"},{"type":"electronic","value":"9783319240756"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-24075-6_60","type":"book-chapter","created":{"date-parts":[[2015,9,11]],"date-time":"2015-09-11T11:05:56Z","timestamp":1441969556000},"page":"623-633","source":"Crossref","is-referenced-by-count":9,"title":["Fast Graph Similarity Search via Locality Sensitive Hashing"],"prefix":"10.1007","author":[{"given":"Boyu","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Xianglong","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Bo","family":"Lang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,22]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.S.: Locality-sensitive hashing scheme based on p-stable distributions. In: SCG, pp. 253\u2013262. ACM (2004)","key":"60_CR1","DOI":"10.1145\/997817.997857"},{"doi-asserted-by":"crossref","unstructured":"Ding, C., He, X.: K-means clustering via principal component analysis. In: ICML, p. 29. ACM (2004)","key":"60_CR2","DOI":"10.1145\/1015330.1015408"},{"issue":"6","key":"60_CR3","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1016\/S0167-8655(01)00017-4","volume":"22","author":"ML Fern\u00e1ndez","year":"2001","unstructured":"Fern\u00e1ndez, M.L., Valiente, G.: A graph distance metric combining maximum common subgraph and minimum common supergraph. Pattern Recogn. Lett. 22(6), 753\u2013758 (2001)","journal-title":"Pattern Recogn. Lett."},{"issue":"1","key":"60_CR4","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10044-008-0141-y","volume":"13","author":"X Gao","year":"2010","unstructured":"Gao, X., Xiao, B., Tao, D., Li, X.: A survey of graph edit distance. Pattern Anal. Appl. 13(1), 113\u2013129 (2010)","journal-title":"Pattern Anal. Appl."},{"unstructured":"He, H., Singh, A.K.: Closure-tree: An index structure for graph queries. In: ICDE, pp. 38\u201338. IEEE (2006)","key":"60_CR5"},{"doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: STOC, pp. 604\u2013613. ACM (1998)","key":"60_CR6","DOI":"10.1145\/276698.276876"},{"issue":"3","key":"60_CR7","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1109\/TMM.2008.917421","volume":"10","author":"CY Li","year":"2008","unstructured":"Li, C.Y., Hsu, C.T.: Image retrieval with relevance feedback based on graph-theoretic region correspondence estimation. IEEE Trans. Multimedia 10(3), 447\u2013456 (2008)","journal-title":"IEEE Trans. Multimedia"},{"doi-asserted-by":"crossref","unstructured":"Liu, X., He, J., Deng, C., Lang, B.: Collaborative hashing. In: IEEE CVPR, pp. 2147\u20132154. IEEE (2014)","key":"60_CR8","DOI":"10.1109\/CVPR.2014.275"},{"doi-asserted-by":"crossref","unstructured":"Liu, X., He, J., Lang, B.: Reciprocal hash tables for nearest neighbor search. In: AAAI. AAAI Press (2013)","key":"60_CR9","DOI":"10.1609\/aaai.v27i1.8582"},{"unstructured":"Lv, Q., Josephson, W., Wang, Z., Charikar, M., Li, K.: Multi-probelsh: efficient indexing for high-dimensional similarity search. In: VLDB, pp. 950\u2013961. VLDB Endowment (2007)","key":"60_CR10"},{"key":"60_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-89689-0_33","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"K Riesen","year":"2008","unstructured":"Riesen, K., Bunke, H.: Iam graph database repository for graph basedpattern recognition and machine learning. In: da Vitoria Lobo, N., Kasparis, T., Roli, F., Kwok, J.T., Georgiopoulos, M., Anagnostopoulos, G.C., Loog, M. (eds.) SSPR & SPR 2008. LNCS, vol. 5342, pp. 287\u2013297. Springer, Heidelberg (2008)"},{"issue":"7","key":"60_CR12","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1016\/j.imavis.2008.04.004","volume":"27","author":"K Riesen","year":"2009","unstructured":"Riesen, K., Bunke, H.: Approximate graph edit distance computation by means of bipartite graph matching. Image Vis. Comput. 27(7), 950\u2013959 (2009)","journal-title":"Image Vis. Comput."},{"unstructured":"Shervashidze, N., Borgwardt, K.M.: Fast subtree kernels on graphs. In: NIPS, pp. 1660\u20131668 (2009)","key":"60_CR13"},{"doi-asserted-by":"crossref","unstructured":"Tabei, Y., Tsuda, K.: Kernel-based similarity search in massive graph databases with wavelet trees. In: SDM, pp. 154\u2013163. SIAM (2011)","key":"60_CR14","DOI":"10.1137\/1.9781611972818.14"},{"issue":"3","key":"60_CR15","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1109\/TKDE.2010.28","volume":"24","author":"G Wang","year":"2012","unstructured":"Wang, G., Wang, B., Yang, X., Yu, G.: Efficiently indexing large sparse graphs for similarity search. IEEE Trans. Knowl. Data Eng. 24(3), 440\u2013451 (2012)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"doi-asserted-by":"crossref","unstructured":"Wang, X., Ding, X., Tung, A., Ying, S., Jin, H.: An efficient graph indexing method. In: ICDE, pp. 210\u2013221. IEEE (2012)","key":"60_CR16","DOI":"10.1109\/ICDE.2012.28"},{"issue":"suppl 2","key":"60_CR17","doi-asserted-by":"publisher","first-page":"W623","DOI":"10.1093\/nar\/gkp456","volume":"37","author":"Y Wang","year":"2009","unstructured":"Wang, Y., Xiao, J., Suzek, T.O., Zhang, J., Wang, J., Bryant, S.H.: Pubchem: a public information system for analyzing bioactivities of small molecules. Nucleic Acids Res. 37(suppl 2), W623\u2013W633 (2009)","journal-title":"Nucleic Acids Res."},{"doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P.S., Han, J.: Substructure similarity search in graph databases. In: ACM SIGMOD, pp. 766\u2013777. ACM (2005)","key":"60_CR18","DOI":"10.1145\/1066157.1066244"},{"issue":"1","key":"60_CR19","first-page":"25","volume":"2","author":"Z Zeng","year":"2009","unstructured":"Zeng, Z., Tung, A.K., Wang, J., Feng, J., Zhou, L.: Comparing stars: on approximating graph edit distance. VLDB 2(1), 25\u201336 (2009)","journal-title":"VLDB"}],"container-title":["Lecture Notes in Computer Science","Advances in Multimedia Information Processing -- PCM 2015"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-24075-6_60","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,14]],"date-time":"2023-08-14T00:06:21Z","timestamp":1691971581000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-24075-6_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319240749","9783319240756"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-24075-6_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}