{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T10:39:30Z","timestamp":1725791970099},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319058122"},{"type":"electronic","value":"9783319058139"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-05813-9_12","type":"book-chapter","created":{"date-parts":[[2014,4,16]],"date-time":"2014-04-16T07:57:50Z","timestamp":1397635070000},"page":"171-187","source":"Crossref","is-referenced-by-count":1,"title":["On Perspective-Aware Top-k Similarity Search in Multi-relational Networks"],"prefix":"10.1007","author":[{"given":"Yinglong","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Cuiping","family":"Li","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Likun","family":"Sheng","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Zhao, P., Li, X., Xin, D., Han, J.: Graph cube: On warehousing and olap multidimensional networks. In: SIGMOD Conference, pp. 853\u2013864 (2011)","key":"12_CR1","DOI":"10.1145\/1989323.1989413"},{"issue":"5","key":"12_CR2","first-page":"442","volume":"5","author":"Y. Fujiwara","year":"2012","unstructured":"Fujiwara, Y., Nakatsuji, M., Onizuka, M., Kitsuregawa, M.: Fast and exact top-k search for random walk with restart. PVLDB\u00a05(5), 442\u2013453 (2012)","journal-title":"PVLDB"},{"doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: Scaling personalized web search. In: WWW, pp. 271\u2013279 (2003)","key":"12_CR3","DOI":"10.1145\/775152.775191"},{"doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: Simrank: A measure of structural-context similarity. In: KDD, pp. 538\u2013543 (2002)","key":"12_CR4","DOI":"10.1145\/775047.775126"},{"doi-asserted-by":"crossref","unstructured":"Sarkar, P., Moore, A.W., Prakash, A.: Fast incremental proximity search in large graphs. In: ICML, pp. 896\u2013903 (2008)","key":"12_CR5","DOI":"10.1145\/1390156.1390269"},{"doi-asserted-by":"crossref","unstructured":"Sarkar, P., Moore, A.W.: Fast nearest-neighbor search in disk-resident graphs. In: KDD, pp. 513\u2013522 (2010)","key":"12_CR6","DOI":"10.1145\/1835804.1835871"},{"doi-asserted-by":"crossref","unstructured":"Avrachenkov, K., Litvak, N., Nemirovsky, D.: Quick detection of top-k personalized pagerank lists. In: WAW, pp. 50\u201361 (2011)","key":"12_CR7","DOI":"10.1007\/978-3-642-21286-4_5"},{"issue":"11","key":"12_CR8","first-page":"992","volume":"4","author":"Y. Sun","year":"2011","unstructured":"Sun, Y., Han, J., Yan, X., Yu, P.S., Wu, T.: Pathsim: Meta path-based top-k similarity search in heterogeneous information networks. PVLDB\u00a04(11), 992\u20131003 (2011)","journal-title":"PVLDB"},{"issue":"7307","key":"12_CR9","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1038\/nature09182","volume":"466","author":"Y.Y. Ahn","year":"2010","unstructured":"Ahn, Y.Y., Bagrow, J.P., Lehmann, S.: Link communities reveal multiscale complexity in networks. Nature\u00a0466(7307), 761\u2013764 (2010)","journal-title":"Nature"},{"key":"12_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/11564126_44","volume-title":"Knowledge Discovery in Databases: PKDD 2005","author":"D. Cai","year":"2005","unstructured":"Cai, D., Shao, Z., He, X., Yan, X., Han, J.: Community mining from multi-relational networks. In: Jorge, A.M., Torgo, L., Brazdil, P.B., Camacho, R., Gama, J. (eds.) PKDD 2005. LNCS (LNAI), vol.\u00a03721, pp. 445\u2013452. Springer, Heidelberg (2005)"},{"issue":"1","key":"12_CR11","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.joi.2009.06.004","volume":"4","author":"M.A. Rodriguez","year":"2010","unstructured":"Rodriguez, M.A., Shinavier, J.: Exposing multi-relational networks to single-relational network analysis algorithms. J. Informetrics\u00a04(1), 29\u201341 (2010)","journal-title":"J. Informetrics"},{"doi-asserted-by":"crossref","unstructured":"Berlingerio, M., Coscia, M., Giannotti, F.: Finding and characterizing communities in multidimensional networks. In: ASONAM 2011, pp. 490\u2013494 (2011)","key":"12_CR12","DOI":"10.1109\/ASONAM.2011.104"},{"doi-asserted-by":"crossref","unstructured":"Berlingerio, M., Coscia, M., Giannotti, F., Monreale, A., Pedreschi, D.: Foundations of multidimensional network analysis. In: ASONAM 2011, pp. 485\u2013489 (2011)","key":"12_CR13","DOI":"10.1109\/ASONAM.2011.103"},{"doi-asserted-by":"crossref","unstructured":"Zhao, P., Han, J., Sun, Y.: P-rank: A comprehensive structural similarity measure over information networks. In: CIKM, pp. 553\u2013562 (2009)","key":"12_CR14","DOI":"10.1145\/1645953.1646025"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s10115-009-0228-9","volume":"21","author":"C. Chen","year":"2009","unstructured":"Chen, C., Yan, X., Zhu, F., Han, J., Yu, P.: Graph olap: A multi-dimensional framework for graph data analysis. Knowledge and Information Systems\u00a021, 41\u201363 (2009)","journal-title":"Knowledge and Information Systems"},{"doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B.: Modern Graph Theory. Springer (1998)","key":"12_CR16","DOI":"10.1007\/978-1-4612-0619-4"},{"issue":"11","key":"12_CR17","first-page":"714","volume":"4","author":"L. Sun","year":"2011","unstructured":"Sun, L., Cheng, R., Li, X., Cheung, D.W., Han, J.: On link-based similarity join. PVLDB\u00a04(11), 714\u2013725 (2011)","journal-title":"PVLDB"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A.L. Barabasi","year":"1999","unstructured":"Barabasi, A.L., Albert, R.: Emergence of scaling in random networks. Science\u00a0286, 509\u2013512 (1999)","journal-title":"Science"},{"doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B.: Random Graphs. Cambridge University Press (2001)","key":"12_CR19","DOI":"10.1017\/CBO9780511814068"}],"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-319-05813-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T12:23:26Z","timestamp":1558873406000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-05813-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319058122","9783319058139"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-05813-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}