{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:56:55Z","timestamp":1772909815073,"version":"3.50.1"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030975487","type":"print"},{"value":"9783030975494","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-97549-4_1","type":"book-chapter","created":{"date-parts":[[2022,3,17]],"date-time":"2022-03-17T08:05:37Z","timestamp":1647504337000},"page":"3-15","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Random-Walk Based Approximate k-Nearest Neighbors Algorithm for Diffusion State Distance"],"prefix":"10.1007","author":[{"given":"Lenore J.","family":"Cowen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaozhe","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junyuan","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yue","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaiyi","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,18]]},"reference":[{"issue":"4","key":"1_CR1","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1016\/S0022-0000(03)00025-4","volume":"66","author":"D Achlioptas","year":"2003","unstructured":"Achlioptas, D.: Database-friendly random projections: Johnson-Lindenstrauss with binary coins. J. Comput. Syst. Sci. 66(4), 671\u2013687 (2003)","journal-title":"J. Comput. Syst. Sci."},{"issue":"9","key":"1_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"issue":"22","key":"1_CR3","doi-asserted-by":"publisher","first-page":"3043","DOI":"10.1093\/bioinformatics\/btp498","volume":"25","author":"GF Berriz","year":"2009","unstructured":"Berriz, G.F., Beaver, J.E., Cenik, C., Tasan, M., Roth, F.P.: Next generation software for functional trend analysis. Bioinformatics 25(22), 3043\u20133044 (2009)","journal-title":"Bioinformatics"},{"issue":"12","key":"1_CR4","doi-asserted-by":"publisher","first-page":"i219","DOI":"10.1093\/bioinformatics\/btu263","volume":"30","author":"M Cao","year":"2014","unstructured":"Cao, M., et al.: New directions for Diffusion-based network prediction of protein function: incorporating pathways with confidence. Bioinformatics 30(12), i219\u2013i227 (2014)","journal-title":"Bioinformatics"},{"issue":"10","key":"1_CR5","first-page":"1","volume":"8","author":"M Cao","year":"2013","unstructured":"Cao, M., et al.: Going the distance for protein function prediction: a new distance metric for protein interaction networks. PLoS One 8(10), 1\u201312 (2013)","journal-title":"PLoS One"},{"issue":"9","key":"1_CR6","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1038\/s41592-019-0509-5","volume":"16","author":"S Choobdar","year":"2019","unstructured":"Choobdar, S., et al.: Assessment of network module identification across complex diseases. Nat. Methods 16(9), 843\u2013852 (2019)","journal-title":"Nat. Methods"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Consortium, T.G.O.: The gene ontology resource: 20 years and still GOing strong. Nucleic Acids Res. 47(D1), D330\u2013D338 (2018)","DOI":"10.1093\/nar\/gky1055"},{"issue":"1","key":"1_CR8","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1137\/20M1324089","volume":"3","author":"L Cowen","year":"2021","unstructured":"Cowen, L., Devkota, K., Hu, X., Murphy, J.M., Wu, K.: Diffusion state distances: multitemporal analysis, fast algorithms, and applications to biological networks. SIAM J. Math. Data Sci. 3(1), 142\u2013170 (2021)","journal-title":"SIAM J. Math. Data Sci."},{"key":"1_CR9","first-page":"200","volume":"3","author":"R Finkel","year":"1977","unstructured":"Finkel, R., Friedman, J., Bentley, J.: An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Softw. 3, 200\u2013226 (1977)","journal-title":"ACM Trans. Math. Softw."},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pp. 604\u2013613 (1998)","DOI":"10.1145\/276698.276876"},{"issue":"189\u2013206","key":"1_CR11","first-page":"1","volume":"26","author":"WB Johnson","year":"1984","unstructured":"Johnson, W.B., Lindenstrauss, J.: Extensions of Lipschitz mappings into a Hilbert space. Contemp. Math. 26(189\u2013206), 1 (1984)","journal-title":"Contemp. Math."},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.M.: Two algorithms for nearest-neighbor search in high dimensions. In: Proceedings of the Twenty-ninth Annual ACM Symposium on Theory of Computing, pp. 599\u2013608 (1997)","DOI":"10.1145\/258533.258653"},{"issue":"2","key":"1_CR13","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1137\/S0097539798347177","volume":"30","author":"E Kushilevitz","year":"2000","unstructured":"Kushilevitz, E., Ostrovsky, R., Rabani, Y.: Efficient search for approximate nearest neighbor in high dimensional spaces. SIAM J. Comput. 30(2), 457\u2013474 (2000)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"1_CR14","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1038\/nmeth.4083","volume":"14","author":"T Li","year":"2017","unstructured":"Li, T., et al.: A scored human protein-protein interaction network to catalyze genomic interpretation. Nat. Methods 14(1), 61 (2017)","journal-title":"Nat. Methods"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Lin, J., Cowen, L.J., Hescott, B., Hu, X.: Computing the diffusion state distance on graphs via algebraic multigrid and random projections. Numer. Linear Algebra Appl. 25(3), e2156 (2018)","DOI":"10.1002\/nla.2156"},{"key":"1_CR16","unstructured":"Liu, T., Moore, A.W., Yang, K., Gray, A.G.: An investigation of practical approximate nearest neighbor algorithms. In: Advances in Neural Information Processing Systems, pp. 825\u2013832 (2005)"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Szklarczyk, D., et al.: STRING v10: protein-protein interaction networks, integrated over the tree of life. Nucleic Acids Res. 43, D447\u2013D452 (2015)","DOI":"10.1093\/nar\/gku1003"}],"container-title":["Lecture Notes in Computer Science","Large-Scale Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-97549-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,17]],"date-time":"2022-03-17T08:06:09Z","timestamp":1647504369000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-97549-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030975487","9783030975494"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-97549-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"18 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LSSC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Large-Scale Scientific Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sozopol","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bulgaria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lssc2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/parallel.bas.bg\/Conferences\/SciCom21\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}