探索功能性脑网络差异的可视分析系统设计与实现

在神经科学和计算机科学等领域,研究人员通过统计模型和深度学习等方法探索不同状态间功能性脑网络工作机制的差别;但现有的功能性脑网络研究工具多用于寻找支持某种假设的证据或传达科学发现,存在功能单一的缺点;针对上述问题,文章设计并实现了一个用于功能性核磁共振数据的交互式可视分析系统BrainDVis,帮助研究人员寻找不同状态间功能性脑网络的多方面差异;BrainDVis将功能性脑网络差异分析功能、网络特征参数分析功能、模块化结构分析功能、功能性连接分析功能相关联,提供多视图协同交互的方法帮助研究人员自主探索,寻找差异;最后使用公开数据集进行实验,验证了系统的可行性和有效性。     

群组协作社交网络关系的分析及可视化

社交网络的研究应用领域广泛,大多数的研究主要关注于社交网络结构中节点和链接的变化,研究角度较为单一.而群组协作关系在社交网络中较为普遍,为更好地探索群组协作过程中群组级别网络结构的演变,首先将组级任务添加到用于图可视化的任务分类中,针对协作关系网络的特性,设置一个适用于群组协作关系分析的任务分类法,根据此任务分类法设置探究群组协作需完成的任务;然后设计相关可视化视图,以更直观的方式展示群组之间以及群组内部协作关系的特征以及随时间推进的演变模式;最后在学术协作文献数据集上进行具体案例分析,通过用户评估实验,采用李克特量表对调查问卷进行分析,验证了设计可视化视图的有效性和实用性,可为社交网络关系分析人员提供群组协作的可视化分析方法,更便于对群组协作网络关系的进一步探究和应用.     

基于相位同步的癫痫信号识别与分析

针对临床人工诊断癫痫信号效率低下的问题,建立一种基于相位同步的癫痫信号自动诊断模型。使用相位锁定值衡量各脑区间不同状态下的同步化程度,构建对应的脑功能网络连接矩阵,提取聚类系数和特征路径长度2种全局属性作为输入支持向量机的训练特征,使用六折交叉验证的方式对发作间期及发作期的信号进行分类识别。实验结果表明,加权网络的分类效果优于二值网络,其平均准确率为83.4%,单一属性难以全面反映癫痫患者2种状态下的功能网络连接差异,多数患者在gamma和beta频段取得较好的分类效果。     

食品安全大数据可视分析方法研究

食品安全数据可视分析作为一个新兴交叉研究领域,通过先进的交互式可视化工具帮助食品安全领域人员快速分析数据的分布态势、探寻数据间隐含关联、提升认知和分析能力、提高食品安全监管的科学性和有效性.文中从食品安全数据可视化的必要性和内在需求出发,介绍食品安全数据普遍具有的高维、多元、层次、时空、关联等基本特征,总结梳理了已有适合对食品安全数据的可视化以及可视分析方法和系统,对食品安全大数据可视化及可视分析未来的发展趋势进行了展望.     

模拟情境下经济决策及财富关联可视分析

针对经济学领域中采用实验经济学方法产生的大规模高维动态数据,在与实验经济学专家密切合作的基础上,提出模拟情境下真实努力任务实验数据可视分析方法.设计决策过程信息图以全面呈现实验过程中参与者的总体决策分布和个体行为特征;设计自适应决策分类图、财富时序变化特征图、总体决策桑基图等方法直观地呈现实验参与者的决策过程表现与财富结果的关联关系.集成上述可视化设计与数据挖掘算法模型,开发面向真实努力任务实验数据的可视分析系统,帮助领域专家探索式地发掘参与者决策行为特征以及财富变化关键因素,为专家探索和分析贫困产生及贫困循环恶化的内在机制提供依据.大量基于真实数据的案例分析和专家反馈信息进一步验证了该方法和系统工具的有效性和实用性.     

一种基于图的电力数据可视分析方法

将可视化分析技术应用于电力系统可以有效地解决由电力系统发展带来的海量电 力数据分析及显示等问题,从而辅助电力部门进行决策。针对城市电力数据,提出了一种基于 图的电力数据可视分析方法。首先对城市供电数据进行预处理;然后对城市供电网络进行建模; 最后根据可视化原则针对城市供电网络中的多种电力数据设计不同的可视化方法进行可视化与 分析。根据合肥市某区域的电力数据的案例分析,表明该方法可以有效地反映某一区域的电力 系统运行状态和电力客户分布情况。     

