知识图谱划分算法研究综述

知识图谱是人工智能的重要基石,因其包含丰富的图结构和属性信息而受到广泛关注.知识图谱可以精确语义描述现实世界中的各种实体及其联系,其中顶点表示实体,边表示实体间的联系.知识图谱划分是大规模知识图谱分布式处理的首要工作,对知识图谱分布式存储、查询、推理和挖掘起基础支撑作用.随着知识图谱数据规模及分布式处理需求的不断增长,如何对其进行划分已成为目前知识图谱研究的热点问题.从知识图谱和图划分的定义出发,系统性地介绍当前知识图谱数据划分的各类算法,包括基本、多级、流式、分布式和其他类型图划分算法.首先,介绍4种基本图划分算法:谱划分算法、几何划分算法、分支定界算法、KL及其衍生算法,这类算法通常用于小规模图数据或作为其他划分算法的一部分;然后,介绍多级图划分算法,这类算法对图粗糙化后进行划分再投射回原始图,根据粗糙化过程分为基于匹配的算法和基于聚合的算法;其次,描述3种流式图划分算法,这类算法将顶点或边加载为序列后进行划分,包括Hash算法、贪心算法、Fennel算法,以及这3种算法的衍生算法;再次,介绍以KaPPa、JA-BE-JA和轻量级重划分为代表的分布式图划分算法及它们的衍生算法;同时,在其他类型图划分算法中,介绍近年来新兴的2种图划分算法:标签传播算法和基于查询负载的算法.通过在合成与真实知识图谱数据集上的丰富实验,比较了5类知识图谱代表性划分算法在划分效果、查询处理与图数据挖掘方面的性能差异,分析实验结果并推广到推理层面,获得了基于实验的知识图谱划分算法性能评价结论.最后,在对已有方法分析和比较的基础上,总结目前知识图谱数据划分面临的主要挑战,提出相应的研究问题,并展望未来的研究方向.     

CoGCN: Combining co‐attention with graph convolutional network for entity linking with knowledge graphs

Entity linking is a fundamental task in natural language processing. The task of entity linking with knowledge graphs aims at linking mentions in text to their correct entities in a knowledge graph like DBpedia or YAGO2. Most of existing methods rely on hand‐designed features to model the contexts of mentions and entities, which are sparse and hard to calibrate. In this paper, we present a neural model that first combines co‐attention mechanism with graph convolutional network for entity linking with knowledge graphs, which extracts features of mentions and entities from their contexts automatically. Specifically, given the context of a mention and one of its candidate entities' context, we introduce the co‐attention mechanism to learn the relatedness between the mention context and the candidate entity context, and build the mention representation in consideration of such relatedness. Moreover, we propose a context‐aware graph convolutional network for entity representation, which takes both the graph structure of the candidate entity and its relatedness with the mention context into consideration. Experimental results show that our model consistently outperforms the baseline methods on five widely used datasets.     

A Network Security Risk Assessment Method Based on a B_NAG Model

Computer networks face a variety of cyberattacks. Most network attacks are contagious and destructive, and these types of attacks can be harmful to society and computer network security. Security evaluation is an effective method to solve network security problems. For accurate assessment of the vulnerabilities of computer networks, this paper proposes a network security risk assessment method based on a Bayesian network attack graph (B_NAG) model. First, a new resource attack graph (RAG) and the algorithm E-Loop, which is applied to eliminate loops in the B_NAG, are proposed. Second, to distinguish the confusing relationships between nodes of the attack graph in the conversion process, a related algorithm is proposed to generate the B_NAG model. Finally, to analyze the reachability of paths in B_NAG, the measuring indexs such as node attack complexity and node state transition are defined, and an iterative algorithm for obtaining the probability of reaching the target node is presented. On this basis, the posterior probability of related nodes can be calculated. A simulation environment is set up to evaluate the effectiveness of the B_NAG model. The experimental results indicate that the B_NAG model is realistic and effective in evaluating vulnerabilities of computer networks and can accurately highlight the degree of vulnerability in a chaotic relationship.     

