Knowledge Graph Representation Learning Based on Automatic Network Search for Link Prediction

Link prediction,also known as Knowledge Graph Completion(KGC),is the common task in Knowledge Graphs(KGs)to predict missing connections between entities.Most existing methods focus on designing shallow,scalable models,which have less expressive than deep,multi-layer models.Furthermore,most operations like addition,matrix multiplications or factorization are handcrafted based on a few known relation patterns in several wellknown datasets,such as FB15k,WN18,etc.However,due to the diversity and complex nature of real-world data distribution,it is inherently difficult to preset all latent patterns.To address this issue,we proposeKGE-ANS,a novel knowledge graph embedding framework for general link prediction tasks using automatic network search.KGEANS can learn a deep,multi-layer effective architecture to adapt to different datasets through neural architecture search.In addition,the general search spacewe designed is tailored forKGtasks.We performextensive experiments on benchmark datasets and the dataset constructed in this paper.The results show that our KGE-ANS outperforms several state-of-the-art methods,especially on these datasets with complex relation patterns.

Social network search based on semantic analysis and learning

Because of everyone＇s involvement in social networks, social networks are full of massive multimedia data, and events are got released and disseminated through social networks in the form of multi-modal and multi-attribute heterogeneous data. There have been numerous researches on social network search. Considering the spatio-temporal feature of messages and social relationships among users, we summarized an overall social network search framework from the perspective of semantics based on existing researches. For social network search, the acquisition and representation of spatio-temporal data is the basis, the semantic analysis and modeling of social network cross-media big data is an important component, deep semantic learning of social networks is the key research field, and the indexing and ranking mechanism is the indispensable part. This paper reviews the current studies in these fields, and then main challenges of social network search are given. Finally, we give an outlook to the prospect and further work of social network search.

Improving the Syllable-Synchronous Network SearchAlgorithm for Word Decoding in ContinuousChinese Speech Recognition

The previously proposed syllable-synchronous network search (SSNS) algorithm plays a very important role in the word decoding of the continuous Chinese speech recognition and achieves satisfying performance. Several related key factors that may affect the overall word decoding effect are carefully studied in this paper, including the perfecting of the vocabulary, the big-discount Turing re-estimating of the N-Gram probabilities, and the managing of the searching path buffers. Based on these discussions, corresponding approaches to improving the SSNS algorithm are proposed. Compared with the previous version of SSNS algorithm, the new version decreases the Chinese character error rate (CCER) in the word decoding by 42.1% across a database consisting of a large number of testing sentences (syllable strings).

Enhancing the synchronizability of networks by rewiring based on tabu search and a local greedy algorithm

By considering the eigenratio of the Laplacian matrix as the synchronizability measure, this paper presents an efficient method to enhance the synchronizability of undirected and unweighted networks via rewiring. The rewiring method combines the use of tabu search and a local greedy algorithm so that an effective search of solutions can be achieved. As demonstrated in the simulation results, the performance of the proposed approach outperforms the existing methods for a large variety of initial networks, both in terms of speed and quality of solutions.

Structural reliability analysis using enhanced cuckoo search algorithm and artificial neural network

The present study proposed an enhanced cuckoo search(ECS) algorithm combined with artificial neural network(ANN) as the surrogate model to solve structural reliability problems. In order to enhance the accuracy and convergence rate of the original cuckoo search(CS) algorithm, the main parameters namely, abandon probability of worst nests paand search step sizeα0 are dynamically adjusted via nonlinear control equations. In addition, a global-best guided equation incorporating the information of global best nest is introduced to the ECS to enhance its exploitation. Then, the proposed ECS is linked to the well-trained ANN model for structural reliability analysis. The computational capability of the proposed algorithm is validated using five typical structural reliability problems and an engineering application. The comparison results show the efficiency and accuracy of the proposed algorithm.

Enhanced Energy Efficient Multipath Routing Protocol for Wireless Sensor Communication Networks Using Cuckoo Search Algorithm

Energy efficient routing is one of the major thrust areas in Wireless Sensor Communication Networks (WSCNs) and it attracts most of the researchers by its valuable applications and various challenges. Wireless sensor networks contain several nodes in its terrain region. Reducing the energy consumption over the WSCN has its significance since the nodes are battery powered. Various research methodologies were proposed by researchers in this area. One of the bio-inspired computing paradigms named Cuckoo search algorithm is used in this research work for finding the energy efficient path and routing is performed. Several performance metrics are taken into account for determining the performance of the proposed routing protocol such as throughput, packet delivery ratio, energy consumption and delay. Simulation is performed using NS2 and the results shows that the proposed routing protocol is better in terms of average throughput, and average energy consumption.

