PP: Overviewing evolution patterns of egocentric networks by interactive construction of spatial layouts
Problem:
get an overall picture of how ego-networks evolve is a common challenging task.
Existing techniques: inspect the evolution patterns of ego-networks one after another.
Purpose:
how analysts can gain insights into the overall evolution patterns of ego-networks by interactively creating different spatial layouts.
Introduction:
1. What are ego-network and ego-network analysis?
The analysis of individuals in a network context is referred to as egocentric network analysis or ego-network analysis. An ego-network consists of a focal node, the nodes within its one-step neighbourhood and all the edges among these nodes
2. the content in a spatial layout
each dot represents a dynamic ego-network, clusters of dots indicate similar evolution patterns./ outlying dots exhibit uncommon evolution patterns.
3. interpretability and interactivity.
This technique is developed with interpretability and interactivity in mind
Related work:
1. ego-network visualization
i. Most of them focus on visualizing individual ego networks rather than revealing the overall evolution patterns;
ii. tree-ring layout.
iii. ...
2. dynamic network visualization
i. Two major approaches to analyze network evolution are animation and timeline.
- animation: Animation-based technique uses animated transition of visual elements (e.g., nodes and edges in a node-link diagram) to reveal the time dimension. An obvious drawback is that it is cognitively demanding to keep track of the changes.
- Timeline-based approaches, on the other hand, use small multiples (e.g., [6]), vertical or horizontal timeline (e.g., [24]) and circular layout (e.g., [51]) to represent the time dimension. However, as noted by Wu et al. these techniques mainly focus on tracking changes of the entire network rather than the characteristics of ego-networks.
3. techniques for creating spatial layouts for sensemaking
i.
Methodology:
- 两个要素: interpretability and interactivity. 可解释性和可交互性
- data model: 142 dynamic ego-networks for 24 months, and generated time series from these dynamic ego-networks( derived from node attributes---CEO,President,Vice President..., derived from network structure---size, density.)
- data transformation pipeline.
- time series -----> event sequences: input time series and event type, output extracted point/interval events.
- event sequences -----> feature vectors: a feature vector records the number of happened events E = {e1,e2,e3,e4...}.
- feature vectors -----> distance matrix: pairwise distance.
- distance matrix -----> spatial layout: use MDS to project distance matrix onto a spatial layout. Others: force-directed MDS/ t-SNE, slower and less scalable. Spatial layouts are often generated by dimensionality reduction techniques (e.g., PCA [28], MDS [49] and t-SNE [37])
- 评论, 由于是从ego-networks中抽取的特征作为time-series, 而又从time series中抽取events, 这一步当中虽然event记录了时间发生开始和结束,但是在step3转化为了feature vectors, 记录的是事件发生的次数,不包含时间发生顺序. 但是原文也提到,step2 and step3 can be replaced by other methods. ??为什么不直接对time series进行距离计算,这样更能发现两个dynamic ego-network之间的evolution 是否相似.
- The spatial layout reveals the evolution patterns. Each dot in spatial layouts presents a dynamic ego-network (24 ego-networks of one indivisual). If two ego-networks share similar evolution patterns, they will have similar number of events of the same type, thereby pulling them closer together in the spatial layout.
User interface:
- conducted a formative evaluation of the initial prototype with two experts. Interviewing two experts for about an hour.
Supplementary knowledge:
- Enron email network dataset: 142 employees. Each individual has a dynamic ego-network. An ego-network snapshot depicts the email communication of an employee with other employees in a given month. The data set spans 24 months. So there are 142 * 24 ego-networks/ 142 dynamic ego-networks, each having 24 snapshots.
PP: Overviewing evolution patterns of egocentric networks by interactive construction of spatial layouts的更多相关文章
- Classifying plankton with deep neural networks
Classifying plankton with deep neural networks The National Data Science Bowl, a data science compet ...
- 深度学习方法(十三):卷积神经网络结构变化——可变形卷积网络deformable convolutional networks
上一篇我们介绍了:深度学习方法(十二):卷积神经网络结构变化--Spatial Transformer Networks,STN创造性地在CNN结构中装入了一个可学习的仿射变换,目的是增加CNN的旋转 ...
- 【注意力机制】Attention Augmented Convolutional Networks
注意力机制之Attention Augmented Convolutional Networks 原始链接:https://www.yuque.com/lart/papers/aaconv 核心内容 ...
- CVPR 2017 Paper list
CVPR2017 paper list Machine Learning 1 Spotlight 1-1A Exclusivity-Consistency Regularized Multi-View ...
- 关于LDA的文章
转:http://www.zhizhihu.com/html/y2011/3228.html l Theory n Introduction u Unsupervised learning by ...
- KDD2015,Accepted Papers
Accepted Papers by Session Research Session RT01: Social and Graphs 1Tuesday 10:20 am–12:00 pm | Lev ...
- Java中实现SAX解析xml文件到MySQL数据库
大致步骤: 1.Java bean 2.DBHelper.java 3.重写DefaultHandler中的方法:MyHander.java 4.循环写数据库:SAXParserDemo.java ① ...
- 转 SSD论文解读
版权声明:本文为博主原创文章,遵循CC 4.0 BY-SA版权协议,转载请附上原文出处链接和本声明. 本文链接:https://blog.csdn.net/u010167269/article/det ...
- Computer Vision_33_SIFT:Speeded-Up Robust Features (SURF)——2006
此部分是计算机视觉部分,主要侧重在底层特征提取,视频分析,跟踪,目标检测和识别方面等方面.对于自己不太熟悉的领域比如摄像机标定和立体视觉,仅仅列出上google上引用次数比较多的文献.有一些刚刚出版的 ...
随机推荐
- SQL JOIN 的解析
1.SQL语句结构 select distinct < select_list > from < left_table > < join_type > joi ...
- python下timer定时器常用的两种实现方法
方法一,使用线程中现成的: 这种一般比较常用,特别是在线程中的使用方法,下面是一个例子能够很清楚的说明它的具体使用方法: #! /usr/bin/python3 #! -*- conding: u ...
- linux 文件系统管理三部曲之一:磁盘分区
硬盘和主板的连接的地方:叫接口,硬盘的接口类型: iops:i/o per second:每秒的读写次数. IDE(ata):并口(数据并行传输),理论最大传输 133MB/S:iops:100次 S ...
- oracle卸载步骤
一.删除产品 1. 停服务,进入下图,一个个删除Oracle产品,再执行卸载 二.清注册表,开始-搜索- 输入regedit,进入注册表 1.选择HKEY_LOCAL_MACHINE\SOFTWARE ...
- CF468A | 24 Game 找规律+打表
(翻译版本来自 Luogu by lonelysir ) 题目描述 小X一直很喜欢一个纸牌游戏:"24点",但最近他发现这个游戏太简单了,所以他发明了一个新游戏. 你有一个整数序列 ...
- Ubuntu18.04安装mysql(AWS云)
1.执行如下三条命令 sudo apt-get install mysql-server sudo apt install mysql-client sudo apt install libmysql ...
- LeetCodeTwo Sum IV 树的遍历+Hash大法好
题意 给定一颗二叉搜索树,返回是否存在两个节点的值之和为给定值K. 思路 同Two Sum.使用Hash表解决.只是要写个树的遍历而已,选取DFS. 源码 class Solution { publi ...
- python开发第一篇:初识python
一. Python介绍 python的创始人为吉多·范罗苏姆(Guido van Rossum).1989年的圣诞节期间,吉多·范罗苏姆为了在阿姆斯特丹打发时间,决心开发一个新的脚本解释程序,作为AB ...
- java面试记录一:跳表、判断二叉树相同、冒泡排序、cookie和session的区别、设计模式(单例、工厂、模板方法、原型、代理、策略)、抽象类与接口的区别
1.什么是跳表? 跳表实际上就是多层链表 跳表可用在让链表的元素查询接近线性时间 代码结构及java实现参考博客园随笔 2.判断两棵二叉树是否相同?(结构相同,内容相同) 思路:(1)先定义树节点Tr ...
- 已经安装了 AccessDatabaseEngine.exe,还是报错
标题: SQL Server 导入和导出向导 ------------------------------ 操作无法完成. ------------------------------ 其他信息: 未 ...