ID |
原文 |
译文 |
25895 |
经过某口径 13m 天线反射面测量数据的实例计算,对比其他方法,新方法拟合结果能够合理、准确地反映出反射面的实际变形偏差,更适用于天线反射面自重变形数据的处理。 |
Through the calculation of measurement data for a Φ13m antenna reflector, compared with other methods, the fitting results of this method can reasonably and accurately reflect the actual reflector deformation deviation, and this method is more suitable for the data processing of antenna reflector gravity deformation. |
25896 |
图表示社区检测使用图表示方法学习网络节点的向量表示,然后对节点向量进行聚类获得社团结构。 |
Community detection based on graph representation learn nodes' vector representation,and then communities are obtained by clustering algorithm. |
25897 |
然而经典的聚类算法在聚类节点向量时,得到的结果往往不能够体现社区的特性。 |
However, when classical clustering algorithms often fail to reflect the characteristics of communities. |
25898 |
提出一种新型的聚类覆盖算法,将聚类所得覆盖视为社区划分结果。 |
Cluster cover algorithm (CCL) is proposed. CCL clusters nodes' vector into covers. A cover is viewed as a community. |
25899 |
首先在节点向量空间中计算得到每个簇的覆盖中心; |
Firstly, the cover center of each cluster is calculated in the node vector space. |
25900 |
然后根据覆盖中心到同类样本的平均距离作为覆盖半径,在向量空间中形成覆盖; |
Then, according to the average distance among the cover center and the same class samples as the cover radius, a cover is formed in the vector space. |
25901 |
最后对未覆盖的点做二次划分得到社区结构。 |
Finally, the nodes outside the covers are grouped into suitable cover to obtain community structure. |
25902 |
在多个有真实和无真实标签网络的实验表明,所提出的算法可以得到更合理的社区结果。 |
Experiments with real and non-real tag networks show that the algorithm can get more reasonable community results. |
25903 |
网络负面新闻识别在网络舆情监测中具有重要的研究意义。 |
Identification of network negative news has important research significance in network public opinion monitoring. |
25904 |
针对当前海量数据下负面新闻难以检测的问题,提出了一种基于情感计算与层次化多头注意力机制相结合的负面新闻识别方法。 |
Aiming at the problem that negative news is difficult to detect under the current mass data, this paper proposes a method of negative news recognition based on emotional computing and hierarchical multi-head attention mechanism. |