Using Genetic Algorithms to Improve the Search of the Weight Space in Cascade－Correlation Neural Network

In this paper, we use the global search characteristics of genetic algorithms to help search the weight space of the neurons in the cascade-correlation architecture. The cascade-correlation learning architecture is a technique of training and building neural networks that starts with a simple network of neurons and adds additional neurons as they are needed to suit a particular problem. In our approach, instead ofmodifying the genetic algorithm to account for convergence problems, we search the weight-space using the genetic algorithm and then apply the gradient technique of Quickprop to optimize the weights. This hybrid algorithm which is a combination of genetic algorithms and cascade-correlation is applied to the two spirals problem. We also use our algorithm in the prediction of the cyclic oxidation resistance of Ni- and Co-base superalloys.

A Personalized Search Model Using Online Social Network Data Based on a Holonic Multiagent System

Personalized search utilizes user preferences to optimize search results,and most existing studies obtain user preferences by analyzing user behaviors in search engines that provide click-through data.However,the behavioral data are noisy because users often clicked some irrelevant documents to find their required information,and the new user cold start issue represents a serious problem,greatly reducing the performance of personalized search.This paper attempts to utilize online social network data to obtain user preferences that can be used to personalize search results,mine the knowledge of user interests,user influence and user relationships from online social networks,and use this knowledge to optimize the results returned by search engines.The proposed model is based on a holonic multiagent system that improves the adaptability and scalability of the model.The experimental results show that utilizing online social network data to implement personalized search is feasible and that online social network data are significant for personalized search.

Channel Assignment Method Using Parallel Tabu Search Based on Graph Theory in Wireless Sensor Networks

Wireless sensor networks are suffering from serious frequency interference.In this paper,we propose a channel assignment algorithm based on graph theory in wireless sensor networks.We first model the conflict infection graph for channel assignment with the goal of global optimization minimizing the total interferences in wireless sensor networks.The channel assignment problem is equivalent to the generalized graph-coloring problem which is a NP-complete problem.We further present a meta-heuristic Wireless Sensor Network Parallel Tabu Search(WSN-PTS) algorithm,which can optimize global networks with small numbers of iterations.The results from a simulation experiment reveal that the novel algorithm can effectively solve the channel assignment problem.

Cluster based hierarchical resource searching model in P2P network

For the problem of large network load generated by the Gnutella resource-searching model in Peer to Peer （P2P） network, a improved model to decrease the network expense is proposed, which establishes a duster in P2P network, auto-organizes logical layers, and applies a hybrid mechanism of directional searching and flooding. The performance analysis and simulation results show that the proposed hierarchical searching model has availably reduced the generated message load and that its searching-response time performance is as fairly good as that of the Gnutella model.

神经架构搜索综述

近几年,深度学习因具有强大的表征能力,已经在许多领域中取得了突破性的进展,而神经网络的架构对它的性能至关重要。然而,高性能的神经网络架构设计严重依赖研究人员的先验知识和经验,神经网络参数量庞大,难以设计最优的神经网络架构,因此自动神经架构搜索(NAS)获得了极大的关注。NAS是一种使用机器学习的方法,可以在不需要大量人力的情况下,自动搜索最优网络架构的技术,是未来神经网络设计的重要手段之一。NAS本质上是一个搜索优化问题,通过对搜索空间、搜索策略和性能评估策略的设计,自动搜索最优的网络结构。从搜索空间、搜索策略和性能评估策略这3个方面详细且全面地分析、比较和总结目前NAS的研究进展,方便读者快速了解神经架构搜索的发展过程和各项技术的优缺点,并提出NAS未来可能的研究发展方向。

Greedysearch based service location in P2P networks

A model is built to analyze the performance of service location based on greedy search in P2P networks. Hops and relative QoS index of the node found in a service location process are used to evaluate the performance as well as the probability of locating the top 5% nodes with highest QoS level. Both model and simulation results show that, the performance of greedy search based service location improves significantly with the increase of the average degree of the network. It is found that, if changes of both overlay topology and QoS level of nodes can be ignored during a location process, greedy-search based service location has high probability of finding the nodes with relatively high QoS in small number of hops in a big overlay network. Model extension under arbitrary network degree distribution is also studied.

