{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:44:17Z","timestamp":1725745457187},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642402692"},{"type":"electronic","value":"9783642402708"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40270-8_7","type":"book-chapter","created":{"date-parts":[[2013,8,17]],"date-time":"2013-08-17T05:41:48Z","timestamp":1376718108000},"page":"79-85","source":"Crossref","is-referenced-by-count":1,"title":["Measuring Proximity in a Graph of Spatial Data (ZIP Codes)"],"prefix":"10.1007","author":[{"given":"M. Harist","family":"Murdani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joonho","family":"Kwon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Koren, Y., North, S.C., Volinsky, C.: Measuring and Extracting Proximity Graphs in Networks. In: ACM (2007)","DOI":"10.1145\/1297332.1297336"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-34213-4_13","volume-title":"Search Computing III","author":"S. Cohen","year":"2012","unstructured":"Cohen, S., Kimelfeld, B., Koutrika, G.: A Survey on Proximity Measures for Social Networks. In: Ceri, S., Brambilla, M. (eds.) Search Computing III. LNCS, vol.\u00a07538, pp. 191\u2013206. Springer, Heidelberg (2012)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Carmel, D., Zwerdling, N., Guy, I., Ofek-Koifman, S., Har\u2019el, N., Ronen, I., Uziel, E., Yogev, S., Chernov, S.: Personalized social search based on the user\u2019s social network. In: CIKM, pp. 1227\u20131236 (2009)","DOI":"10.1145\/1645953.1646109"},{"issue":"7","key":"7_CR4","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1002\/asi.20591","volume":"58","author":"D. Liben-Nowell","year":"2007","unstructured":"Liben-Nowell, D., Kleinberg, J.M.: The link-prediction problem for social networks. JASIST\u00a058(7), 1019\u20131031 (2007)","journal-title":"JASIST"},{"issue":"4","key":"7_CR5","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1140\/epjb\/e2009-00335-8","volume":"71","author":"T. Zhou","year":"2009","unstructured":"Zhou, T., Lu, L., Zhang, Y.C.: Predicting missing links via local information. The European Physical Journal\u00a071(4), 623\u2013630 (2009)","journal-title":"The European Physical Journal"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Faloutsos, C., McCurley, K.S., Tomkins, A.: Fast discovery of connection subgraphs. In: ACM SIGKDD Conference, pp. 118\u2013127 (2004)","DOI":"10.1145\/1014052.1014068"},{"key":"7_CR7","unstructured":"MapTechnica, \n                    \n                      www.maptechnica.com"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40270-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T18:11:32Z","timestamp":1558030292000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40270-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642402692","9783642402708"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40270-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}