摘要: 实际上一定不要信什么美国老板nice的谎话。 根据我的采样(10所 20到50名大学的CS系),在这个level,美国教授的水平是比外国教授低一个档次的。外国教授普遍比较敬业,对自己和别人都比较严格。这是大背景。 美国老板的确大部分不push,这个有文化的原因在里面,但是这个有时候也有代价的。也 就 阅读全文
posted @ 2019-12-09 02:32 keeps_you_warm 阅读(354) 评论(0) 推荐(0) 编辑
摘要: Motif discovery is in loose terms the problem of finding interesting patterns in sequences. motif: interest patterns/ subsequences in sequences. two w 阅读全文
posted @ 2019-12-03 23:09 keeps_you_warm 阅读(167) 评论(0) 推荐(0) 编辑
摘要: 1. Convert time series into weighted networks. 2. link prediction is used to evaluate the performance of the weighted network. 3. different ways of ge 阅读全文
posted @ 2019-12-03 20:07 keeps_you_warm 阅读(177) 评论(0) 推荐(0) 编辑
摘要: Problem 当图所要表达的信息较多时, 图中可能会充满交叉的线[1-2], 甚至整个显示空间都被点、线所覆盖, 这时想通过观察来获取图中的重要信息将会变得非常困难, 这种现象称为图的视觉混乱. Keywords edge bundling; edge clusters; relation mea 阅读全文
posted @ 2019-12-03 17:55 keeps_you_warm 阅读(235) 评论(0) 推荐(0) 编辑
摘要: topic 分支: 1. subgraph/subsequence mining Wang Jin, routine behavior/ motif. Philippe Fournier Viger; 2. correlation of different factors or self-corre 阅读全文
posted @ 2019-11-29 18:57 keeps_you_warm 阅读(131) 评论(0) 推荐(0) 编辑
摘要: Problem define a fuzzy visibility graph (undirected weighted graph), then give a new similarity measure of time series. Problem: 1. some significant i 阅读全文
posted @ 2019-11-28 23:24 keeps_you_warm 阅读(228) 评论(0) 推荐(0) 编辑
摘要: Problem Forecasting time series. Other methods' drawback: even though existing methods (exponential smoothing, auto-regression and moving average-MA, 阅读全文
posted @ 2019-11-28 18:43 keeps_you_warm 阅读(160) 评论(0) 推荐(0) 编辑
摘要: Problem: how to store and querry massive amounts of high quality sensor data ingested in real-time from many sensors. Properties paramount for a TSMS: 阅读全文
posted @ 2019-11-26 18:40 keeps_you_warm 阅读(118) 评论(0) 推荐(0) 编辑
摘要: related website: Beyond Community Detection - RolX; ReFeX and RolX ; What are roles? “Functions” of nodes in the network – Similar to functional roles 阅读全文
posted @ 2019-11-22 21:48 keeps_you_warm 阅读(149) 评论(0) 推荐(0) 编辑
摘要: Method 1: M. E. J Newman ‘Networks: An Introduction’, page 224 Oxford University Press 2011. Find communities in graph using Clauset-Newman-Moore gree 阅读全文
posted @ 2019-11-19 19:19 keeps_you_warm 阅读(406) 评论(0) 推荐(0) 编辑