期刊文献+

基于粒子群优化算法的社交网络可视化 被引量:3

Visualization of social network based on particle swarm optimization
下载PDF
导出
摘要 为了使用户快捷、清晰地发现及研究微博用户之间的关系,提出基于粒子群优化(PSO)算法的微博数据可视化方法.根据用户在微博中的影响力将用户分为n层,以此来表示用户在网络中对信息的传播影响力的等级.基于数据的关联关系对数据进行子群划分;基于粒子群优化算法,设计目标函数,使粒子群优化算法适应社交网络的布局要求.为了进一步增强可视化效果,降低视觉复杂度,采用曲线代替直线,应用传输函数设置不透明度以及交互的可视化技术.实验结果表明,该方法可以形成清晰的可视化结果,以便更好地分析微博用户之间的关系. A visualization method based on particle swarm optimization (PSO) for microblogging data was proposed in order to assist users to reveal and analyze the relationship among microblogging users more clearly and quickly. According to their influence, users were divided into n layers in order to represent how much the user can influence the dissemination of information in the network. Users were divided into sub- groups based on their focus relationship; the objective function was designed based on the PSO algorithm in order to meet the layout requirements of social networks. Straight lines were replaced with curve lines in order to further enhance the visualization results and reduce the visual complexity. Transfer function and interaction techniques were employed. Experimental results showed that the proposed method formed a clear visual result and provided a better analysis of relationship among the rnicroblogging users.
出处 《浙江大学学报(工学版)》 EI CAS CSCD 北大核心 2013年第1期37-43,共7页 Journal of Zhejiang University:Engineering Science
基金 国家自然科学基金资助项目(60873122 60903133)
关键词 微博 粒子群优化(PSO) 可视化分析 子群 社交网络 microblogging particle swarm optimization (PSO) ; visual analysis; subgroup; social network
  • 相关文献

参考文献20

  • 1WATTS D J, STROGATZ S H. Collective dynamics of 'small-world' networks [J]. Nature, 1998, 393 (6): 440 - 442.
  • 2BARABASI A L, BONABEAU E. Scale-free networks [J]. Scientific American, 2003, 288(5) : 50 - 59.
  • 3LONG B,ZHANG M,WU X,et al. Spectral clustering for multi-type relational data [C]// Proceedings of the 23rd International Conference on Machine Learning. New York: ACM,2006:585-592.
  • 4LI T, ANAND S S. DIVA a variance-based clustering approach for multi-type relational data [C]// Proceed- ings of the 16th ACM Conference on Information and Knowledge Management CIKM. New York: ACM, 2007:147 - 156.
  • 5YIN X X, HAN J W, PHILIP S Y. CrossClus: user- guided multi-relational clustering [J ]. Data Mining Knowledge Discovery, 2007, 15: 321- 348.
  • 6CHENG Y, HUANG S B, LV T Y, et al. A hierarchi- cal multi-relational clustering algorithm based on modal logic [ C]// 2011 4th International Congress on Image and Signal Processing (CISP). Los Alamitos: IEEE, 2011:2459 - 2463.
  • 7HERMAN I, MELANCON G, MARSHALL1 M S. Graph visualization and navigation in information visual- ization: a survey [J]. IEEE Transactions on Visualiza- tion and Computer Graphics, 2000, 6 (1) : 24 - 43.
  • 8BEN M, EPPSTEIN D. Worst-case bounds for subaddi- tive geometric graphs [C]// Proceedings of the 9th ACM Symposium on Computational Geometry. New York: ACM,1993: 183- 188.
  • 9NGUYEN Q V, HUANG M L. A space-optimized tree visualization [C] // IEEE Symposium on Information Visualization. Los Alamitos: IEEE, 2002:85 - 92.
  • 10JOHNSON B, SHNEIDERMAN B. Tree-Maps: a space-filling approach to the visualization of hierarchi- cal information [C] // Proceedings of the Visualization 91. Los Alamitos: IEEE, 1991: 284-291.

同被引文献10

引证文献3

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部