检索结果-内蒙古大学图书馆

27th European Conference on Artificial Intelligence, ECAI 2024

作者： Zhang, Mingkun Li, Jianing Chen, Wei Guo, Jiafeng Cheng, Xueqi CAS Key Laboratory of AI Safety Institute of Computing Technology Chinese Academy of Sciences Beijing China Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781643685489

Adversarial purification is one of the promising approaches to defend neural networks against adversarial attacks. Recently, methods utilizing diffusion probabilistic models have achieved great success for adversarial purification in image classification tasks. However, such methods fall into the dilemma of balancing the needs for noise removal and information preservation. This paper points out that existing adversarial purification methods based on diffusion models gradually lose sample information during the core denoising process, causing occasional label shift in subsequent classification tasks. As a remedy, we suggest to suppress such information loss by introducing guidance from the classifier confidence. Specifically, we propose Classifier-cOnfidence gUided Purification (COUP) algorithm, which purifies adversarial examples while keeping away from the classifier decision boundary. Experimental results show that COUP can achieve better adversarial robustness under strong attack methods. © 2024 The Authors.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Modeling parameter interactions in ranking SVM 15

Modeling parameter interactions in ranking SVM

引用

24th ACM International Conference on Information and Knowledge Management, CIKM 2015

作者： Zhang, Yaogong Xu, Jun Lan, Yanyan Guo, Jiafeng Xie, Maoqiang Huang, Yalou Cheng, Xueqi College of Computer and Control Engineering Nankai University China CAS Key Lab. of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China College of Software Nankai University China

ISBN: (纸本)9781450337946

Ranking SVM, which formalizes the problem of learning a ranking model as that of learning a binary SVM on preference pairs of documents, is a state-of-the-art ranking model in information retrieval. The dual form solution of Ranking SVM model can be written as a linear combination of the preference pairs, i.e., w = Σ(i,j)αij(xi - xj), where αij denotes the Lagrange parameters associated with each pair (i,j). It is obvious that there exist significant interactions over the document pairs because two preference pairs could share a same document as their items. Thus it is natural to ask if there also exist interactions over the model parameters αij, which we may leverage to propose better ranking model. This paper aims to answer the question. Firstly, we found that there exists a low-rank structure over the Ranking SVM model parameters αij, which indicates that the interactions do exist. Then, based on the discovery, we made a modification on the original Ranking SVM model by explicitly applying a low-rank constraint to the parameters. Specifically, each parameter αij is decomposed as a product of two low-dimensional vectors, i.e., αij = (υi,υj), where vectors vi and vj correspond to document i and j, respectively. The learning process, thus, becomes to optimize the modified dual form objective function with respect to the low-dimensional vectors. Experimental results on three LETOR datasets show that our method, referred to as Factorized Ranking SVM, can outperform state-of-the-art baselines including the conventional Ranking SVM. © 2015 ACM.

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

Graph wavelet neural network 7

Graph wavelet neural network

引用

7th International Conference on Learning Representations, ICLR 2019

作者： Xu, Bingbing Shen, Huawei Cao, Qi Qiu, Yunqi Cheng, Xueqi CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China School of Computer and Control Engineering University of Chinese Academy of Sciences Beijing China

We present graph wavelet neural network (GWNN), a novel graph convolutional neural network (CNN), leveraging graph wavelet transform to address the shortcomings of previous spectral graph CNN methods that depend on graph Fourier transform. Different from graph Fourier transform, graph wavelet transform can be obtained via a fast algorithm without requiring matrix eigendecomposition with high computational cost. Moreover, graph wavelets are sparse and localized in vertex domain, offering high efficiency and good interpretability for graph convolution. The proposed GWNN significantly outperforms previous spectral graph CNNs in the task of graph-based semi-supervised classification on three benchmark datasets: Cora, Citeseer and Pubmed. © 7th International Conference on Learning Representations, ICLR 2019. All Rights Reserved.

关键词： Wavelet transforms

来源：评论

学校读者我要写书评

暂无评论

A Discriminative Semantic Ranker for Question Retrieval 21

A Discriminative Semantic Ranker for Question Retrieval

引用

11th ACM SIGIR International Conference on Theory of Information Retrieval, ICTIR 2021

作者： Cai, Yinqiong Fan, Yixing Guo, Jiafeng Zhang, Ruqing Lan, Yanyan Cheng, Xueqi University of Chinese Academy of Sciences Beijing China Cas Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China Institute for Ai Industry Research Tsinghua University Beijing China

ISBN: (纸本)9781450386111

