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

Cyber security monitoring and data analysis at IHEP

学校读者我要写书评

暂无评论

Cyber security monitoring and data analysis at IHEP

2019 International Symposium on Grids and Clouds, ISGC 2019

作者： Yan, Tian Hu, Hao An, Dehai Qi, Fazhi Jiang, Chen Computing Center Institute of High Energy Physics Chinese Academy of Sciences Beijing100049 China Key Laboratory of Network Assessment Technology CAS Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China Inc. Beijing100085 China

Recently, cyber security threats becomes a noticeable challenge for academic institutes. In this paper, we present the security risk control model and the cyber security detection and monitoring system designed and deployed at institute of High Energy Physics (IHEP) in China. Security data collection and analysis plays the central role in this framework. In addition to the open-source solution like Zeek, MISP and ELK stack, we also deployed a commercial Security Operation Center (SOC) as a supplement and cross-check solution. Copyright © 2019 the author(s).

关键词： Cybersecurity

Combat data shift in few-shot learning with knowledge graph

学校读者我要写书评

暂无评论

Frontiers of Computer science 2023年第1期17卷 101-111页

作者： Yongchun ZHU Fuzhen ZHUANG Xiangliang ZHANG Zhiyuan QI Zhiping SHI Juan CAO Qing HE Key Lab of Intelligent Information Processing of Chinese Academy of Sciences(CAS) Institute of Computing TechnologyCASBeijing 100190China University of Chinese Academy of Sciences Beijing 100049China Institute of Artificial Intelligence Beihang UniversityBeijing 100191China Xiamen Institute of Data Intelligence Xiamen 361021China Computer Science and Engineering University of Notre DameIN 46556USA University of California San Diego La JollaCA 92093USA College of Information Engineering&Academy for Multidisciplinary Studies Capital Normal UniversityBeijing 100089China

Many few-shot learning approaches have been designed under the meta-learning framework, which learns from a variety of learning tasks and generalizes to new tasks. These meta-learning approaches achieve the expected performance in the scenario where all samples are drawn from the same distributions (i.i.d. observations). However, in real-world applications, few-shot learning paradigm often suffers from data shift, i.e., samples in different tasks, even in the same task, could be drawn from various data distributions. Most existing few-shot learning approaches are not designed with the consideration of data shift, and thus show downgraded performance when data distribution shifts. However, it is non-trivial to address the data shift problem in few-shot learning, due to the limited number of labeled samples in each task. Targeting at addressing this problem, we propose a novel metric-based meta-learning framework to extract task-specific representations and task-shared representations with the help of knowledge graph. The data shift within/between tasks can thus be combated by the combination of task-shared and task-specific representations. The proposed model is evaluated on popular benchmarks and two constructed new challenging datasets. The evaluation results demonstrate its remarkable performance.

关键词： few-shot data shift knowledge graph

Class-Incremental Few-Shot Event Detection

学校读者我要写书评

暂无评论

arXiv 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

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. Copyright © 2024, The Authors. All rights reserved.

关键词： Distillation

Selective Temporal Knowledge Graph Reasoning

学校读者我要写书评

暂无评论

arXiv 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

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. Copyright © 2024, The Authors. All rights reserved.

关键词： Knowledge graph

From Relevance to Utility: Evidence Retrieval with Feedback for Fact Verification

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Zhang, Hengran Zhang, Ruqing Guo, Jiafeng de Rijke, Maarten Fan, Yixing Cheng, Xueqi School of Computer Science and Technology University of Chinese Academy of Sciences China CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China University of Amsterdam Netherlands The University of Amsterdam Netherlands

Retrieval-enhanced methods have become a primary approach in fact verification (FV);it requires reasoning over multiple retrieved pieces of evidence to verify the integrity of a claim. To retrieve evidence, existing work often employs off-the-shelf retrieval models whose design is based on the probability ranking principle. We argue that, rather than relevance, for FV we need to focus on the utility that a claim verifier derives from the retrieved evidence. We introduce the feedback-based evidence retriever (FER) that optimizes the evidence retrieval process by incorporating feedback from the claim verifier. As a feedback signal we use the divergence in utility between how effectively the verifier utilizes the retrieved evidence and the ground-truth evidence to produce the final claim label. Empirical studies demonstrate the superiority of FER over prevailing baselines.1 Copyright © 2023, The Authors. All rights reserved.

关键词： Machine learning

MVAM: Multi-View Attention Method for Fine-grained Image-Text Matching

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Cui, Wanqing Cheng, Rui Guo, Jiafeng Cheng, Xueqi CAS 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 Alibaba Group Beijing China