时间事件序列数据可视化综述

时间事件序列数据,是由一个或多个记录构成的集合,每个记录由一组带有时间戳的事件类别组成.数据可视化被广泛用于时间事件序列数据的频繁模式发现、相似模式匹配与查询以及潜在阶段模式检测.文中介绍了时间事件序列数据的特征,并重点从时间事件序列数据的可视化呈现方法和可视分析2个方面对已有的工作进行了系统的整理.在可视化呈现方式上,将现有的可视化方法分为4个类别,即基于GanttChart、基于Flow、基于StoryLines及基于矩阵的可视化方法,并分别介绍了相关类别的可视化方法的发展;将可视分析任务总结为4类主要任务,即模式发现与探索、可视化查询、对比分析及结果事件分析,并且从这些可视分析任务的角度总结了现有的可视分析工具.最后,对时间事件序列数据可视化面临的挑战以及未来趋势进行了总结和展望,以期为时间事件序列数据分析提供新的思路.     

知识图谱可视化综述

知识图谱是结构化的语义网络知识库,以符号形式描述概念及其相互关系.由于知识图谱常被用于交互的知识的发现与推理,知识图谱可视化受到众多关注.总结了知识图谱可视化相关工作,介绍了知识图谱的可视表达,分析了可视表达适用的知识图谱类型;简述了大规模知识图谱可视化的挑战与可视化方法、异质网络可视分析方法;介绍了知识图谱可视化的应用案例,并预测了该领域的未来发展方向和挑战.     

基于用户自定义兴趣区的飞行员眼动数据可视分析方法

针对传统基于兴趣区的可视化方法在分析飞行员眼动数据过程中无法关注细节的问题,提出了一种基于用户自定义兴趣区的眼动数据可视分析方法。首先,根据具体的分析任务,引入对任务背景图像的自我划分和定义;然后,在此基础上,结合多种辅助视图和交互手段,设计并实现了面向飞行员培训的眼动数据可视分析系统,帮助分析人员分析不同的飞行员之间的眼动差异,最后通过案例分析,证明了可视分析方法的有效性和分析系统的实用性。实验结果表明,较传统方法来说,所提方法增加了分析人员在分析过程中的主动性,在整体和局部方面,支持分析人员对任务背景进行细节的探索,增加了分析人员分析数据的多角度性,让分析人员能够结合整体发现飞行学员在训练过程中认知困难的部分,进而制定更有针对性、更有效的训练课程。     

基于图表示学习的消息回复关系判断方法

微信、QQ和钉钉等社交媒体都提供多对多聊天群组功能,这些聊天群组包含海量信息,对群组聊天内容进行有效分析,获取有价值的关联信息,是当前领域的研究热点。群组中用户间交互是群组实现的主要功能,用户间消息回复是用户间交互实现的方式,消息间的回复行为下隐藏着消息间和用户间的关系。群组消息间回复通常是隐式和非连续的,大部分群组消息间没有指定明确的回复关系,当前消息也不一定是上一条临近消息的回复,回复关系要根据具体的聊天场景确定。当消息间没有显示指定回复关系时,回复不易于分析和理解群组聊天内容,阻碍了对群组聊天内容的整体性分析。本论文针对群组消息间的回复关系,提出了基于图表示学习的消息回复关系判断方法,该方法不同于以往方法仅使用部分群组要素,是在综合学习消息的文本信息、发送消息的用户信息和上下文信息的基础上,根据群组内容构建群组图和生成自适应消息图,得到了多种群组要素信息和要素间关系组成的图结构,利用图模型在图结构上进行群组消息的表示学习,图模型输出群组消息的表示向量,拼接消息对的表示向量并进一步预测群组消息间的回复关系。在消息间回复关系的学习过程中,图模型通过任务学习更新图中消息节点,同时更新图中用户节点向量表示,经过用户向量分析实验验证了该模型输出的用户向量的有效性和合理性。在公开数据集和标注数据集上进行了对比实验和显著性检验分析,结果显示模型在多个评估指标上大幅优于对比模型,如在F1指标上,比单纯依赖BERT的句子对分类模型提高了接近20%。     