Towards sustainable industry 4.0: A green real-time IIoT multitask scheduling architecture for distributed 3D printing services

As the keystones of the personalized manufacturing, the Industrial Internet of Things (IIoT) consolidated with 3D printing pave the path for the era of Industry 4.0 and smart manufacturing. By resembling the age of craft manufacturing, Industry 4.0 expedites the alteration from mass production to mass customization. When distributed 3D printers (3DPs) are shared and collaborated in the IIoT, a promising dynamic, globalized, economical, and time-effective manufacturing environment for customized products will appear. However, the optimum allocation and scheduling of the personalized 3D printing tasks (3DPTs) in the IIoT in a manner that respects the customized attributes submitted for each model while satisfying not only the real-time requirements but also the workload balancing between the distributed 3DPs is an inevitable research challenge that needs further in-depth investigations. Therefore, to address this issue, this paper proposes a real-time green-aware multi-task scheduling architecture for personalized 3DPTs in the IIoT. The proposed architecture is divided into two interconnected folds, namely, allocation and scheduling. A robust online allocation algorithm is proposed to generate the optimal allocation for the 3DPTs. This allocation algorithm takes into consideration meeting precisely the customized user-defined attributes for each submitted 3DPT in the IIoT as well as balancing the workload between the distributed 3DPs simultaneously with improving their energy efficiency. Moreover, meeting the predefined deadline for each submitted 3DPT is among the main objectives of the proposed architecture. Consequently, an adaptive real-time multi-task priority-based scheduling (ARMPS) algorithm has been developed. The built ARMPS algorithm respects both the dynamicity and the real-time requirements of the submitted 3DPTs. A set of performance evaluation tests has been performed to thoroughly investigate the robustness of the proposed algorithm. Simulation results proved the robustness and scalability of the proposed architecture that surpasses its counterpart state-of-the-art architectures, especially in high-load environments.     

多频段脑功能网络融合的阿尔茨海默病分类

将图论与机器学习方法相结合的阿尔茨海默病计算机辅助中,脑网络的构建大多是基于滤波去噪后的全频段BOLD信号匹配,忽略了不同脑活动信息的差异.因此,本文提出了一种多频段脑功能网络融合模型.首先将离散小波变换应用于BOLD信号中,得到不同频域下的体素信号,而后计算同频信号的相关性,获取不同频段下相关矩阵.而后计算所有矩阵的网络特征,在特征选择后基于SVM对患者进行分类.从实验结果可以看出,分频下的脑功能网络特征与未分频网络相比能在一定程度上提高分类的准确性;体素级网络由于可以更加详细的表达脑网络的变化,其分类效果要优于脑区级.     

融合知识图谱的网络安全违法行为识别系统

《网络安全法》是我国第一部关于网络安全的综合立法,与大众的互联网生活息息相关.因此,一款面向大众的《网络安全法》智能违法行为识别系统有助于规范互联网行为.然而,现有智能违法行为识别系统构建方法难以适应《网络安全法》,这是由于:首先,现有方法需要专业司法语言进行交互,不适应普通大众的语言体系.其次,现有方法需要大量的案例训练模型,不适应案例匮乏的《网络安全法》.针对这些问题,本文提出了一个面向《网络安全法》的智能违法行为识别系统.该系统主要利用知识图谱技术解决上述问题,在构建网络安全法知识图谱的基础上,通过将普通用户的自然语言与知识图谱中的违法事件实体和违法主体实体进行实体链接的方式获得更强的特征,提高违法行为识别系统在训练集较为匮乏的条件下的准确度.通过在真实数据集上的实验,表明了提出的系统的准确度有明显提高.     

一种基于图卷积网络的文本多标签学习方法