Existing two-stream models, such as CLIP, encode images and text through independent representations, showing good performance while ensuring retrieval speed, have attracted attention from industry and academia. However, the single representation often struggles to capture complex content fully. Such models may ignore fine-grained information during matching, resulting in suboptimal retrieval results. To overcome this limitation and enhance the performance of two-stream models, we propose a Multi-View Atention Method (MVAM) for image-text matching. This approach leverages diverse attention heads with unique view codes to learn multiple representations for images and text, which are then concatenated for matching. We also incorporate a diversity objective to explicitly encourage attention heads to focus on distinct aspects of the input data, capturing complementary fine-grained details. This diversity enables the model to represent image-text pairs from multiple perspectives, ensuring a more comprehensive understanding and alignment of critical content. Our method allows models to encode images and text from different perspectives and focus on more critical details, leading to better matching performance. Our experiments on MSCOCO and Flickr30K demonstrate enhancements over existing models, and further case studies reveal that different attention heads can focus on distinct content, achieving more comprehensive representations. © 2024, CC BY.

关键词： Image representation

Few-shot Link Prediction on Hyper-relational Facts

学校读者我要写书评

暂无评论

arXiv 2023年

作者： 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

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. Copyright © 2023, The Authors. All rights reserved.

关键词： Knowledge graph

Generating Personalized Imputations for Patient Health Status Prediction in Electronic Health Records

学校读者我要写书评

暂无评论

Generating Personalized Imputations for Patient Health Statu...

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Liu, Yang Zhang, Weiyu Si, Jiasheng Li, Zhao Peng, Xueping Lu, Wenpeng Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan China Evay Info Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Jinan China University of Technology Sydney Australian Artificial Intelligence Institute Sydney Australia

ISBN: (纸本)9798350386226

Electronic health records (EHRs) play a crucial role in the development of personalized treatment plans for patients. However, EHRs are often highly incomplete, posing significant challenges for predictive modeling. While existing deep learning models employ various imputation techniques to reconstruct missing values, they often fail to represent missing data in a personalized manner and do not learn from the missingness patterns in EHRs data. This limitation reduces their effectiveness in practical personalized healthcare applications. To address this issue, we propose SPIME, a self-supervised model that generates personalized imputations in EHRs data for patient health status prediction. We introduce a personalized missing mask (PMM) based on the frequency of feature measurements. Additionally, we incorporate a masked imputation task (MIT) loss that minimizes the loss of artificially introduced missing values, thereby enhancing the model's capability to handle missing data. SPIME adopts self-supervised pretraining to learn representations from personalized missing patterns and reconstructs missing data in the latent space. To further enhance representation learning, two independent attention mechanisms are applied separately across the feature and temporal dimensions. Experimental results on two real-world EHRs datasets show that SPIME outperforms existing state-of-the-art methods in predicting in-hospital mortality and decompensation, demonstrating its effectiveness in reconstructing missing data and predicting patient health status. The code will be published at https://***/cling6666/SPIME. © 2024 IEEE.

关键词： Electronic health record

Provably Robust Node Classification via Low-Pass Message Passing

学校读者我要写书评

暂无评论

Provably Robust Node Classification via Low-Pass Message Pas...

IEEE International Conference on data Mining (ICDM)

作者： Yiwei Wang Shenghua Liu Minji Yoon Hemank Lamba Wei Wang Christos Faloutsos Bryan Hooi School of Computing National University of Singapore Singapore Institute of Computing Technology Chinese Academy of Sciences China CAS Key Laboratory of Network Data Science & Technology CAS and University of Chinese Academy of Sciences Beijing China Carnegie Mellon University United States

ISBN: (数字)9781728183169

ISBN: (纸本)9781728183176

Graph Convolutional networks (GCNs) have achieved state-of-the-art performance on node classification. However, recent works have shown that GCNs are vulnerable to adversarial attacks, such as additions or deletions of adversarially-chosen edges in the graph, in order to mislead the node classification algorithms. How can we design robust GCNs that are resistant to such adversarial attacks? More challengingly, how can we do this in a way that is provably robust? We propose a robust node classification approach based on a low-pass `message passing' mechanism, that (a) reduces the effectiveness of adversarial attacks in experiments, and (b) provides theoretical guarantees against adversarial attacks. Our approach can be embedded into the existing GCN architectures to enhance their robustness. Empirical results show that our loss-pass method effectively improves the performance of multiple GCNs under miscellaneous perturbations and helps them to achieve superior performance on various graphs.

关键词： Resistance Perturbation methods Message passing Reliability engineering Robustness Task analysis Optimization