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

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Yang, Sihui Bi, Keping Cui, Wanqing Guo, Jiafeng Cheng, Xueqi CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9798891761681

Non-Factoid (NF) Question Answering (QA) is challenging to evaluate due to diverse potential answers and no objective criterion. The commonly used automatic evaluation metrics like ROUGE or BERTScore cannot accurately measure semantic similarities or answers from different perspectives. Recently, Large Language Models (LLMs) have been resorted to for NFQA evaluation due to their compelling performance on various NLP tasks. Common approaches include pointwise scoring of each candidate answer and pairwise comparisons between answers. Inspired by the evolution from pointwise to pairwise to listwise in learning-to-rank methods, we propose a novel listwise NFQA evaluation approach, that utilizes LLMs to rank candidate answers in a list of reference answers sorted by descending quality. Moreover, for NF questions that do not have multi-grade or any golden answers, we leverage LLMs to generate the reference answer list of various quality to facilitate the listwise evaluation. Extensive experimental results on three NFQA datasets, i.e., ANTIQUE, the TREC-DL-NF, and WebGLM show that our method has significantly higher correlations with human annotations compared to automatic scores and common pointwise and pairwise approaches. Our code and dataset can be found at https://***/babyyang525/LINKAGE-Listwise-NFQA-Evaluation. © 2024 Association for Computational Linguistics.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Blockchain and signcryption enabled asynchronous federated learning framework in fog computing

引用

Digital Communications and networks 2025年第2期11卷 442-454页

作者： Zhou Zhou Youliang Tian Jinbo Xiong Changgen Peng Jing Li Nan Yang State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Fujian Provincial Key Laboratory of Network Security and Cryptology College of Computer and Cyber Security Fujian Normal University Guangxi Key Laboratory of Cryptography and Information Security Guilin University of Electronic Technology

Federated learning combines with fog computing to transform data sharing into model sharing, which solves the issues of data isolation and privacy disclosure in fog computing. However, existing studies focus on centralized single-layer aggregation federated learning architecture, which lack the consideration of cross-domain and asynchronous robustness of federated learning, and rarely integrate verification mechanisms from the perspective of incentives. To address the above challenges, we propose a Blockchain and Signcryption enabled Asynchronous Federated Learning(BSAFL) framework based on dual aggregation for cross-domain scenarios. In particular, we first design two types of signcryption schemes to secure the interaction and access control of collaborative learning between domains. Second, we construct a differential privacy approach that adaptively adjusts privacy budgets to ensure data privacy and local models' availability of intra-domain user. Furthermore, we propose an asynchronous aggregation solution that incorporates consensus verification and elastic participation using blockchain. Finally, security analysis demonstrates the security and privacy effectiveness of BSAFL, and the evaluation on real datasets further validates the high model accuracy and performance of BSAFL.

关键词： Blockchain Signcryption Federated learning Asynchronous Fog computing

来源：评论

学校读者我要写书评

暂无评论

Classifier Guidance Enhances Diffusion-Based Adversarial Purification by Preserving Predictive Information 27

Classifier Guidance Enhances Diffusion-Based Adversarial Pur...

引用

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

来源：评论

学校读者我要写书评

暂无评论

Optimal weight support vector regression ensemble with cluster-based subsampling for electricity price forecasting

引用

Journal of Intelligent and Fuzzy Systems 2024年第1期1卷 1-16页

作者： Li, Yuerong Zhang, Yuhua Che, Jinxing School of Science Nanchang Institute of Technology Jiangxi Nanchang China Key Laboratory of Engineering Mathematics and Advanced Computing Nanchang Institute of Technology Jiangxi Nanchang China

Accurate prediction of short-term electricity price is the key to obtain economic benefit and also an important index of power system planning and management. Support vector regression (SVR) based ensemble works have gained remarkable achievements in terms of high accuracy and steady performance, but they are highly dependent on data representativeness and have a high computational complexity O (k ∗ N 3) of data samples and parameter selection. To further improve the data representativeness and reduce its computational complexity, this paper develops a new approach to forecast electricity price via optimal weighted ensemble. In the model, the cluster-based subsampling algorithm is proposed to categorize the inputs being seasonally decomposed into several groups, and representative data are drawn from each group in a certain proportion to ensure that each subset trained with SVR has the same representativeness and features. Moreover, the optimal weighted combination method is presented to assign weights to the sub-SVRs to obtain the optimal support vector regression ensemble model (OWSSVRE). The experimental results show that the improved support vector regression ensemble model with the same features and representativeness of the subset has better performance in electricity price forecasting. As a result, it is suitable to support decision making in the energy and other sectors. © 2024 - IOS Press. All rights reserved.

