{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T10:10:53Z","timestamp":1682417453980},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T00:00:00Z","timestamp":1673568000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T00:00:00Z","timestamp":1673568000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s11227-022-05028-8","type":"journal-article","created":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T03:02:49Z","timestamp":1673578969000},"page":"9383-9408","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An unsupervised learning-guided multi-node failure-recovery model for distributed graph processing systems"],"prefix":"10.1007","volume":"79","author":[{"given":"Aradhita","family":"Mukherjee","sequence":"first","affiliation":[]},{"given":"Rituparna","family":"Chaki","sequence":"additional","affiliation":[]},{"given":"Nabendu","family":"Chaki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,13]]},"reference":[{"issue":"1","key":"5028_CR1","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/s11227-019-03023-0","volume":"76","author":"J Huang","year":"2020","unstructured":"Huang J, Qin W, Wang X, Chen W (2020) Survey of external memory large-scale graph processing on a multi-core system. J Supercomput 76(1):549\u2013579","journal-title":"J Supercomput"},{"issue":"7","key":"5028_CR2","doi-asserted-by":"publisher","first-page":"1621","DOI":"10.1109\/TPDS.2017.2703904","volume":"29","author":"R Chen","year":"2017","unstructured":"Chen R, Yao Y, Wang P, Zhang K, Wang Z, Guan H, Zang B, Chen H (2017) Replication-based fault-tolerance for large-scale graph processing. IEEE Trans Parallel Distrib Syst 29(7):1621\u20131635","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"5028_CR3","doi-asserted-by":"crossref","unstructured":"Le QV (2013) Building high-level features using large scale unsupervised learning. In: 2013 IEEE International Conference on Acoustics, Speech and Signal Processing, IEEE, pp. 8595\u20138598","DOI":"10.1109\/ICASSP.2013.6639343"},{"issue":"5","key":"5028_CR4","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1007\/s10766-013-0272-7","volume":"42","author":"C Dobre","year":"2014","unstructured":"Dobre C, Xhafa F (2014) Parallel programming paradigms and frameworks in big data era. Int J Parallel Prog 42(5):710\u2013738","journal-title":"Int J Parallel Prog"},{"key":"5028_CR5","unstructured":"Low Y, Gonzalez JE, Kyrola A, Bickson D, Guestrin CE, Hellerstein J (2014) Graphlab: a new framework for parallel machine learning. arXiv preprint arXiv:1408.2041"},{"key":"5028_CR6","doi-asserted-by":"crossref","unstructured":"Malewicz G, Austern MH, Bik AJ, Dehnert JC, Horn I, Leiser N, Czajkowski G (2010) Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, pp. 135\u2013146","DOI":"10.1145\/1807167.1807184"},{"key":"5028_CR7","unstructured":"Gonzalez JE, Low Y, Gu H, Bickson D, Guestrin C (2012) Powergraph: distributed graph-parallel computation on natural graphs. In: 10th $$\\{$$USENIX$$\\}$$ Symposium on Operating Systems Design and Implementation ($$\\{$$OSDI$$\\}$$ 12), pp. 17\u201330"},{"key":"5028_CR8","doi-asserted-by":"crossref","unstructured":"Low Y, Gonzalez J, Kyrola A, Bickson D, Guestrin C, Hellerstein JM (2012) Distributed graphlab: a framework for machine learning in the cloud. arXiv preprint arXiv:1204.6078","DOI":"10.14778\/2212351.2212354"},{"issue":"4","key":"5028_CR9","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1109\/TKDE.2018.2843361","volume":"31","author":"W Lu","year":"2018","unstructured":"Lu W, Shen Y, Wang T, Zhang M, Jagadish HV, Du X (2018) Fast failure recovery in vertex-centric distributed graph processing systems. IEEE Trans Knowl Data Eng 31(4):733\u2013746","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"3","key":"5028_CR10","doi-asserted-by":"publisher","first-page":"1850","DOI":"10.1007\/s11227-018-2359-9","volume":"76","author":"Y Zhao","year":"2020","unstructured":"Zhao Y, Yoshigoe K, Xie M, Bian J, Xiong K (2020) L-powergraph: a lightweight distributed graph-parallel communication mechanism. J Supercomput 76(3):1850\u20131879","journal-title":"J Supercomput"},{"issue":"4","key":"5028_CR11","doi-asserted-by":"publisher","first-page":"437","DOI":"10.14778\/2735496.2735506","volume":"8","author":"Y Shen","year":"2014","unstructured":"Shen Y, Chen G, Jagadish H, Lu W, Ooi BC, Tudor BM (2014) Fast failure recovery in distributed graph processing systems. Proc VLDB Endow 8(4):437\u2013448","journal-title":"Proc VLDB Endow"},{"issue":"12","key":"5028_CR12","doi-asserted-by":"publisher","first-page":"1478","DOI":"10.14778\/2824032.2824046","volume":"8","author":"D Margo","year":"2015","unstructured":"Margo D, Seltzer M (2015) A scalable distributed graph partitioner. Proc VLDB Endow 8(12):1478\u20131489","journal-title":"Proc VLDB Endow"},{"issue":"1","key":"5028_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/sdata.2018.221","volume":"5","author":"DC Robinson","year":"2018","unstructured":"Robinson DC, Hand JA, Madsen MB, McKelvey KR (2018) The Dat Project, an open and decentralized research data tool. Scientific data 5(1):1\u20134","journal-title":"Scientific data"},{"key":"5028_CR14","doi-asserted-by":"crossref","unstructured":"Bl\u00e4hser J, G\u00f6ller T, B\u00f6hmer M (2021) Thine-approach for a fault tolerant distributed packet manager based on hypercore protocol. In: 2021 IEEE 45th Annual Computers, Software, and Applications Conference (COMPSAC), IEEE, pp. 1778\u20131782","DOI":"10.1109\/COMPSAC51774.2021.00266"},{"key":"5028_CR15","doi-asserted-by":"publisher","first-page":"180221","DOI":"10.1038\/sdata.2018.221","volume":"5","author":"DC Robinson","year":"2018","unstructured":"Robinson DC, Hand JA, Madsen MB, McKelvey KR (2018) The dat project, an open and decentralized research data tool. Sci Data 5:180221. https:\/\/doi.org\/10.1038\/sdata.2018.221","journal-title":"Sci Data"},{"key":"5028_CR16","doi-asserted-by":"crossref","unstructured":"Tarr D, Lavoie E, Meyer A, Tschudin C (2019) Secure scuttlebutt: an identity-centric protocol for subjective and decentralized applications. In: Proceedings of the 6th ACM Conference on Information-Centric Networking, pp. 1\u201311","DOI":"10.1145\/3357150.3357396"},{"key":"5028_CR17","doi-asserted-by":"publisher","unstructured":"Tsipenyuk GY (2018) Evaluation of decentralized email architecture and social network analysis based on email attachment sharing. Tech. rep., University of Cambridge, Computer Laboratory, https:\/\/doi.org\/10.17863\/CAM.21035","DOI":"10.17863\/CAM.21035"},{"key":"5028_CR18","unstructured":"Sandoval IV, Atashpendar A, Lenzini G, Ryan PY (2021) Pakemail: authentication and key management in decentralized secure email and messaging via pake. arXiv preprint arXiv:2107.06090"},{"key":"5028_CR19","doi-asserted-by":"crossref","unstructured":"Kermarrec AM, Lavoie E, Tschudin C (2020) Gossiping with append-only logs in secure-scuttlebutt. In: Proceedings of the 1st International Workshop on Distributed Infrastructure for Common Good, pp. 19\u201324","DOI":"10.1145\/3428662.3428794"},{"issue":"5","key":"5028_CR20","doi-asserted-by":"publisher","first-page":"732","DOI":"10.1016\/j.jpdc.2005.12.008","volume":"66","author":"HS Paul","year":"2006","unstructured":"Paul HS, Gupta A, Sharma A (2006) Finding a suitable checkpoint and recovery protocol for a distributed application. J Parallel Distrib Comput 66(5):732\u2013749","journal-title":"J Parallel Distrib Comput"},{"key":"5028_CR21","doi-asserted-by":"crossref","unstructured":"Dathathri R, Gill G, Hoang L, Pingali K (2019) Phoenix: a substrate for resilient distributed graph analytics. In: Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems, pp. 615\u2013630","DOI":"10.1145\/3297858.3304056"},{"issue":"2","key":"5028_CR22","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/3336937.3336943","volume":"49","author":"C Tschudin","year":"2019","unstructured":"Tschudin C (2019) A broadcast-only communication model based on replicated append-only logs. ACM SIGCOMM Comput Commun Rev 49(2):37\u201343","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"key":"5028_CR23","doi-asserted-by":"crossref","unstructured":"Singh A, Ngan TW, Druschel P, Wallach DS (2006) Eclipse attacks on overlay networks: threats and defenses. In: Proceedings IEEE INFOCOM 2006 25TH IEEE International Conference on Computer Communications, pp. 1\u201312","DOI":"10.1109\/INFOCOM.2006.231"},{"key":"5028_CR24","doi-asserted-by":"publisher","unstructured":"Roy C, Chakraborty D, Debnath S, Mukherjee A, Chaki N (2021) Single failure recovery in distributed social network. In: Hong T, Wojtkiewicz K, Chawuthai R, Sitek P (eds) Recent Challenges in Intelligent Information and Database Systems - 13th Asian Conference, ACIIDS 2021, Phuket, Thailand, April 7-10, 2021, Proceedings, Springer, Communications in Computer and Information Science, vol. 1371, pp. 203\u2013215, https:\/\/doi.org\/10.1007\/978-981-16-1685-3_17","DOI":"10.1007\/978-981-16-1685-3_17"},{"key":"5028_CR25","doi-asserted-by":"crossref","unstructured":"Peluso S, Romano P, Quaglia F (2012) Score: a scalable one-copy serializable partial replication protocol. In: ACM\/IFIP\/USENIX International Conference on Distributed Systems Platforms and Open Distributed Processing, Springer, pp. 456\u2013475","DOI":"10.1007\/978-3-642-35170-9_23"},{"key":"5028_CR26","doi-asserted-by":"crossref","unstructured":"Schiper N, Sutra P, Pedone F (2010) P-store: genuine partial replication in wide area networks. In: 2010 29th IEEE Symposium on Reliable Distributed Systems, IEEE, pp. 214\u2013224","DOI":"10.1109\/SRDS.2010.32"},{"issue":"2","key":"5028_CR27","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1109\/TKDE.2017.2762294","volume":"30","author":"V Kalavri","year":"2017","unstructured":"Kalavri V, Vlassov V, Haridi S (2017) High-level programming abstractions for distributed graph processing. IEEE Trans Knowl Data Eng 30(2):305\u2013324","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"6","key":"5028_CR28","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1219","volume":"7","author":"F Murtagh","year":"2017","unstructured":"Murtagh F, Contreras P (2017) Algorithms for hierarchical clustering: an overview, ii. Wiley Interdiscipl Rev Data Mining Knowl Discov 7(6):e1219","journal-title":"Wiley Interdiscipl Rev Data Mining Knowl Discov"},{"issue":"1","key":"5028_CR29","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF01890115","volume":"1","author":"WH Day","year":"1984","unstructured":"Day WH, Edelsbrunner H (1984) Efficient algorithms for agglomerative hierarchical clustering methods. J Classif 1(1):7\u201324","journal-title":"J Classif"},{"key":"5028_CR30","doi-asserted-by":"crossref","unstructured":"Shahapure KR, Nicholas C (2020) Cluster quality analysis using silhouette score. In: 2020 IEEE 7th International Conference on Data Science and Advanced Analytics (DSAA), IEEE, pp. 747\u2013748","DOI":"10.1109\/DSAA49011.2020.00096"},{"key":"5028_CR31","doi-asserted-by":"crossref","unstructured":"Wang X, Xu Y (2019) An improved index for clustering validation based on silhouette index and calinski-harabasz index. In: IOP Conference Series: Materials Science and Engineering, IOP Publishing, vol. 569, p. 052024","DOI":"10.1088\/1757-899X\/569\/5\/052024"},{"key":"5028_CR32","doi-asserted-by":"crossref","unstructured":"Paranjape A, Benson AR, Leskovec J (2017) Motifs in temporal networks. In: Proceedings of the Tenth ACM International Conference on Web Search and Data Mining, pp. 601\u2013610","DOI":"10.1145\/3018661.3018731"},{"key":"5028_CR33","volume-title":"Advances in neural information processing systems","author":"J Leskovec","year":"2012","unstructured":"Leskovec J, Mcauley J (2012) Learning to discover social circles in ego networks. In: Pereira F, Burges C, Bottou L, Weinberger K (eds) Advances in neural information processing systems, vol 25. Curran Associates Inc., Red Hook"},{"key":"5028_CR34","doi-asserted-by":"crossref","unstructured":"Yang J, Leskovec J (2012) Defining and evaluating network communities based on ground-truth. In: Proceedings of the ACM SIGKDD Workshop on Mining Data Semantics, pp. 1\u20138","DOI":"10.1145\/2350190.2350193"},{"key":"5028_CR35","doi-asserted-by":"crossref","unstructured":"Besta M, Podstawski M, Groner L, Solomonik E, Hoefler T (2017) To push or to pull: On reducing communication and synchronization in graph computations. In: Proceedings of the 26th International Symposium on High-Performance Parallel and Distributed Computing, pp. 93\u2013104","DOI":"10.1145\/3078597.3078616"},{"key":"5028_CR36","doi-asserted-by":"publisher","first-page":"106517","DOI":"10.1016\/j.compeleceng.2019.106517","volume":"81","author":"M Chatterjee","year":"2020","unstructured":"Chatterjee M, Mitra A, Setua SK, Roy S (2020) Gossip-based fault-tolerant load balancing algorithm with low communication overhead. Comput Electr Eng 81:106517","journal-title":"Comput Electr Eng"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-05028-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-022-05028-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-05028-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,24]],"date-time":"2023-04-24T11:14:27Z","timestamp":1682334867000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-022-05028-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,13]]},"references-count":36,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["5028"],"URL":"https:\/\/doi.org\/10.1007\/s11227-022-05028-8","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,13]]},"assertion":[{"value":"29 December 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}