{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T05:18:56Z","timestamp":1648790336221},"reference-count":17,"publisher":"Oxford University Press (OUP)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["jcomplexnetw"],"DOI":"10.1093\/comnet\/cnw008","type":"journal-article","created":{"date-parts":[[2016,5,29]],"date-time":"2016-05-29T00:09:34Z","timestamp":1464480574000},"page":"cnw015","source":"Crossref","is-referenced-by-count":2,"title":["Fast, memory-efficient low-rank approximation of SimRank"],"prefix":"10.1093","author":[{"given":"I.V.","family":"Oseledets","sequence":"first","affiliation":[]},{"given":"G.V.","family":"Ovchinnikov","sequence":"additional","affiliation":[]},{"given":"A.M.","family":"Katrutsa","sequence":"additional","affiliation":[]}],"member":"286","published-online":{"date-parts":[[2016,5,28]]},"reference":[{"key":"2016052817092209000_cnw008v1.1","doi-asserted-by":"crossref","unstructured":"Jeh, G. & Widom, J. (2002) SimRank: a measure of structural-context similarity. Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u20190 2 (O. R. Za\u00efane, R. Goebel, D. Hand, D. Keim & R. Ng eds). New York, NY, USA: ACM, pp. 538\u2013543.","DOI":"10.1145\/775047.775126"},{"key":"2016052817092209000_cnw008v1.2","doi-asserted-by":"crossref","unstructured":"Li, L. , Li, C. , Chen, H. & Du, X. (2013) MapReduce-based SimRank computation and its application in social recommender system. 2013 IEEE International Congress on Big Data (BigData Congress) ( Han J. ed.). Washington, DC, USA: IEEE Computer Society, pp. 133\u2013140.","DOI":"10.1109\/BigData.Congress.2013.26"},{"key":"2016052817092209000_cnw008v1.3","doi-asserted-by":"crossref","unstructured":"Li, P., Li, Z., Liu, H., He, J. & Du, X. (2009) Using link-based content analysis to measure document similarity effectively.Advances in Data and Web Management (Q. Li, L. Feng, J. Pei, S. X. Wang, X. Zhou & Q.-M. Zhu eds). Berlin: Springer, pp. 455\u2013467.","DOI":"10.1007\/978-3-642-00672-2_40"},{"key":"2016052817092209000_cnw008v1.4","doi-asserted-by":"crossref","unstructured":"Williams, K. , Wu, J. & Giles, C. L. (2014) Simseerx: a similar document search engine. Proceedings of the 2014 ACM Symposium on Document Engineering ( R\u00f6nnau S. ed.). New York, NY, USA: ACM, pp. 143\u2013146.","DOI":"10.1145\/2644866.2644895"},{"key":"2016052817092209000_cnw008v1.5","doi-asserted-by":"crossref","unstructured":"Li, C., Han, J., He, G., Jin, X., Sun, Y., Yu, Y. & Wu, T. (2010) Fast computation of SimRank for static and dynamic information networks.Proceedings of the 13th International Conference on Extending Database Technology, EDBT \u201910 (I. Manolescu, S. Spaccapietra, J. Teubner, M. Kitsuregawa, A. Leger, F. Naumann, A. Ailamaki & F. Ozcan eds). New York, NY, USA: ACM, pp. 465\u2013476.","DOI":"10.1145\/1739041.1739098"},{"key":"2016052817092209000_cnw008v1.6","unstructured":"Onizuka, M., Fujiwara, Y., Shiokawa, H. & Nakatsuji, M. (2013) Ef\ufb01cient search algorithm for SimRank. Proceedings of the 2013 IEEE International Conference on Data Engineering (ICDE 2013), ICDE \u201913 (J. Lu & E. Tanin eds). Washington, DC, USA: IEEE Computer Society, pp. 589\u2013600."},{"key":"2016052817092209000_cnw008v1.7","unstructured":"Yu, W., Lin, X. & Zhang, W. (2013) Towards ef\ufb01cient SimRank computation on large networks.2013 IEEE 29th International Conference on Data Engineering (ICDE) (J. Lu & E. Tanin eds). Washington, DC, USA: IEEE Computer Society, pp. 601\u2013612."},{"key":"2016052817092209000_cnw008v1.8","doi-asserted-by":"publisher","DOI":"10.14778\/2735479.2735489"},{"key":"2016052817092209000_cnw008v1.9","doi-asserted-by":"crossref","unstructured":"Chen, H.-H. and Giles, C. L. (2013) Ascos: an asymmetric network structure context similarity measure. Proceedings of the 2013 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (P. Karampelas & M.-Y. Day eds). New York, NY, USA: ACM, pp. 442\u2013449.","DOI":"10.1145\/2492517.2492539"},{"key":"2016052817092209000_cnw008v1.10","doi-asserted-by":"crossref","unstructured":"Shin, D., Si, S. & Dhillon, I. S. (2012) Multi-scale link prediction.Proceedings of the 21st ACM International Conference on Information and Knowledge Management (X. Chen, G. Lebanon, H. Wang & M. J. Zaki eds). New York, NY, USA: ACM, pp. 215\u2013224.","DOI":"10.1145\/2396761.2396792"},{"key":"2016052817092209000_cnw008v1.11","doi-asserted-by":"publisher","DOI":"10.1137\/1015095"},{"key":"2016052817092209000_cnw008v1.12","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"2016052817092209000_cnw008v1.13","doi-asserted-by":"crossref","unstructured":"Kusumoto, M., Maehara, T. & Kawarabayashi, K.-i. (2014) Scalable similarity search for SimRank.Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, SIGMOD \u201914 (C. Dyreson, F. Li & M. T. \u00d6zsu eds). New York, NY, USA: ACM, pp. 325\u2013336.","DOI":"10.1145\/2588555.2610526"},{"key":"2016052817092209000_cnw008v1.14","doi-asserted-by":"crossref","unstructured":"Fogaras, D. & R\u00e1cz, B. (2005) Scaling link-based similarity search.Proceedings of the 14th International Conference on World Wide Web (A. Ellis & T. Hagino eds). New York, NY, USA: ACM, pp. 641\u2013650.","DOI":"10.1145\/1060745.1060839"},{"key":"2016052817092209000_cnw008v1.15","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2013.12.008"},{"key":"2016052817092209000_cnw008v1.16","doi-asserted-by":"crossref","unstructured":"Lee, P., Lakshmanan, L.V. & Yu, J. X. (2012) On top-k structural similarity search.2012 IEEE 28th International Conference on Data Engineering (ICDE) (A. Kementsietsidis & M. V. Salles eds). Washington, DC, USA: IEEE Computer Society, pp. 774\u2013785.","DOI":"10.1109\/ICDE.2012.109"},{"key":"2016052817092209000_cnw008v1.17","doi-asserted-by":"crossref","unstructured":"Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N. & Hullender, G. (2005) Learning to rank using gradient descent.Proceedings of the 22Nd International Conference on Machine Learning, ICML \u201905 (H. Blockeel, S. D. FHS Hagenberg, R. M. Everson, C. Ferri, J. E. Fieldsend, P. Flach, J. F\u00fcrnkranz, J. Hern\u00e1ndez-Orallo, R. Holte, N. Lachiche, S. A. Macskassy, A. Rakotomamonjy & F. Tortorella eds). New York, NY, USA: ACM, pp. 89\u201396.","DOI":"10.1145\/1102351.1102363"}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comnet\/article-pdf\/5\/1\/111\/10253527\/cnw008.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,9]],"date-time":"2019-09-09T00:57:30Z","timestamp":1567990650000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article-lookup\/doi\/10.1093\/comnet\/cnw008"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,28]]},"references-count":17,"alternative-id":["10.1093\/comnet\/cnw008"],"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnw008","relation":{},"ISSN":["2051-1310","2051-1329"],"issn-type":[{"value":"2051-1310","type":"print"},{"value":"2051-1329","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,28]]}}}