基于遗传算法优化下棉花的产量预测模型研究

棉花是我国重要的经济作物与棉纺织业发展的主要原材料之一,是我国经济发展的支柱产业。在棉花种植过程中,农田措施、气象环境等都会对棉花生产产生影响。对棉花生长因子进行分析,建立棉花预测模型,预测我国棉花产量,对于指导棉花生产和促进我国经济发展具有重要意义。为此,针对传统BP神经网络在预测中存在测试精度低、鲁棒性差等问题,利用遗传算法(Genetic Algorithm, GA)对BP神经网络模型进行优化,构建GA-BP神经网络模型;同时,基于湖北省2011-2021年棉花播种面积、气象因子、自然灾害和棉花产量,构建BP神经网络、GA-BP神经网络模型,对湖北地区棉花产量进行预测。研究结果表明:GA-BP神经网络模型精度明显高于BP神经网络模型,R2达到0.991。因此,通过GA-BP预测能够更加科学、合理地进行棉花产量预测,对棉花生产及管理措施的调整具有重要的指导意义。

基于“车-路-站-网”信息耦合的电动汽车有序充电策略

为了消解规模化电动汽车(electrical vehicle,EV)无序充电对交通路网、充电站和配电网运行稳定性带来的负面影响,提出一种基于“车-路-站-网”信息耦合的电动汽车有序充电策略。首先,构建“车-路-站-网”信息耦合模型和动态Floyd最短时间路径搜索模型,为EV用户搜寻最短耗时路径。其次,基于“车-路-站-网”实时状态预测EV用户选择不同路径前往各充电站快充产生的充电决策因素,通过层次分析法和改进CRITIC法综合EV用户充电决策因素的主客观权重,利用Topsis方法决策EV用户的最优充电路径。最后,提出EV用户慢充优化策略,对返程EV用户的慢充负荷进行优化,结合EV慢充和快充负荷,进一步实现配电网负荷的削峰填谷。仿真结果表明,所提出的EV有序充电策略能够同时提升“车-路-站-网”多方运行水平。

基于改进松鼠搜索算法优化神经网络的数控机床进给系统热误差预测

为探究数控机床进给系统中各因素对热误差的影响规律,建立精准的热误差预测模型。在进给速度为10 m/min、环境温度20℃的条件下进行进给系统热误差测量实验,获得进给系统关键点的温升及热误差。为提高预测精度,采用Tent混沌改进松鼠搜索算法,并利用改进的算法对神经网络进行优化,建立热误差预测模型。利用热误差测量实验获得的数据进行验证,结果表明改进前的神经网络预测误差为12.23%,改进后的模型预测误差为8.92%,精度有较大提升。利用预测模型针对不同进给速度下相同位置处热误差进行分析,结果表明,进给系统中关键测温点的温度和丝杠各点的热误差随着进给速度的增加而增加。因此提出的预测模型可实现进给系统热误差的准确预测,为误差补偿提供理论依据。

基于HSS-MCC融合模型及SSA-BP神经网络开展深基坑超大变形预测研究

软土环境下深基坑开挖变形特性研究中,多采用硬化类弹塑性模型进行分析,如HSS模型和MCC模型.南京河漫滩软土地区,深基坑开挖时局部常发生较大变形,部分土体变形状态介于小应变与大应变之间,单一模型无法准确预测土体变形特征.同时,BP神经网络在基坑变形预测中得到广泛应用,但在训练过程中,权阈值易陷入局部最优解,影响预测的准确性.据此,依托南京地区典型软土深基坑工程,采用Midas中的HSS模型与MCC模型进行分析,比对两种模型的桩体变形量差异,并基于最小二乘准则对两模型进行线性融合,融合模型可对后续区段监测数据进行校准及补充.通过融合麻雀搜索算法对BP神经网络进行优化,在其训练过程中快速收敛,得到全局最优的权阈值,依托狭长基坑已开挖区段监测数据学习训练,进而依据后续区段浅部开挖揭露深部变形特征,预测结果与实测值吻合度较高.研究结果对软土地区深基坑大变形的预测研究具有重要参考价值.

考虑应力特征的锂离子电池SOC估算