多标签学习广泛应用于文本分类、标签推荐、主题标注等.最近,基于深度学习技术的多标签学习受到广泛关注,针对如何在多标签学习中有效挖掘并利用高阶标签关系的问题,提出一种基于图卷积网络探究标签高阶关系的模型TMLLGCN.该模型采用GCN的映射函数从数据驱动的标签表示中生成对象分类器挖掘标签高阶关系.首先,采用深度学习方法提取文本特征,然后以数据驱动方式获得基础标签关联表示矩阵,为更好地建模高阶关系及提高模型效果,在基础标签关联表示矩阵上考虑未标记标签集对已知标签集的影响进行标签补全,并以此相关性矩阵指导GCN中标签节点之间的信息传播,最后将提取的文本特征应用到学习高阶标签关系的图卷积网络分类器进行端到端训练,综合标签关联和特征信息作为最终的预测结果.在实际多标签数据集上的实验结果表明,提出的模型能够有效建模标签高阶关系且提升了多标签学习的效果.     

基于时空融合图网络学习的视频异常事件检测

视频中异常事件所体现的时空特征存在着较强的相关关系.针对视频异常事件发生的时空特征相关性而影响检测性能问题,提出了基于时空融合图网络学习的视频异常事件检测方法,该方法针对视频片段的特征分别构建空间相似图和时间连续图,将各片段对应为图中的节点,考虑各节点特征与其他节点特征的Top-k相似性动态形成边的权重,构成空间相似图;考虑各节点的m个时间段内的连续性形成边的权重,构成时间连续图.将空间相似图和时间连续图进行自适应加权融合形成时空融合图卷积网络,并学习生成视频特征.在排序损失中加入图的稀疏项约束降低图模型的过平滑效应并提升检测性能.在UCF-Crime和ShanghaiTech等视频异常事件数据集上进行了实验,以接收者操作曲线(receiver operating characteristic curve,ROC)以及曲线下面积(area under curve,AUC)值作为性能度量指标.在UCF-Crime数据集下,提出的方法在AUC上达到80.76%,比基准线高5.35%;在ShanghaiTech数据集中,AUC达到89.88%,比同类最好的方法高5.44%.实验结果表明:所提出的方法可有效提高视频异常事件检测的性能.     

一种基于有向二分图模型和贝叶斯网络的入侵检测方法

针对入侵检测中存在的非确定性推理问题,文章提出一种基于二分图模型和贝叶斯网络的入侵检测方法,该方法利用二分有向图模型表示入侵和相关特征属性之间的因果拓扑关系,利用训练数据中获取模型的概率参数,最后使用最大可能解释对转化后的推理问题进行推理,并通过限定入侵同时发生的数目来提高检测效率。实验表明,该方法具有较高的检测率和很好的鲁棒性。     

Routing with multiple quality-of-services constraints: An approximation perspective

Finding a path that satisfies multiple Quality-of-Service (QoS) constraints is vital to the deployment of current emerged services. However, existing algorithms are not very efficient and effective at finding such a path. Moreover, few works focus on three or more QoS constraints. In this paper, we present an enhanced version of fully polynomial time approximation scheme (EFPTAS) for multiconstrainted path optimal (MCOP) problem. Specifically, we make four major contributions. We first allow the proposed algorithm to construct an auxiliary graph, through which the QoS parameters on each of the finding path can be guaranteed not to exceed the given constraints. Then we adopt a concept, called nonlinear definition of path constraints in EFPTAS for reducing both time and space complexity. Also, we enable EFPTAS to run iteratively to facilitate a progressive refinement of the finding result. In addition to these, we identify some “deployment” issues for proposed algorithm, the essential steps that how and when the EFPTAS takes place are presented. By analyzing the proposed algorithm theoretically, we find that the presented EFPTAS can find a (1+ε)-approximation path in the network with time complexity O(|E||V|/ε) (where |E| is the number of edges and |V| is the number of nodes), which outperforms the previous best-known algorithm for MCOP. We conduct an extensive comparison between the algorithm presented in this paper and previous best-known study experimentally, our results indicate that EFPTAS can find a path with low complexity and preferable quality.