{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,23]],"date-time":"2022-06-23T15:11:49Z","timestamp":1655997109105},"reference-count":14,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2017]]},"DOI":"10.1587\/transinf.2016awi0002","type":"journal-article","created":{"date-parts":[[2017,3,31]],"date-time":"2017-03-31T22:23:25Z","timestamp":1490999005000},"page":"610-620","source":"Crossref","is-referenced-by-count":5,"title":["Fast Ad-Hoc Search Algorithm for Personalized PageRank"],"prefix":"10.1587","volume":"E100.D","author":[{"given":"Yasuhiro","family":"FUJIWARA","sequence":"first","affiliation":[{"name":"NTT Software Innovation Center"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Makoto","family":"NAKATSUJI","sequence":"additional","affiliation":[{"name":"NTT Resonant"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroaki","family":"SHIOKAWA","sequence":"additional","affiliation":[{"name":"University of Tsukuba"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeshi","family":"MISHIMA","sequence":"additional","affiliation":[{"name":"NTT Software Innovation Center"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Makoto","family":"ONIZUKA","sequence":"additional","affiliation":[{"name":"Osaka University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] L. Page, S. Brin, R. Motwani, and T. Winograd, \u201cThe PageRank citation ranking: Bringing order to the web,\u201d Technical Report 1999-66, Stanford InfoLab, Nov. 1999."},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] A. Balmin, V. Hristidis, and Y. Papakonstantinou, \u201cObjectrank: Authority-based keyword search in databases,\u201d VLDB, pp.564-575, 2004.","DOI":"10.1016\/B978-012088469-8.50051-6"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] G. Jeh and J. Widom, \u201cScaling personalized web search,\u201d WWW, pp.271-279, 2003.","DOI":"10.1145\/775152.775191"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] J.-Y. Pan, H.-J. Yang, C. Faloutsos, and P. Duygulu, \u201cAutomatic multimedia cross-modal correlation discovery,\u201d KDD, pp.653-658, 2004.","DOI":"10.1145\/1014052.1014135"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] H. Tong, C. Faloutsos, and J.-Y. Pan, \u201cFast random walk with restart and its applications,\u201d ICDM, pp.613-622, 2006.","DOI":"10.1109\/ICDM.2006.70"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] Y. Fujiwara, M. Nakatsuji, M. Onizuka, and M. Kitsuregawa, \u201cFast and exact top-k search for random walk with restart,\u201d PVLDB, vol.5, no.5, pp.442-453, 2012.","DOI":"10.14778\/2140436.2140441"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] Y. Fujiwara, M. Nakatsuji, T. Yamamuro, H. Shiokawa, and M. Onizuka, \u201cEfficient personalized pagerank with accuracy assurance,\u201d KDD, 2012.","DOI":"10.1145\/2339530.2339538"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] D. Fogaras, B. R\u00e1cz, K. Csalog\u00e1ny, and T. Sarl\u00f3s, \u201cTowards scaling fully personalized pagerank: Algorithms, lower bounds, and experiments,\u201d Internet Mathematics, vol.2, no.3, pp.333-358, 2005.","DOI":"10.1080\/15427951.2005.10129104"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] B. Bahmani, A. Chowdhury, and A. Goel, \u201cFast incremental and personalized pagerank,\u201d PVLDB, vol.4, no.3, pp.173-184, 2010.","DOI":"10.14778\/1929861.1929864"},{"key":"10","unstructured":"[10] H. Shiokawa, Y. Fujiwara, and M. Onizuka, \u201cFast algorithm for modularity-based graph clustering,\u201d AAAI, pp.1170-1176, 2013."},{"key":"11","unstructured":"[11] D.A. Harville, Matrix Algebra From a Statistician's Perspective, Springer, 2008."},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] K. Avrachenkov, N. Litvak, D. Nemirovsky, E. Smirnova, and M. Sokol, \u201cQuick detection of top-k personalized pagerank lists,\u201d WAW, vol.6732, pp.50-61, 2011.","DOI":"10.1007\/978-3-642-21286-4_5"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] Y.Z. Guo, K. Ramamohanarao, and L.A.F. Park, \u201cPersonalized pagerank for web page prediction based on access time-length and frequency,\u201d Web Intelligence, pp.687-690, 2007.","DOI":"10.1109\/WI.2007.58"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] B. Carterette, J. Allan, and R.K. Sitaraman, \u201cMinimal test collections for retrieval evaluation,\u201d SIGIR, pp.268-275, 2006.","DOI":"10.1145\/1148170.1148219"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/4\/E100.D_2016AWI0002\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T14:00:48Z","timestamp":1498399248000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/4\/E100.D_2016AWI0002\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2016awi0002","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}