The State of the Art in Multilayer Network Visualization

Modelling relationship between entities in real‐world systems with a simple graph is a standard approach. However, reality is better embraced as several interdependent subsystems (or layers). Recently, the concept of a multilayer network model has emerged from the field of complex systems. This model can be applied to a wide range of real‐world data sets. Examples of multilayer networks can be found in the domains of life sciences, sociology, digital humanities and more. Within the domain of graph visualization, there are many systems which visualize data sets having many characteristics of multilayer graphs. This report provides a state of the art and a structured analysis of contemporary multilayer network visualization, not only for researchers in visualization, but also for those who aim to visualize multilayer networks in the domain of complex systems, as well as those developing systems across application domains. We have explored the visualization literature to survey visualization techniques suitable for multilayer graph visualization, as well as tools, tasks and analytic techniques from within application domains. This report also identifies the outstanding challenges for multilayer graph visualization and suggests future research directions for addressing them.     

面向阿尔茨海默病的脑网络多频融合图核

复杂网络分析与机器学习方法相结合的阿尔茨海默病辅助诊断研究受到了越来越多的关注,其通常采用脑功能网络的方法来描述大脑活动的信息.然而,现有的成果大多基于时域信号匹配构建脑功能网络,忽略了脑活动信息在各个频段下的差异.因此,本文提出了脑网络多频融合图核的阿尔茨海默病诊断方法.首先,将功能磁共振成像产生的图像通过小波变换的方法进行分频段处理;其次,分别计算得到的各频段图像中任意两个脑区间的互信息,并设定阈值与互信息值进行比较进而构造出多频脑网络模型;然后,基于此提出面向多频脑网络模型的融合图核;最后,基于多频融合图核、采用核极限学习机在ADNI(Alzheimer’s Disease Neuroimaging Initiative)公开数据库中获取的一组数据以及在OASIS(Open Access Series of Imaging Studies)公开数据库上获取的一组数据进行阿尔茨海默病的诊断.同时,还通过实验验证了不同参数设置对诊断结果的影响.两组数据集的实验结果表明,提出的多频融合图核的辅助诊断方法能够取得最佳性能,且该方法的辅助诊断准确率在两种数据集上比对比方法的最好结果分别提高了13.79%和15.29%.     

带权图的多重分形度量

分形维数及多重分形是分形理论的重要研究内容。复杂网络的多重分形已经得到了较为深入的研究,但对复杂网络多重分形的度量目前并没有可行的方法。带权图是复杂网络研究的重要对象,其中的节点权重及边权重可以为正实数、负实数、纯虚数及复数等多种不同的类型。除节点权重及边权重均为正实数的情形外,其他类型的带权图都具有多重分形特性,且均具有无穷多个复数形式的网络维数。通过对带权图多重分形的研究,文中给出了15种具有多重分形特性的带权图多重分形维数的模所构成的集合,并采用集合的势对带权图的多重分形特性进行度量。研究表明,15种带权图多重分形维数的模所构成的集合均是可数集,其中有2种集合是2重集合,另外13种集合是通常意义上的集合,而且所有的集合均是等势的,其势均为■0。     

An atmospheric visual analysis and exploration system

Meteorological research involves the analysis of multi-field, multi-scale, and multi-source data sets. In order to better understand these data sets, models and measurements at different resolutions must be analyzed. Unfortunately, traditional atmospheric visualization systems only provide tools to view a limited number of variables and small segments of the data. These tools are often restricted to two-dimensional contour or vector plots or three-dimensional isosurfaces. The meteorologist must mentally synthesize the data from multiple plots to glean the information needed to produce a coherent picture of the weather phenomenon of interest. In order to provide better tools to meteorologists and reduce system limitations, we have designed an integrated atmospheric visual analysis and exploration system for interactive analysis of weather data sets. Our system allows for the integrated visualization of 1D, 2D, and 3D atmospheric data sets in common meteorological grid structures and utilizes a variety of rendering techniques. These tools provide meteorologists with new abilities to analyze their data and answer questions on regions of interest, ranging from physics-based atmospheric rendering to illustrative rendering containing particles and glyphs. In this paper, we will discuss the use and performance of our visual analysis for two important meteorological applications. The first application is warm rain formation in small cumulus clouds. Here, our three-dimensional, interactive visualization of modeled drop trajectories within spatially correlated fields from a cloud simulation has provided researchers with new insight. Our second application is improving and validating severe storm models, specifically the Weather Research and Forecasting (WRF) model. This is done through correlative visualization of WRF model and experimental Doppler storm data.     

