Most existing Salient Object Detection (SOD) methods focus on achieving better performance, often resulting in models with a large number of parameters. However, there is limited research on lightweight models in this...
详细信息
In recent years,machine learning has made great progress in intrusion detection,network protection,anomaly detection,and other issues in ***,these traditional machine learning algorithms usually require a lot of data ...
详细信息
In recent years,machine learning has made great progress in intrusion detection,network protection,anomaly detection,and other issues in ***,these traditional machine learning algorithms usually require a lot of data to learn and have a low recognition rate for unknown *** them,“one-shot learning”,“few-shot learning”,and“zero-shot learning”are challenges that cannot be ignored for traditional machine *** more intractable problem in cyberspace security is the changeable attack *** a new attack mode appears,there are few or even zero samples that can be ***-learning comes from imitating human problem-solving methods as humans can quickly learn unknown things based on their existing knowledge when *** purpose is to quickly obtain a model with high accuracy and strong generalization through less data *** article first divides the meta-learning model into five research directions based on different principles of *** are model-based,metric-based,optimization-based,online-learning-based,or stacked ***,the current problems in the field of cyberspace security are categorized into three branches:cyber security,information security,and artificial intelligence security according to different ***,the application research results of various meta-learning models on these three branches are *** the same time,based on the characteristics of strong generalization,evolution,and scalability of meta-learning,we contrast and summarize its advantages in solving ***,the prospect of future deep application of meta-learning in the field of cyberspace security is summarized.
The physical world we live in is accelerating digitalization with the vigorous development of Internet of Things (IoT). Following this trend, Web of Things (WoT) further enables fast and efficient creation of various ...
详细信息
The relation is a semantic expression relevant to two named entities in a *** a sentence usually contains several named entities,it is essential to learn a structured sentence representation that encodes dependency in...
详细信息
The relation is a semantic expression relevant to two named entities in a *** a sentence usually contains several named entities,it is essential to learn a structured sentence representation that encodes dependency information specific to the two named *** related work,graph convolutional neural networks are widely adopted to learn semantic dependencies,where a dependency tree initializes the adjacency ***,this approach has two main ***,parsing a sentence heavily relies on external toolkits,which can be ***,the dependency tree only encodes the syntactical structure of a sentence,which may not align with the relational semantic *** this paper,we propose an automatic graph learningmethod to autonomously learn a sentence’s structural *** of using a fixed adjacency matrix initialized by a dependency tree,we introduce an Adaptive Adjacency Matrix to encode the semantic dependency between *** elements of thismatrix are dynamically learned during the training process and optimized by task-relevant learning objectives,enabling the construction of task-relevant semantic dependencies within a *** model demonstrates superior performance on the TACRED and SemEval 2010 datasets,surpassing previous works by 1.3%and 0.8%,*** experimental results show that our model excels in the relation extraction task,outperforming prior models.
Currently,most existing inductive relation prediction approaches are based on subgraph structures,with subgraph features extracted using graph neural networks to predict ***,subgraphs may contain disconnected regions,...
详细信息
Currently,most existing inductive relation prediction approaches are based on subgraph structures,with subgraph features extracted using graph neural networks to predict ***,subgraphs may contain disconnected regions,which usually represent different semantic *** not all semantic information about the regions is helpful in relation prediction,we propose a relation prediction model based on a disentangled subgraph structure and implement a feature updating approach based on relevant semantic *** indirectly achieve the disentangled subgraph structure from a semantic perspective,the mapping of entity features into different semantic spaces and the aggregation of related semantics on each semantic space are *** disentangled model can focus on features having higher semantic relevance in the prediction,thus addressing a problem with existing approaches,which ignore the semantic differences in different subgraph ***,using a gated recurrent neural network,this model enhances the features of entities by sorting them by distance and extracting the path information in the ***,it is shown that when there are numerous disconnected regions in the subgraph,our model outperforms existing mainstream models in terms of both Area Under the Curve-Precision-Recall(AUC-PR)and Hits@*** prove that semantic differences in the knowledge graph can be effectively distinguished and verify the effectiveness of this method.
This study addresses the challenges faced in personalized tutoring within large-scale programming courses, such as significant ability gaps among students, limited available resources, among others. For these reasons,...
详细信息
The development of information technology brings diversification of data sources and large-scale data sets and calls for the exploration of distributed learning algorithms. In distributed systems, some local machines ...
详细信息
The development of information technology brings diversification of data sources and large-scale data sets and calls for the exploration of distributed learning algorithms. In distributed systems, some local machines may behave abnormally and send arbitrary information to the central machine(known as Byzantine failures), which can invalidate the distributed algorithms based on the assumption of faultless systems. This paper studies Byzantine-robust distributed algorithms for support vector machines(SVMs) in the context of binary classification. Despite a vast literature on Byzantine problems, much less is known about the theoretical properties of Byzantine-robust SVMs due to their unique challenges. In this paper, we propose two distributed gradient descent algorithms for SVMs. The median and trimmed mean operations in aggregation can effectively defend against Byzantine failures. Theoretically, we show the convergence of the proposed estimators and provide the statistical error rates. After a certain number of iterations, our estimators achieve near-optimal rates. Simulation studies and real data analysis are conducted to demonstrate the performance of the proposed Byzantine-robust distributed algorithms.
This paper aims to address the difficulties faced by novice programmers in grasping code structure and execution flow, improving programming thinking, and pinpointing code errors with accuracy. It proposes providing s...
详细信息
The human brain network consists of tightly connected modular nodes, including local functional areas and global functional connections. Graph Convolutional Networks (GCNs) have shown impressive capabilities in learni...
详细信息
Deep neural network models have demonstrated their effectiveness in classifying multi-label data from various domains. Typically, they employ a training mode that combines mini-batches with optimizers, where each samp...
详细信息
暂无评论