{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:08:32Z","timestamp":1725556112364},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642136719"},{"type":"electronic","value":"9783642136726"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13672-6_43","type":"book-chapter","created":{"date-parts":[[2010,5,18]],"date-time":"2010-05-18T14:38:17Z","timestamp":1274193497000},"page":"449-463","source":"Crossref","is-referenced-by-count":4,"title":["BASSET: Scalable Gateway Finder in Large Graphs"],"prefix":"10.1007","author":[{"given":"Hanghang","family":"Tong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Spiros","family":"Papadimitriou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Faloutsos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip S.","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tina","family":"Eliassi-Rad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"43_CR1","doi-asserted-by":"crossref","unstructured":"Aditya, B., Bhalotia, G., Chakrabarti, S., Hulgeri, A., Nakhe, C., Parag, S.S.: Banks: Browsing and keyword searching in relational databases. In: VLDB, pp. 1083\u20131086 (2002)","DOI":"10.1016\/B978-155860869-6\/50114-1"},{"key":"43_CR2","doi-asserted-by":"crossref","unstructured":"Balmin, A., Hristidis, V., Papakonstantinou, Y.: Objectrank: Authority-based keyword search in databases. In: VLDB, pp. 564\u2013575 (2004)","DOI":"10.1016\/B978-012088469-8.50051-6"},{"key":"43_CR3","doi-asserted-by":"crossref","unstructured":"Faloutsos, C., McCurley, K.S., Tomkins, A.: Fast discovery of connection subgraphs. In: KDD, pp. 118\u2013127 (2004)","DOI":"10.1145\/1014052.1014068"},{"key":"43_CR4","doi-asserted-by":"crossref","unstructured":"Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry, 35\u201341 (1977)","DOI":"10.2307\/3033543"},{"key":"43_CR5","doi-asserted-by":"crossref","unstructured":"Geerts, F., Mannila, H., Terzi, E.: Relational link-based ranking. In: VLDB, pp. 552\u2013563 (2004)","DOI":"10.1016\/B978-012088469-8.50050-4"},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"He, J., Li, M., Zhang, H.-J., Tong, H., Zhang, C.: Manifold-ranking based image retrieval. ACM Multimedia, 9\u201316 (2004)","DOI":"10.1145\/1027527.1027531"},{"key":"43_CR7","doi-asserted-by":"crossref","unstructured":"Koren, Y., North, S.C., Volinsky, C.: Measuring and extracting proximity in networks. In: KDD, pp. 245\u2013255 (2006)","DOI":"10.1145\/1150402.1150432"},{"key":"43_CR8","unstructured":"Krause, A., Guestrin, C.: Near-optimal nonmyopic value of information in graphical models. In: UAI, pp. 324\u2013331 (2005)"},{"key":"43_CR9","doi-asserted-by":"crossref","unstructured":"Liben-Nowell, D., Kleinberg, J.: The link prediction problem for social networks. In: Proc. CIKM (2003)","DOI":"10.1145\/956863.956972"},{"key":"43_CR10","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.socnet.2004.11.009","volume":"27","author":"M. Newman","year":"2005","unstructured":"Newman, M.: A measure of betweenness centrality based on random walks. Social Networks\u00a027, 39\u201354 (2005)","journal-title":"Social Networks"},{"key":"43_CR11","doi-asserted-by":"crossref","unstructured":"Pan, J.-Y., Yang, H.-J., Faloutsos, C., Duygulu, P.: Automatic multimedia cross-modal correlation discovery. In: KDD, pp. 653\u2013658 (2004)","DOI":"10.1145\/1014052.1014135"},{"key":"43_CR12","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1137\/1032080","volume":"32","author":"W. Piegorsch","year":"1990","unstructured":"Piegorsch, W., Casella, G.E.: Inverting a sum of matrices. SIAM Review\u00a032, 470 (1990)","journal-title":"SIAM Review"},{"key":"43_CR13","doi-asserted-by":"crossref","unstructured":"Tong, H., Faloutsos, C.: Center-piece subgraphs: problem definition and fast solutions. In: KDD, pp. 404\u2013413 (2006)","DOI":"10.1145\/1150402.1150448"},{"key":"43_CR14","doi-asserted-by":"crossref","unstructured":"Tong, H., Faloutsos, C., Gallagher, B., Eliassi-Rad, T.: Fast best-effort pattern matching in large attributed graphs. In: KDD, pp. 737\u2013746 (2007)","DOI":"10.1145\/1281192.1281271"},{"key":"43_CR15","doi-asserted-by":"crossref","unstructured":"Tong, H., Faloutsos, C., Pan, J.-Y.: Random walk with restart: Fast solutions and applications. Knowledge and Information Systems: An International Journal, KAIS (2008)","DOI":"10.1007\/s10115-007-0094-2"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13672-6_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,28]],"date-time":"2021-10-28T00:00:21Z","timestamp":1635379221000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13672-6_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642136719","9783642136726"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13672-6_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}