关键词： K-means clustering

来源：评论

学校读者我要写书评

暂无评论

Nested Event Extraction upon Pivot Element Recognition 30

Nested Event Extraction upon Pivot Element Recognition

引用

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

作者： Ren, Weicheng Li, Zixuan Jin, Xiaolong Bai, Long Su, Miao Liu, Yantao Guan, Saiping Guo, Jiafeng Cheng, Xueqi School of Computer Science and Technology University of Chinese Academy of Sciences China Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9782493814104

Nested Event Extraction (NEE) aims to extract complex event structures where an event contains other events as its arguments recursively. Nested events involve a kind of Pivot Elements (PEs) that simultaneously act as arguments of outer-nest events and as triggers of inner-nest events, and thus connect them into nested structures. This special characteristic of PEs brings challenges to existing NEE methods, as they cannot well cope with the dual identities of PEs. Therefore, this paper proposes a new model, called PerNee, which extracts nested events mainly based on recognizing PEs. Specifically, PerNee first recognizes the triggers of both inner-nest and outer-nest events and further recognizes the PEs via classifying the relation type between trigger pairs. The model uses prompt learning to incorporate information from both event types and argument roles for better trigger and argument representations to improve NEE performance. Since existing NEE datasets (e.g., Genia11) are limited to specific domains and contain a narrow range of event types with nested structures, we systematically categorize nested events in the generic domain and construct a new NEE dataset, called ACE2005-Nest. Experimental results demonstrate that PerNee consistently achieves state-of-the-art performance on ACE2005-Nest, Genia11, and Genia13. The ACE2005-Nest dataset and the code of the PerNee model are available at https://***/waysonren/PerNee. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Character recognition

来源：评论

学校读者我要写书评

暂无评论

A blockchain-empowered authentication scheme for worm detection in wireless sensor network

引用

Digital Communications and networks 2024年第2期10卷 265-272页

作者： Yuling Chen Xiong Yang Tao Li Yi Ren Yangyang Long State Key Laboratory of Public Big Data College of Computer Science and TechnologyGuizhou UniversityGuiyang550025China School of Computing Science University of East AngliaNorwichNR57TJUK

Wireless Sensor network(WSN)is a distributed sensor network composed a large number of nodes with low cost,low performance and *** special structure of WSN brings both convenience and *** example,a malicious participant can launch attacks by capturing a physical ***,node authentication that can resist malicious attacks is very important to network ***,blockchain technology has shown the potential to enhance the security of the Internet of Things(IoT).In this paper,we propose a Blockchain-empowered Authentication Scheme(BAS)for *** our scheme,all nodes are managed by utilizing the identity information stored on the ***,the simulation experiment about worm detection is executed on BAS,and the security is evaluated from detection and infection *** experiment results indicate that the proposed scheme can effectively inhibit the spread and infection of worms in the network.

关键词： Wireless Sensor network(WSN) Node authentication Blockchain Tangle Worm detection

来源：评论

学校读者我要写书评

暂无评论

MMH-FE:AMulti-Precision and Multi-Sourced Heterogeneous Privacy-Preserving Neural network Training Based on Functional Encryption

引用

Computers, Materials & Continua 2025年第3期82卷 5387-5405页

作者： Hao Li Kuan Shao Xin Wang Mufeng Wang Zhenyong Zhang The State Key Laboratory of Public Big Data College of Computer Science and TechnologyGuizhou UniversityGuiyang550025China Key Laboratory of Computing Power Network and Information Security Ministry of EducationShandong Computer Science CenterQilu University of Technology(Shandong Academy of Sciences)Jinan250014China China Industrial Control Systems Cyber Emergency Response Team Beijing100040China

Due to the development of cloud computing and machine learning,users can upload their data to the cloud for machine learning model ***,dishonest clouds may infer user data,resulting in user data *** schemes have achieved secure outsourced computing,but they suffer from low computational accuracy,difficult-to-handle heterogeneous distribution of data from multiple sources,and high computational cost,which result in extremely poor user experience and expensive cloud computing *** address the above problems,we propose amulti-precision,multi-sourced,andmulti-key outsourcing neural network training ***,we design a multi-precision functional encryption computation based on Euclidean ***,we design the outsourcing model training algorithm based on a multi-precision functional encryption with multi-sourced ***,we conduct experiments on three *** results indicate that our framework achieves an accuracy improvement of 6%to 30%.Additionally,it offers a memory space optimization of 1.0×2^(24) times compared to the previous best approach.

关键词： Functional encryption multi-sourced heterogeneous data privacy preservation neural networks

