{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T18:31:13Z","timestamp":1776191473498,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,4,16]],"date-time":"2021-04-16T00:00:00Z","timestamp":1618531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,16]],"date-time":"2021-04-16T00:00:00Z","timestamp":1618531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Natural Institute of Heath Grant"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s10618-021-00754-8","type":"journal-article","created":{"date-parts":[[2021,4,16]],"date-time":"2021-04-16T06:04:37Z","timestamp":1618553077000},"page":"1342-1368","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Fast computation of Katz index for efficient processing of link prediction queries"],"prefix":"10.1007","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4805-1416","authenticated-orcid":false,"given":"Mustafa","family":"Co\u015fkun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdelkader","family":"Baggag","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehmet","family":"Koyut\u00fcrk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,4,16]]},"reference":[{"key":"754_CR1","doi-asserted-by":"crossref","unstructured":"Acar E, Dunlavy DM, Kolda TG (2009) Link prediction on evolving data using matrix and tensor factorizations. In: Data Mining Workshops, 2009. ICDMW\u201909. IEEE International Conference on, pp 262\u2013269, IEEE","DOI":"10.1109\/ICDMW.2009.54"},{"issue":"4","key":"754_CR2","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1137\/S0895479894278952","volume":"17","author":"PR Amestoy","year":"1996","unstructured":"Amestoy PR, Davis TA, Duff IS (1996) An approximate minimum degree ordering algorithm. SIAM J Matrix Anal Appl 17(4):886\u2013905","journal-title":"SIAM J Matrix Anal Appl"},{"key":"754_CR3","doi-asserted-by":"crossref","unstructured":"Boldi P, Rosa M, Santini M, Vigna S (2011) Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks. In: Proceedings of the 20th international conference on World wide web, pp 587\u2013596, ACM","DOI":"10.1145\/1963405.1963488"},{"issue":"1\u20132","key":"754_CR4","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1080\/15427951.2012.625256","volume":"8","author":"F Bonchi","year":"2012","unstructured":"Bonchi F, Esfandiar P, Gleich DF, Greif C, Lakshmanan LV (2012) Fast matrix computations for pairwise and columnwise commute times and katz scores. Internet Math. 8(1\u20132):73\u2013112","journal-title":"Internet Math."},{"key":"754_CR5","doi-asserted-by":"crossref","unstructured":"Chapelle O, Sch\u00f6lkopf B, Zien A (2006) Semi-supervised learning, vol. 2, MIT Press, Cambridge. Cortes C, and Mohri M, et al. (2014) Domain adaptation and sample bias correction theory and algorithm for regression. Theoretical Computer Science 519:103126","DOI":"10.1016\/j.tcs.2013.09.027"},{"key":"754_CR6","doi-asserted-by":"crossref","unstructured":"Co\u015fkun M, Grama A, Koyut\u00fcrk M (2018) Indexed fast network proximity querying. Proc VLDB Endow 11(8):840\u2013852","DOI":"10.14778\/3204028.3204029"},{"key":"754_CR7","doi-asserted-by":"crossref","unstructured":"Coskun M, Grama A, Koyuturk M (2016) Efficient processing of network proximity queries via chebyshev acceleration. In: Proceedings of the 22nd ACM SIGKDD International conference on knowledge discovery and data mining, pp 1515\u20131524, ACM","DOI":"10.1145\/2939672.2939828"},{"key":"754_CR8","doi-asserted-by":"crossref","unstructured":"Coskun M, Koyut\u00fcrk M (2015) Link prediction in large networks by comparing the global view of nodes in the network. In: Data Mining Workshop (ICDMW), 2015 IEEE International Conference on, pp 485\u2013492, IEEE","DOI":"10.1109\/ICDMW.2015.195"},{"key":"754_CR9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971446","volume-title":"Applied numerical linear algebra","author":"JW Demmel","year":"1997","unstructured":"Demmel JW (1997) Applied numerical linear algebra, vol 56. SIAM, Philadelphia"},{"issue":"1","key":"754_CR10","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1186\/1756-0381-4-19","volume":"4","author":"S Erten","year":"2011","unstructured":"Erten S, Bebek G, Ewing RM, Koyut\u00fcrk M (2011) Dada: degree-aware algorithms for network-based disease gene prioritization. BioData Min 4(1):19","journal-title":"BioData Min"},{"issue":"11","key":"754_CR11","doi-asserted-by":"publisher","first-page":"1561","DOI":"10.1089\/cmb.2011.0154","volume":"18","author":"S Erten","year":"2011","unstructured":"Erten S, Bebek G, Koyut\u00fcrk M (2011) Vavien: an algorithm for prioritizing candidate disease genes based on topological similarity of proteins in interaction networks. J Comput Biol 18(11):1561\u20131574","journal-title":"J Comput Biol"},{"issue":"1","key":"754_CR12","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis G, Kumar V (1998a) A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J Sci Comput 20(1):359\u2013392","journal-title":"SIAM J Sci Comput"},{"issue":"1","key":"754_CR13","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1006\/jpdc.1997.1403","volume":"48","author":"G Karypis","year":"1998","unstructured":"Karypis G, Kumar V (1998b) A parallel algorithm for multilevel graph partitioning and sparse matrix ordering. J Parallel Distrib Comput 48(1):71\u201395","journal-title":"J Parallel Distrib Comput"},{"issue":"1","key":"754_CR14","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02289026","volume":"18","author":"L Katz","year":"1953","unstructured":"Katz L (1953) A new status index derived from sociometric analysis. Psychometrika 18(1):39\u201343","journal-title":"Psychometrika"},{"key":"754_CR15","unstructured":"Klicpera J, Bojchevski A, Gunnemann S (2019) Combining neural networks with personalized pagerank for classification on graphs. In: International conference on learning representations. https:\/\/openreview.net\/forum?id=H1gL-2A9Ym"},{"key":"754_CR16","doi-asserted-by":"crossref","unstructured":"Leskovec J, Huttenlocher D, Kleinberg J (2010) Signed networks in social media. In: Proceedings of the SIGCHI conference on human factors in computing systems, pp 1361\u20131370, ACM","DOI":"10.1145\/1753326.1753532"},{"issue":"7","key":"754_CR17","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1002\/asi.20591","volume":"58","author":"D Liben-Nowell","year":"2007","unstructured":"Liben-Nowell D, Kleinberg J (2007) The link-prediction problem for social networks. J Am Soc Inf Sci Technol 58(7):1019\u20131031","journal-title":"J Am Soc Inf Sci Technol"},{"key":"754_CR18","unstructured":"Liu W, He J, Chang S-F (2010) \u2018Large graph construction for scalable semi-supervised learning\u2019"},{"key":"754_CR19","doi-asserted-by":"crossref","unstructured":"Lu Z, Savas B, Tang W, Dhillon IS (2010) Supervised link prediction using multiple sources. In: 2010 IEEE international conference on data mining, pp 923\u2013928, IEEE","DOI":"10.1109\/ICDM.2010.112"},{"issue":"8","key":"754_CR20","doi-asserted-by":"publisher","first-page":"1057","DOI":"10.1093\/bioinformatics\/btq076","volume":"26","author":"S Navlakha","year":"2010","unstructured":"Navlakha S, Kingsford C (2010) The power of protein interaction networks for associating genes with diseases. Bioinformatics 26(8):1057\u20131063","journal-title":"Bioinformatics"},{"key":"754_CR21","doi-asserted-by":"crossref","unstructured":"Nie F, Wang X, Jordan M, Huang H (2016) The constrained laplacian rank algorithm for graph-based clustering. In: Proceedings of the AAAI conference on artificial intelligence, vol 30","DOI":"10.1609\/aaai.v30i1.10302"},{"key":"754_CR22","doi-asserted-by":"crossref","unstructured":"Orchard S, Ammari M, Aranda B, Breuza L, Briganti L, Broackes-Carter F, Campbell NH, Chavali G, Chen C, Del-Toro N et al. (2013) The mintact project\u2013intact as a common curation platform for 11 molecular interaction databases. Nucleic Acids Res p gkt1115","DOI":"10.1093\/nar\/gkt1115"},{"key":"754_CR23","unstructured":"Page L, Brin S, Motwani R, Winograd T (1999) The pagerank citation ranking: Bringing order to the web., Technical report, Stanford InfoLab"},{"issue":"2","key":"754_CR24","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/1117454.1117460","volume":"7","author":"MJ Rattigan","year":"2005","unstructured":"Rattigan MJ, Jensen D (2005) The case for anomalous link discovery. Acm Sigkdd Explor Newsl 7(2):41\u201347","journal-title":"Acm Sigkdd Explor Newsl"},{"key":"754_CR25","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718003","volume-title":"Iterative methods for sparse linear systems","author":"Y Saad","year":"2003","unstructured":"Saad Y (2003) Iterative methods for sparse linear systems, vol 82. SIAM, Philadelphia"},{"key":"754_CR26","doi-asserted-by":"crossref","unstructured":"Saerens M, Fouss F, Yen L, Dupont P (2004) The principal components analysis of a graph, and its relationships to spectral clustering. In: European conference on machine learning, pp 371\u2013383, Springer","DOI":"10.1007\/978-3-540-30115-8_35"},{"key":"754_CR27","unstructured":"Sarkar P, Moore AW (2007) A tractable approach to finding closest truncated-commute-time neighbors in large graphs. In: Proceedings of the twenty-third conference on uncertainty in artificial intelligence, pp 335\u2013343"},{"key":"754_CR28","unstructured":"Skogent M (1992) Domain decomposition algorithms of Schwarz type, designed for massively parallel computers. In: Fifth international symposium on domain decomposition methods for partial differential equations, vol. 55, p 362, SIAM"},{"key":"754_CR29","volume-title":"Domain decomposition: parallel multilevel methods for elliptic partial differential equations","author":"B Smith","year":"2004","unstructured":"Smith B, Bjorstad P, Gropp W (2004) Domain decomposition: parallel multilevel methods for elliptic partial differential equations. Cambridge University Press, Cambridge"},{"key":"754_CR30","doi-asserted-by":"crossref","unstructured":"Van der Vorst HA, Chan TF (1997) Linear system solvers: sparse iterative methods. In: Parallel numerical algorithms, pp 91\u2013118, Springer","DOI":"10.1007\/978-94-011-5412-3_4"},{"key":"754_CR31","doi-asserted-by":"crossref","unstructured":"Wang C, Satuluri V, Parthasarathy S (2007) Local probabilistic models for link prediction, In: icdm, pp 322\u2013331, IEEE","DOI":"10.1109\/ICDM.2007.108"},{"key":"754_CR32","unstructured":"Wu X-M, Li Z, So AM, Wright J, Chang S-F (2012) Learning with partially absorbing random walks In: Advances in Neural Information Processing Systems, pp 3077\u20133085"},{"key":"754_CR33","unstructured":"Zhou D, Bousquet O, Lal TN, Weston J, Sch\u00f6lkopf B (2004) Learning with local and global consistency. In: Advances in Neural Information Processing Systems, pp 321\u2013328"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-021-00754-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-021-00754-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-021-00754-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,24]],"date-time":"2022-12-24T12:57:23Z","timestamp":1671886643000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-021-00754-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,16]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["754"],"URL":"https:\/\/doi.org\/10.1007\/s10618-021-00754-8","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,16]]},"assertion":[{"value":"10 May 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 April 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}