Batch kernel SOM and related Laplacian methods for social network analysis

Large graphs are natural mathematical models for describing the structure of the data in a wide variety of fields, such as web mining, social networks, information retrieval, biological networks, etc. For all these applications, automatic tools are required to get a synthetic view of the graph and to reach a good understanding of the underlying problem. In particular, discovering groups of tightly connected vertices and understanding the relations between those groups is very important in practice. This paper shows how a kernel version of the batch self-organizing map can be used to achieve these goals via kernels derived from the Laplacian matrix of the graph, especially when it is used in conjunction with more classical methods based on the spectral analysis of the graph. The proposed method is used to explore the structure of a medieval social network modelled through a weighted graph that has been directly built from a large corpus of agrarian contracts.     

Graph-based tools for microscopic cellular image segmentation

We propose a framework of graph-based tools for the segmentation of microscopic cellular images. This framework is based on an object oriented analysis of imaging problems in pathology. Our graph tools rely on a general formulation of discrete functional regularization on weighted graphs of arbitrary topology. It leads to a set of useful tools which can be combined together to address various image segmentation problems in pathology. To provide fast image segmentation algorithms, we also propose an image simplification based on graphs as a pre processing step. The abilities of this set of image processing discrete tools are illustrated through automatic and interactive segmentation schemes for color cytological and histological images segmentation problems.     

Social Network Clustering and Visualization using Hierarchical Edge Bundles

The hierarchical edge bundle (HEB) method generates useful visualizations of dense graphs, such as social networks, but requires a predefined clustering hierarchy, and does not easily benefit from existing straight‐line visualization improvements. This paper proposes a new clustering approach that extracts the community structure of a network and organizes it into a hierarchy that is flatter than existing community‐based clustering approaches and maps better to HEB visualization. Our method not only discovers communities and generates clusters with better modularization qualities, but also creates a balanced hierarchy that allows HEB visualization of unstructured social networks without predefined hierarchies. Results on several data sets demonstrate that this approach clarifies real‐world communication, collaboration and competition network structure and reveals information missed in previous visualizations. We further implemented our techniques into a social network visualization application on facebook.com and let users explore the visualization and community clustering of their own social networks.     

Visual Exploration of Dynamic Multichannel EEG Coherence Networks

Electroencephalography (EEG) coherence networks represent functional brain connectivity, and are constructed by calculating the coherence between pairs of electrode signals as a function of frequency. Visualization of such networks can provide insight into unexpected patterns of cognitive processing and help neuroscientists to understand brain mechanisms. However, visualizing dynamic EEG coherence networks is a challenge for the analysis of brain connectivity, especially when the spatial structure of the network needs to be taken into account. In this paper, we present a design and implementation of a visualization framework for such dynamic networks. First, requirements for supporting typical tasks in the context of dynamic functional connectivity network analysis were collected from neuroscience researchers. In our design, we consider groups of network nodes and their corresponding spatial location for visualizing the evolution of the dynamic coherence network. We introduce an augmented timeline‐based representation to provide an overview of the evolution of functional units (FUs) and their spatial location over time. This representation can help the viewer to identify relations between functional connectivity and brain regions, as well as to identify persistent or transient functional connectivity patterns across the whole time window. In addition, we introduce the time‐annotated FU map representation to facilitate comparison of the behaviour of nodes between consecutive FU maps. A colour coding is designed that helps to distinguish distinct dynamic FUs. Our implementation also supports interactive exploration. The usefulness of our visualization design was evaluated by an informal user study. The feedback we received shows that our design supports exploratory analysis tasks well. The method can serve as a first step before a complete analysis of dynamic EEG coherence networks.     

基于加权多决策树的入侵检测系统模型研究

传统的决策树分类方法,对于较小的数据集是非常有效的。但是,当这些方法用于入侵检测系统中时,由于巨大的网络流量,因此,存在着检测性能低和数据挖掘效率不高等问题。为了解决这些问题,提出了加权多决策树模型。将这种方法应用于入侵检测系统中,实验结果表明,该方法提高了入侵检测性能和大容量数据的处理能力。