来源：评论

学校读者我要写书评

暂无评论

Conditional selection with CNN augmented transformer for multimodal affective analysis

引用

CAAI Transactions on Intelligence technology 2024年第4期9卷 917-931页

作者： Jianwen Wang Shiping Wang Shunxin Xiao Renjie Lin Mianxiong Dong Wenzhong Guo College of Computer and Data Science Fuzhou UniversityFuzhouChina College of Computer and Cyber Security Fujian Normal UniversityFuzhouChina Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou UniversityFuzhouChina Digital Fujian Institute of Big Data Security Technology Fujian Normal UniversityFuzhouChina Department of Sciences and Informatics Muroran Institute of TechnologyMuroranJapan

Attention mechanism has been a successful method for multimodal affective analysis in recent years. Despite the advances, several significant challenges remain in fusing language and its nonverbal context information. One is to generate sparse attention coefficients associated with acoustic and visual modalities, which helps locate critical emotional se-mantics. The other is fusing complementary cross‐modal representation to construct optimal salient feature combinations of multiple modalities. A Conditional Transformer Fusion network is proposed to handle these problems. Firstly, the authors equip the transformer module with CNN layers to enhance the detection of subtle signal patterns in nonverbal sequences. Secondly, sentiment words are utilised as context conditions to guide the computation of cross‐modal attention. As a result, the located nonverbal fea-tures are not only salient but also complementary to sentiment words directly. Experi-mental results show that the authors’ method achieves state‐of‐the‐art performance on several multimodal affective analysis datasets.

关键词： affective computing data fusion information fusion multimodal approaches

来源：评论

学校读者我要写书评

暂无评论

An Evolutionary Multitasking Algorithm for Efficient Multiobjective Recommendations

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第3期6卷 518-532页

作者： Tian, Ye Ji, Luke Hu, Yiwei Ma, Haiping Wu, Le Zhang, Xingyi Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Hefei230601 China Anhui University Institutes of Physical Science and Information Technology Hefei230601 China Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Hefei230029 China

Represented by evolutionary algorithms and swarm intelligence algorithms, nature-inspired metaheuristics have been successfully applied to recommender systems and amply demonstrated effectiveness, in particular, for multiobjective recommendation. Owing to the population-based search paradigm, these algorithms can produce a number of recommendation lists, making diverse tradeoffs between multiple metrics and meeting the requirements of accuracy, novelty, diversity, and other user preferences. However, these algorithms are criticized for the low efficiency of the optimization process, especially when the number of users is large. To address this issue, this article proposes an evolutionary multitasking-based recommendation method, where each task corresponds to a user and all the tasks are optimized simultaneously, thus highly improving the efficiency of recommendation. To enhance the convergence speed, all the users are divided into multiple populations according to the similarity between their preferences, where each population evolves with internal knowledge transfer between users, and all the populations evolve with external knowledge transfer between populations. Experimental results on various datasets verify that the proposed method can better balance between multiple metrics than classical and deep neural network-based recommendation methods and exhibits significantly higher efficiency than evolutionary multiobjective optimization-based recommendation methods. © 2024 IEEE. All rights reserved.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Beyond Precision: A Study on Recall of Initial Retrieval with Neural Representations 1

引用

28th China Conference on Information Retrieval, CCIR 2022

作者： Xiao, Yan Fan, Yixing Zhang, Ruqing Guo, Jiafeng CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China

ISBN: (数字)9783031247552

ISBN: (纸本)9783031247545

Vocabulary mismatch is a central problem in information retrieval (IR), i.e., the relevant documents may not contain the same (symbolic) terms of the query. Recently, neural representations have shown great success in capturing semantic relatedness, leading to new possibilities to alleviate the vocabulary mismatch problem in IR. However, most existing efforts in this direction have been devoted to the re-ranking stage. That is to leverage neural representations to help re-rank a set of candidate documents, which are typically obtained from an initial retrieval stage based on some symbolic index and search scheme (e.g., BM25 over the inverted index). This naturally raises a question: if the relevant documents have not been found in the initial retrieval stage due to vocabulary mismatch, there would be no chance to re-rank them to the top positions later. Therefore, in this paper, we study the problem how to employ neural representations to improve the recall of relevant documents in the initial retrieval stage. Specifically, to meet the efficiency requirement of the initial stage, we introduce a neural index for the neural representations of documents, and propose two hybrid search schemes based on both neural and symbolic indices, namely the parallel search scheme and the sequential search scheme. Our experiments show that both hybrid index and search schemes can improve the recall of the initial retrieval stage with small overhead. © 2023, Springer Nature Switzerland AG.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：