Similar question retrieval is a core task in community-based question answering (CQA) services. To balance the effectiveness and efficiency, the question retrieval system is typically implemented as multi-stage rankers: The first-stage ranker aims to recall potentially relevant questions from a large repository, and the latter stages attempt to re-rank the retrieved results. Most existing works on question retrieval mainly focused on the re-ranking stages, leaving the first-stage ranker to some traditional term-based methods. However, term-based methods often suffer from the vocabulary mismatch problem, especially on short texts, which may block the re-rankers from relevant questions at the very beginning. An alternative is to employ embedding-based methods for the first-stage ranker, which compress texts into dense vectors to enhance the semantic matching. However, these methods often lose the discriminative power as term-based methods, thus introduce noise during retrieval and hurt the recall performance. In this work, we aim to tackle the dilemma of the first-stage ranker, and propose a discriminative semantic ranker, namely DenseTrans, for high-recall retrieval. Specifically, DenseTrans is a densely connected Transformer, which learns semantic embeddings for texts based on Transformer layers. Meanwhile, DenseTrans promotes low-level features through dense connections to keep the discriminative power of the learned representations. DenseTrans is inspired by DenseNet in computer vision (CV), but poses a new way to use the dense connectivity which is totally different from its original design purpose. Experimental results over two question retrieval benchmark datasets show that our model can obtain significant gain on recall against strong term-based methods as well as state-of-the-art embedding-based methods. © 2021 ACM.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Focus on the Stability of Large Systems: Toward Automatic Prediction and Analysis of Vulnerability Threat Intelligence 6

Focus on the Stability of Large Systems: Toward Automatic Pr...

引用

6th IEEE International Conference on data science in Cyberspace, DSC 2021

作者： Song, Shiwen Wu, Qiong Zheng, Xin Wang, Peng Dou, Yuchen Li, Zhongwen Zhai, Lidong Institute Of Information Engineering Chinese Academy Of Sciences BeiJing China Bag Data Academy Zhongke Beijing China Institute Of Computing Technology Chinese Academy Of Sciences Cas Key Laboratory Of Network Data Science And Technology Beijing China

ISBN: (纸本)9781665418157

With the increase in the number of users and business volume, the business systems of Internet companies are becoming more and more complex, resulting in a surge in the number of alarms. A large number of dirty alarms add a huge workload to security operations, which indirectly pose a large number of threats to business systems. At present, most systems use the method of accessing third-party Threat Intelligence to assist operators to realize automatic handling of alarms. However, this method has lagging and accuracy problems, making this work always difficult to meet the requirements of fast and accurate. This article proposes a new method for gathering vulnerability Threat Intelligence, which can obtain vulnerability information in advance of security announcements issued by security vendors. By analyzing the vulnerability disclosure process, this method obtains vulnerability information from the original source submitted by open source mail group, of developers. We used NLP technology and XGBoost model to automatically analyze the vulnerability information, and finally generate FINTEL. The experimental result shows that this method has an accuracy of 93%, and can obtain vulnerability information 10h to 7 days before security vendors release. The scope of application covers all open source code repositories and some closed source repositories. © 2021 IEEE.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

Security risk assessment based on bayesian multi-step attack graphs

引用

Journal of Computational Information Systems 2015年第11期11卷 3911-3918页

作者： Yang, Yunxue Jin, Shuyuan Fang, Binxing CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China

Security risk assessment is fundamental to the security of network systems. Attack graphs have been widely used to evaluate the likelihood of possible multi-step attacks that exploit multiple vulnerabilities in this field. The aim of this paper is to propose a dynamic risk assessment framework which considers the probability of success of a vulnerability exploitation and captures characteristics of risks for assets that are related to a particular IT environment. We use Bayesian networks to establish the model and Bayesian inference techniques of forward and backward propagation to obtain risk values of assets. We then show how the proposed model combines environmental changes in a network system making dynamic risk assessment. Finally, experimental results show that the advance of the proposed model when compared to existing work. ©, 2015, Binary Information Press. All right reserved.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

Selective Temporal Knowledge Graph Reasoning 30

Selective Temporal Knowledge Graph Reasoning

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Hou, Zhongni Jin, Xiaolong Li, Zixuan Bai, Long Guo, Jiafeng Cheng, Xueqi School of Computer Science and Technology University of Chinese Academy of Sciences China Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9782493814104

Temporal Knowledge Graph (TKG), which characterizes temporally evolving facts in the form of (subject, relation, object, timestamp), has attracted much attention recently. TKG reasoning aims to predict future facts based on given historical ones. However, existing TKG reasoning models are unable to abstain from predictions they are uncertain, which will inevitably bring risks in real-world applications. Thus, in this paper, we propose an abstention mechanism for TKG reasoning, which helps the existing models make selective, instead of indiscriminate, predictions. Specifically, we develop a confidence estimator, called Confidence Estimator with History (CEHis), to enable the existing TKG reasoning models to first estimate their confidence in making predictions, and then abstain from those with low confidence. To do so, CEHis takes two kinds of information into consideration, namely, the certainty of the current prediction and the accuracy of historical predictions. Experiments with representative TKG reasoning models on two benchmark datasets demonstrate the effectiveness of the proposed CEHis. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Few-shot Link Prediction on Hyper-relational Facts 30

