Identifying the skeptics and the undecided through visual cluster analysis of local network geometry

IF 3.8 3区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Visual Informatics Pub Date : 2022-09-01 DOI:10.1016/j.visinf.2022.07.002
Shenghui Cheng , Joachim Giesen , Tianyi Huang , Philipp Lucas , Klaus Mueller
{"title":"Identifying the skeptics and the undecided through visual cluster analysis of local network geometry","authors":"Shenghui Cheng ,&nbsp;Joachim Giesen ,&nbsp;Tianyi Huang ,&nbsp;Philipp Lucas ,&nbsp;Klaus Mueller","doi":"10.1016/j.visinf.2022.07.002","DOIUrl":null,"url":null,"abstract":"<div><p>By skeptics and undecided we refer to nodes in clustered social networks that cannot be assigned easily to any of the clusters. Such nodes are typically found either at the interface between clusters (the undecided) or at their boundaries (the skeptics). Identifying these nodes is relevant in marketing applications like voter targeting, because the persons represented by such nodes are often more likely to be affected in marketing campaigns than nodes deeply within clusters. So far this identification task is not as well studied as other network analysis tasks like clustering, identifying central nodes, and detecting motifs. We approach this task by deriving novel geometric features from the network structure that naturally lend themselves to an interactive visual approach for identifying interface and boundary nodes.</p></div>","PeriodicalId":36903,"journal":{"name":"Visual Informatics","volume":"6 3","pages":"Pages 11-22"},"PeriodicalIF":3.8000,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2468502X22000651/pdfft?md5=7d16b3905d9547534a383f084916110d&pid=1-s2.0-S2468502X22000651-main.pdf","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Visual Informatics","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2468502X22000651","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 7

Abstract

By skeptics and undecided we refer to nodes in clustered social networks that cannot be assigned easily to any of the clusters. Such nodes are typically found either at the interface between clusters (the undecided) or at their boundaries (the skeptics). Identifying these nodes is relevant in marketing applications like voter targeting, because the persons represented by such nodes are often more likely to be affected in marketing campaigns than nodes deeply within clusters. So far this identification task is not as well studied as other network analysis tasks like clustering, identifying central nodes, and detecting motifs. We approach this task by deriving novel geometric features from the network structure that naturally lend themselves to an interactive visual approach for identifying interface and boundary nodes.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过局部网络几何图形的视觉聚类分析识别怀疑论者和未决定者
我们所说的怀疑论者和未决定者指的是群集社会网络中的节点,这些节点不能轻易地分配给任何一个集群。这样的节点通常位于集群之间的界面(未决定者)或集群的边界(怀疑者)。识别这些节点在诸如选民定位之类的营销应用中是相关的,因为这些节点所代表的人通常比集群中的节点更有可能在营销活动中受到影响。到目前为止,这种识别任务还没有像其他网络分析任务(如聚类、识别中心节点和检测基序)那样得到很好的研究。我们通过从网络结构中提取新的几何特征来完成这项任务,这些特征自然地为识别界面和边界节点提供了一种交互式可视化方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Visual Informatics
Visual Informatics Computer Science-Computer Graphics and Computer-Aided Design
CiteScore
6.70
自引率
3.30%
发文量
33
审稿时长
79 days
期刊最新文献
Intelligent CAD 2.0 Editorial Board RelicCARD: Enhancing cultural relics exploration through semantics-based augmented reality tangible interaction design JobViz: Skill-driven visual exploration of job advertisements Visual evaluation of graph representation learning based on the presentation of community structures
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1