准确估计荷电状态(SOC)是保证锂离子电池可靠运行的基础。提出基于多维特征特别是结合力信号的数据驱动的SOC估算方法,对锂离子电池应力特征进行Savitzky-Golay(S-G)滤波,形成优化重构后的应力信号。提出基于麻雀搜索算法(SSA)改进的反向传播(BP)神经网络,提高神经网络的全局寻优能力。用恒流(CC)、联邦城市驾驶工况(FUDS)进行评估。在BP神经网络中,相比于单纯使用电信号,考虑应力特征的SOC估算的均方根误差(RMSE)降低89.1%,平均绝对误差(MAE)降低88.8%,考虑应力特征的SSA-BP神经网络的SOC估算误差在0.3%以内,鲁棒性和精确性更高。

基于改进VMD-MCKD和深度残差网络的风机齿轮箱故障诊断

行星齿轮箱是风电机组传动系统中的重要部件,其运行工况复杂,背景噪声大,导致齿轮早期故障信号微弱且极易受背景噪声的影响。针对风电机组齿轮箱早期故障特征难以有效提取,齿轮故障难以识别的问题,提出一种风机齿轮箱故障诊断方法。首先,通过变分模态分解算法(variational mode decomposition,VMD)分解风机齿轮箱原始振动信号,获得振动信号故障的最优模态分量;接着,利用最大相关峭度解卷积算法(maximum correlated kurtosis decnvolution,MCKD)通过解卷积重构最优模态分量,削弱背景噪声增强故障冲击成分,获得故障特征;同时利用麻雀搜索算法(sparrow search algorithm,SSA)优化惩罚因子α、模态分解个数K、滤波器阶数L和反褶积周期T等参数,提升振动信号故障特征提取的准确度;最后,构建基于深度残差网络(deep residual network,ResNet)的齿轮箱故障诊断模型,建立齿轮箱故障特征与类别的非线性映射关系,实现风机齿轮箱故障分类识别。实验结果表明,所提风机齿轮箱故障诊断方法的准确率达到97.48%,相较其他方法在信号特征提取和故障诊断效率方面有明显提高。

网络搜索数据与我国GDP的关联机理分析

网络搜索数据是研究我国宏观经济现象的重要微观信息依据。本文从需求、供给与政策三方面选取和筛选关键词合成网络搜索指数,并与我国GDP进行相关性研究。结果表明:网络搜索指数与GDP的相关性较高,且两者存在长期均衡关系与短期误差修正机制,当GDP逐渐偏离均衡,将会以1~2个月的调整速度从非均衡态过渡到均衡态;网络搜索指数的增长对我国GDP有促进作用。

基于改进LSTM-SVM的双向DC-DC电力变换器故障诊断

目的为了解决双向DC-DC电力变换器的软故障诊断精度不高的问题,方法提出基于改进LSTM-SVM的双向DC-DC电力变换器故障诊断模型。首先,分析双向DC-DC电力变换器中电容、电感和MOSFET管的故障机理,通过仿真实验模拟各元件失效后变换器的输出电气参数变化,从而确定变换器不同元件故障时对应的故障特征参数;其次,构建改进的LSTM-SVM双向DC-DC电力变换器故障诊断组合模型,在LSTM中添加Mogrifier门机制,提高LSTM提取时间序列原始数据中微弱特征的能力;最后,由于传统LSTM的末端分类器为Softmax,其主要解决单一元件诊断问题,变换器故障类型较多,维数较高,所以采用麻雀搜索算法优化的SVM代替原有的Softmax函数,对LSTM输出的数据进行故障分类,提高故障诊断的准确率。设置双向DC-DC电力变换器充放电两种状态下,包含电解电容、电感和MOSFET单双管故障在内的24组故障,分别采用本文构建的改进的LSTM-SVM和原始的LSTM-SVM双向DC-DC变换器故障诊断模型进行诊断。结果结果表明,改进的LSTM-SVM故障诊断模型诊断准确率平均值为99.71%,原始的LSTM-SVM故障诊断模型诊断准确率平均值为88.48%,改进的LSTM-SVM故障诊断模型对各元件的故障诊断正确率均高于原始的LSTM-SVM故障诊断模型的。结论基于改进LSTM-SVM的双向DC-DC电力变换器故障诊断模型实现了对双向DC-DC电力变换器中的电解电容、电感和MOSFET单双管故障的准确诊断。