Jin Xu , Chaojian Zhang , Ming Xie , Xiuxiu Zhan , Luwang Yan , Yubo Tao , Zhigeng Pan
{"title":"IMVis:超图中影响最大化算法评估的可视化分析","authors":"Jin Xu , Chaojian Zhang , Ming Xie , Xiuxiu Zhan , Luwang Yan , Yubo Tao , Zhigeng Pan","doi":"10.1016/j.visinf.2024.04.006","DOIUrl":null,"url":null,"abstract":"<div><p>Influence maximization (IM) algorithms play a significant role in hypergraph analysis tasks, such as epidemic control analysis, viral marketing, and social influence analysis, and various IM algorithms have been proposed. The main challenge lies in IM algorithm evaluation, due to the complexity and diversity of the spreading processes of different IM algorithms in different hypergraphs. Existing evaluation methods mainly leverage statistical metrics, such as influence spread, to quantify overall performance, but do not fully unravel spreading characteristics and patterns. In this paper, we propose an exploratory visual analytics system, IMVis, to assist users in exploring and evaluating IM algorithms at the overview, pattern, and node levels. A spreading pattern mining method is first proposed to characterize spreading processes and extract important spreading patterns to facilitate efficient analysis and comparison of IM algorithms. Novel visualization glyphs are designed to comprehensively reveal both temporal and structural features of IM algorithms’ spreading processes in hypergraphs at multiple levels. The effectiveness and usefulness of IMVis are demonstrated through two case studies and expert interviews.</p></div>","PeriodicalId":36903,"journal":{"name":"Visual Informatics","volume":"8 2","pages":"Pages 13-26"},"PeriodicalIF":3.8000,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2468502X24000172/pdfft?md5=8a25558f06e02bd13aac06e34e54a160&pid=1-s2.0-S2468502X24000172-main.pdf","citationCount":"0","resultStr":"{\"title\":\"IMVis: Visual analytics for influence maximization algorithm evaluation in hypergraphs\",\"authors\":\"Jin Xu , Chaojian Zhang , Ming Xie , Xiuxiu Zhan , Luwang Yan , Yubo Tao , Zhigeng Pan\",\"doi\":\"10.1016/j.visinf.2024.04.006\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Influence maximization (IM) algorithms play a significant role in hypergraph analysis tasks, such as epidemic control analysis, viral marketing, and social influence analysis, and various IM algorithms have been proposed. The main challenge lies in IM algorithm evaluation, due to the complexity and diversity of the spreading processes of different IM algorithms in different hypergraphs. Existing evaluation methods mainly leverage statistical metrics, such as influence spread, to quantify overall performance, but do not fully unravel spreading characteristics and patterns. In this paper, we propose an exploratory visual analytics system, IMVis, to assist users in exploring and evaluating IM algorithms at the overview, pattern, and node levels. A spreading pattern mining method is first proposed to characterize spreading processes and extract important spreading patterns to facilitate efficient analysis and comparison of IM algorithms. Novel visualization glyphs are designed to comprehensively reveal both temporal and structural features of IM algorithms’ spreading processes in hypergraphs at multiple levels. The effectiveness and usefulness of IMVis are demonstrated through two case studies and expert interviews.</p></div>\",\"PeriodicalId\":36903,\"journal\":{\"name\":\"Visual Informatics\",\"volume\":\"8 2\",\"pages\":\"Pages 13-26\"},\"PeriodicalIF\":3.8000,\"publicationDate\":\"2024-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S2468502X24000172/pdfft?md5=8a25558f06e02bd13aac06e34e54a160&pid=1-s2.0-S2468502X24000172-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Visual Informatics\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2468502X24000172\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Visual Informatics","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2468502X24000172","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
摘要
影响最大化(IM)算法在流行病控制分析、病毒营销和社会影响分析等超图分析任务中发挥着重要作用,目前已提出了多种 IM 算法。由于不同 IM 算法在不同超图中的传播过程具有复杂性和多样性,其主要挑战在于 IM 算法的评估。现有的评估方法主要利用影响力传播等统计指标来量化整体性能,但不能完全揭示传播特征和模式。在本文中,我们提出了一个探索性的可视化分析系统--IMVis,以帮助用户从概览、模式和节点三个层面探索和评估 IM 算法。我们首先提出了一种传播模式挖掘方法,以描述传播过程并提取重要的传播模式,从而促进对 IM 算法的有效分析和比较。设计了新颖的可视化字形,以全面揭示 IM 算法在多层次超图中传播过程的时间和结构特征。通过两个案例研究和专家访谈,证明了 IMVis 的有效性和实用性。
IMVis: Visual analytics for influence maximization algorithm evaluation in hypergraphs
Influence maximization (IM) algorithms play a significant role in hypergraph analysis tasks, such as epidemic control analysis, viral marketing, and social influence analysis, and various IM algorithms have been proposed. The main challenge lies in IM algorithm evaluation, due to the complexity and diversity of the spreading processes of different IM algorithms in different hypergraphs. Existing evaluation methods mainly leverage statistical metrics, such as influence spread, to quantify overall performance, but do not fully unravel spreading characteristics and patterns. In this paper, we propose an exploratory visual analytics system, IMVis, to assist users in exploring and evaluating IM algorithms at the overview, pattern, and node levels. A spreading pattern mining method is first proposed to characterize spreading processes and extract important spreading patterns to facilitate efficient analysis and comparison of IM algorithms. Novel visualization glyphs are designed to comprehensively reveal both temporal and structural features of IM algorithms’ spreading processes in hypergraphs at multiple levels. The effectiveness and usefulness of IMVis are demonstrated through two case studies and expert interviews.