吉林大学学报(信息科学版) ›› 2024, Vol. 42 ›› Issue (2): 301-306.

• • 上一篇    下一篇

大数据消冗技术下虚拟网络聚类特征层次布局算法

张 伟1 , 罗文宇2   

  1. 1. 河南省政务大数据中心, 郑州 450016; 2. 华北水利水电大学 电子工程学院, 郑州 450016
  • 收稿日期:2023-04-11 出版日期:2024-04-10 发布日期:2024-04-12
  • 作者简介:张伟(1981— ), 男, 河南上蔡人, 河南省政务大数据中心高级工程师, 主要从事自然资源信息化、 政务大数据技术及 应用研究, (Tel)86-15890689883 (E-mail)zwdsjzx_zw@ 126. com; 罗文宇(1982— ), 男, 河南正阳人, 华北水利水电大学 副教授, 博士, 主要从事新一代移动通信技术研究, (Tel)86-15937195026(E-mail)68214543@ qq. com。
  • 基金资助:
    河南省自然科学基金资助项目(ZR2022MF299) 

Hierarchical Layout Algorithm of Virtual Network Clustering Features Based on Big Data Redundancy Elimination Technology

ZHANG Wei 1 , LUO Wenyu 2   

  1. 1. Henan Provincial Government Big Data Center, Zhengzhou 450016, China; 2. School of Electronic Engineering, North China University of Water Resources and Electric Power, Zhengzhou 450016, China
  • Received:2023-04-11 Online:2024-04-10 Published:2024-04-12

摘要: 针对在虚拟网络布局过程中, 存在大量重复特征与相关性较少的特征, 影响其布局效率的问题, 提出了 大数据消冗技术下虚拟网络聚类特征层次布局算法。 利用加权无向图方式建立虚拟网络图, 通过社团划分 虚拟网络社团结构, 在保持原有特征不变的前提下, 最大限度消除虚拟网络聚类特征, 得到相关性较大特征; 根据库伦力的斥力增加各社团之间距离, 采用胡克定律的引力缩小网络节点与中心点之间距离, 结合共轭梯度 (FR: Flecher-Reeves)算法调整虚拟网络聚类特征层节点的斥力与引力之间关系, 实现层次布局算法。 实验 结果表明, 所提算法能更加清晰展现出各社团内部结构特征, 且布局用时最短。

关键词: 虚拟网络, 聚类特征, 相关性分析, 层次布局, 社团划分, 数据消冗技术

Abstract: In the process of virtual network layout, there are a lot of repetitive features and features with less correlation, which affect the efficiency of its layout. Therefore, a hierarchical layout algorithm of virtual network clustering features under big data redundancy technology is proposed. A weighted undirected graph is used to establish a virtual network graph, and the community structure of the virtual network is divided by communities, so that the clustering characteristics of the virtual network are eliminated to the maximum extent under the premise of keeping the original characteristics unchanged, and the characteristics with high correlation are obtained. According to the repulsion of Coulomb force, the distance between communities is increased, and the distance between network nodes and central points is reduced by the gravity of Hooke's law. Combined with FR (Flecher-Reeves) algorithm, the relationship between repulsion and gravity of virtual network clustering feature layer nodes is adjusted, and the hierarchical layout algorithm is realized. The experimental results show that the proposed algorithm can more clearly show the internal structure characteristics of each community, and the layout time is the shortest. 

Key words: virtual network, clustering characteristics, correlation analysis, hierarchical layout, community division, data redundancy elimination technology 

中图分类号: 

  •