PP: Time series clustering via community detection in Networks
内容导读
互联网集市收集整理的这篇技术教程文章主要介绍了PP: Time series clustering via community detection in Networks，小编现在分享给大家，供广大互联网技能从业者学习和参考。文章包含2205字，纯文字阅读大概需要4分钟。
内容图文
tasks:
1. review the community detection paper
2. formulate your problem and software functions
3.
Suppose: similar time series tend to connect to each other and form communities. / high correlated time series tend to connect to each other and form communities.
Background and related works
shaped based distance measures; feature based distance measures; structure based distance measures. time series clustering; community detection in networks.
Methodology
- data normalization
- time series distance calculation
- network construction
- community detection
Which step influence the clustering results:
distance calculation algorithm; network construction methods. community detection methods.
2. distance matrix
calculating the distance for each pair of time series in the data set and construct a distance matrix D, where dij is the distance between series Xi and XJ . A good choice of distance measure has strong influence on the network construction and clustering result.
3. network construction
Two common method: K-NN and \epsilon-NN; EXPLORATION
Experiments
45 time series data sets.
Purpose: check the performance of each combination of step2, step3,and step4 to each data sets.
Index指标：Rand index.
Vary the parameters: the k of k-NN from 1 to n-1; the epsilon of epsilon-NN from min(D) to max(D) in 100 steps.
Step2: Manhattan, Euclidean, infinite Norm, DTW, short time series, DISSIM, Complexity-Invariant, Wavlet tranform, Pearson correlation, Intergrated periodogram.
Step3: fast greedy; multilevel; walktrap; infomap; label propagration.
Step4: vary the parameter of k and \epsilon.
Results
1. The k-NN construction method just allows discrete values of k while the ε-NN method accepts continuous values
Supplementary knowledge:
1. box plot
它能显示出一组数据的最大值、最小值、中位数、及上下四分位数。
以下是箱形图的具体例子：
+-----+-+
* o |-------| + | |---|
+-----+-+
+---+---+---+---+---+---+---+---+---+---+ 分数
0 1 2 3 4 5 6 7 8 9 10
这组数据显示出：
- 最小值(minimum)=5
- 下四分位数(Q1)=7
- 中位数(Med --也就是Q2)=8.5
- 上四分位数(Q3)=9
- 最大值(maximum )=10
- 平均值=8
- 四分位间距(interquartile range)={\displaystyle (Q3-Q1)}
=2 (即ΔQ)
2. 观念转变， experiment部分也很重要，不是可有可无的， 要细看。
原文：https://www.cnblogs.com/dulun/p/12170759.html
内容总结
以上是互联网集市为您收集整理的PP: Time series clustering via community detection in Networks全部内容，希望文章能够帮你解决PP: Time series clustering via community detection in Networks所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错，欢迎将互联网集市网站推荐给程序员好友。
内容备注
版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 gblab@vip.qq.com 举报，一经查实，本站将立刻删除。
内容手机端
扫描二维码推送至手机访问。