{"title":"The effect of the Katz parameter on node ranking, with a medical application","authors":"Hunter Rehm, Mona Matar, Puck Rombach, Lauren McIntyre","doi":"10.1007/s13278-023-01135-3","DOIUrl":null,"url":null,"abstract":"Abstract The Medical Extensible Dynamic Probabilistic Risk Assessment Tool (MEDPRAT), developed by NASA, is an event-based risk modeling tool that assesses human health and medical risk during space exploration missions. The Susceptibility Inference Network (SIN), a sub-element of MEDPRAT, is a prototype model informed with data that represents the probabilities of medical conditions progressing from one to another and the expected quality time lost associated with the disease progression for each condition. The work presented in this paper aims to determine which conditions in the SIN have the greatest effect on MEDPRAT-predicted medical risk. Here, we propose to measure this expected quality time lost using a weighted version of Katz centrality and investigate the effect of the $$\\alpha$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mi>α</mml:mi> </mml:math> -parameter on the lengths of walks that significantly affect the ranking of nodes. To do this, we introduce a tool to compare different centrality measures in their node rankings. This general tool is of independent interest, as it considers that a relative ranking of two nodes by a centrality measure is unreliable if their scores are within a margin of error. In particular, we find an upper bound on the lengths of the walks that determine the node ranking up to this margin of error. If an application imposes a realistic bound on possible walk lengths, this set of tools may help determine a suitable value for $$\\alpha$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mi>α</mml:mi> </mml:math> .","PeriodicalId":21842,"journal":{"name":"Social Network Analysis and Mining","volume":"36 1","pages":"0"},"PeriodicalIF":2.3000,"publicationDate":"2023-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Social Network Analysis and Mining","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s13278-023-01135-3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
Abstract The Medical Extensible Dynamic Probabilistic Risk Assessment Tool (MEDPRAT), developed by NASA, is an event-based risk modeling tool that assesses human health and medical risk during space exploration missions. The Susceptibility Inference Network (SIN), a sub-element of MEDPRAT, is a prototype model informed with data that represents the probabilities of medical conditions progressing from one to another and the expected quality time lost associated with the disease progression for each condition. The work presented in this paper aims to determine which conditions in the SIN have the greatest effect on MEDPRAT-predicted medical risk. Here, we propose to measure this expected quality time lost using a weighted version of Katz centrality and investigate the effect of the $$\alpha$$ α -parameter on the lengths of walks that significantly affect the ranking of nodes. To do this, we introduce a tool to compare different centrality measures in their node rankings. This general tool is of independent interest, as it considers that a relative ranking of two nodes by a centrality measure is unreliable if their scores are within a margin of error. In particular, we find an upper bound on the lengths of the walks that determine the node ranking up to this margin of error. If an application imposes a realistic bound on possible walk lengths, this set of tools may help determine a suitable value for $$\alpha$$ α .
期刊介绍:
Social Network Analysis and Mining (SNAM) is a multidisciplinary journal serving researchers and practitioners in academia and industry. It is the main venue for a wide range of researchers and readers from computer science, network science, social sciences, mathematical sciences, medical and biological sciences, financial, management and political sciences. We solicit experimental and theoretical work on social network analysis and mining using a wide range of techniques from social sciences, mathematics, statistics, physics, network science and computer science. The main areas covered by SNAM include: (1) data mining advances on the discovery and analysis of communities, personalization for solitary activities (e.g. search) and social activities (e.g. discovery of potential friends), the analysis of user behavior in open forums (e.g. conventional sites, blogs and forums) and in commercial platforms (e.g. e-auctions), and the associated security and privacy-preservation challenges; (2) social network modeling, construction of scalable and customizable social network infrastructure, identification and discovery of complex, dynamics, growth, and evolution patterns using machine learning and data mining approaches or multi-agent based simulation; (3) social network analysis and mining for open source intelligence and homeland security. Papers should elaborate on data mining and machine learning or related methods, issues associated to data preparation and pattern interpretation, both for conventional data (usage logs, query logs, document collections) and for multimedia data (pictures and their annotations, multi-channel usage data). Topics include but are not limited to: Applications of social network in business engineering, scientific and medical domains, homeland security, terrorism and criminology, fraud detection, public sector, politics, and case studies.