Few-shot Link Prediction on Hyper-relational Facts

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Wei, Jiyao Guan, Saiping Jin, Xiaolong Guo, Jiafeng Cheng, Xueqi School of Computer Science and Technology University of Chinese Academy of Sciences China Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9782493814104

Hyper-relational facts, which consist of a primary triple (head entity, relation, tail entity) and auxiliary attribute-value pairs, are widely present in real-world Knowledge Graphs (KGs). Link Prediction on Hyper-relational Facts (LPHFs) is to predict a missing element in a hyper-relational fact, which helps populate and enrich KGs. However, existing LPHFs studies usually require an amount of high-quality data. They overlook few-shot relations, which have limited instances, yet are common in real-world scenarios. Thus, we introduce a new task, Few-Shot Link Prediction on Hyper-relational Facts (FSLPHFs). It aims to predict a missing entity in a hyper-relational fact with limited support instances. To tackle FSLPHFs, we propose MetaRH, a model that learns Meta Relational information in Hyper-relational facts. MetaRH comprises three modules: relation learning, support-specific adjustment, and query inference. By capturing meta relational information from limited support instances, MetaRH can accurately predict the missing entity in a query. As there is no existing dataset available for this new task, we construct three datasets to validate the effectiveness of MetaRH. Experimental results on these datasets demonstrate that MetaRH significantly outperforms existing representative models. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Class-Incremental Few-Shot Event Detection 30

Class-Incremental Few-Shot Event Detection

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Zhao, Kailin Jin, Xiaolong Bai, Long Guo, Jiafeng Cheng, Xueqi Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China School of Computer Science and Technology University of Chinese Academy of Sciences China

ISBN: (纸本)9782493814104

Event detection is one of the fundamental tasks in information extraction and knowledge graph. However, a realistic event detection system often needs to deal with new event classes constantly. These new classes usually have only a few labeled instances as it is time-consuming and labor-intensive to annotate a large number of unlabeled instances. Therefore, this paper proposes a new task, called class-incremental few-shot event detection. Nevertheless, this task faces two problems, i.e., old knowledge forgetting and new class overfitting. To solve these problems, this paper further presents a novel knowledge distillation and prompt learning based method, called Prompt-KD. Specifically, to handle the forgetting problem about old knowledge, Prompt-KD develops an attention based multi-teacher knowledge distillation framework, where the ancestor teacher model pre-trained on base classes is reused in all learning sessions, and the father teacher model derives the current student model via adaptation. On the other hand, in order to cope with the few-shot learning scenario and alleviate the corresponding new class overfitting problem, Prompt-KD is also equipped with a prompt learning mechanism. Extensive experiments on two benchmark datasets, i.e., FewEvent and MAVEN, demonstrate the superior performance of Prompt-KD. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

Graph based Tensor Recovery for Accurate Internet Anomaly Detection

Graph based Tensor Recovery for Accurate Internet Anomaly De...

引用

2018 IEEE Conference on Computer Communications, INFOCOM 2018

作者： Xie, Kun Li, Xiaocan Wang, Xin Xie, Gaogang Wen, Jigang Zhang, Dafang College of Computer Science and Electronics Engineering Hunan University China CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China Department of Electrical and Computer Engineering State University of New York at Stony Brook United States Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9781538641286

Detecting anomalous traffic is a crucial task of managing networks. Many anomaly detection algorithms have been proposed recently. However, constrained by their matrix-based traffic data model, existing algorithms often suffer from low detection accuracy. To fully utilize the multi-dimensional information hidden in the traffic data, this paper takes an initiative to investigate the potential and methodologies of performing tensor factorization for more accurate Internet anomaly detection. Only considering the low-rank linearity features hidden in the data, current tensor factorization techniques would result in low anomaly detection accuracy. We propose a novel Graph-based Tensor Recovery model (Graph-TR) to well explore both low rank linearity features as well as the non-linear proximity information hidden in the traffic data for better anomaly detection. We encode the non-linear proximity information of the traffic data by constructing nearest neighbor graphs and incorporate this information into the tensor factorization using the graph Laplacian. Moreover, to facilitate the quick building of neighbor graph, we propose a nearest neighbor searching algorithm with the simple locality-sensitive hashing (LSH). We have conducted extensive experiments using Internet traffic trace data Abilene and GEANT. Compared with the state of art algorithms on matrix-based anomaly detection and tensor recovery approach, our Graph-Trcan achieve significantly lower False Positive Rate and higher True Positive Rate. © 2018 IEEE.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：