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

arXiv 2023年

作者： Wan, Wei Ning, Yuxuan Hu, Shengshan Xue, Lulu Li, Minghui Zhang, Leo Yu Jin, Hai School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Computer Science and Technology Huazhong University of Science and Technology China School of Software Engineering Huazhong University of Science and Technology China School of Information and Communication Technology Griffith University Australia National Engineering Research Center for Big Data Technology and System China Services Computing Technology and System Lab China Hubei Key Laboratory of Distributed System Security China Hubei Engineering Research Center on Big Data Security China Cluster and Grid Computing Lab China

Federated learning (FL) and split learning (SL) are prevailing distributed paradigms in recent years. They both enable shared global model training while keeping data localized on users' devices. The former excels in parallel execution capabilities, while the latter enjoys low dependence on edge computing resources and strong privacy protection. Split federated learning (SFL) combines the strengths of both FL and SL, making it one of the most popular distributed architectures. Furthermore, a recent study has claimed that SFL exhibits robustness against poisoning attacks, with a fivefold improvement compared to FL in terms of robustness. In this paper, we present a novel poisoning attack known as MISA. It poisons both the top and bottom models, causing a misalignment in the global model, ultimately leading to a drastic accuracy collapse. This attack unveils the vulnerabilities in SFL, challenging the conventional belief that SFL is robust against poisoning attacks. Extensive experiments demonstrate that our proposed MISA poses a significant threat to the availability of SFL, underscoring the imperative for academia and industry to accord this matter due attention. Copyright © 2023, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Systemization of Knowledge (SoK): Goals, Coverage, and Evaluation in Cybersecurity and Privacy Games 25

Systemization of Knowledge (SoK): Goals, Coverage, and Evalu...

引用

Proceedings of the 2025 CHI Conference on Human Factors in Computing Systems

作者： Yue Huang Marthie Grobler Lauren S. Ferro Georgia Psaroulis Sanchari Das Jing Wei Helge Janicke CSIRO's Data61 Melbourne Victoria Australia Centre for Securing Digital Futures Edith Cowan University Perth Western Australia Australia Ritchie School of Computer Science and Engineering University of Denver Denver Colorado USA CSIRO's Data61 Melbourne VIC Australia Cyber Security Cooperative Research Centre Edith Cowan University Perth Australia

来源：评论

学校读者我要写书评

暂无评论

PKAT: Pre-training in Collaborative Knowledge Graph Attention Network for Recommendation

PKAT: Pre-training in Collaborative Knowledge Graph Attentio...

引用

IEEE International Conference on data Mining (ICDM)

作者： Yi-Hong Lu Chang-Dong Wang Pei-Yuan Lai Jian-Huang Lai School of Computer Science and Engineering Sun Yat-sen University Guangzhou China Guangdong Provincial Key Laboratory of Intellectual Property and Big Data Guangzhou China South China Technology Commercialization Center Guangzhou China

With the rapid growth of online platforms and the abundance of available information, personalized recommender systems have become essential for assisting users in discovering relevant and interesting content. Among the various methods, knowledge-aware recommendation model has achieved notable success by leveraging the rich semantic information encoded in knowledge graphs. However, it overlooks the fact that users’ historical click sequences can better reflect their preferences within a period of time, thus imposing certain limitations on the recommendation performance. On the other hand, the application of pre-trained language models in recommender systems has demonstrated increasingly significant potential, as they can capture sequential patterns and dependencies within users’ historical click sequences and effectively capture contextual information in user-item interactions. To this end, we propose a hybrid recommendation model that leverages Pre-training in the collaborative Knowledge graph Attention neTwork (PKAT), to extract both the high-order connectivity information in collaborative knowledge graphs and the contextual information in users’ historical click sequences captured by Bidirectional Encoder Representations from Transformers (BERT). The collaborative knowledge graph attention network enables the model to effectively capture the intricate relationships between users, items, and knowledge entities, thus enhancing the representation learning process. Furthermore, what sets PKAT apart from other state-of-the-art knowledge-aware recommendation methods is the incorporation of the BERT language model. This integration allows PKAT to capture the contextual sequence information of user behavior, enabling it to generate more accurate and personalized recommendations. Extensive experiments are conducted on multiple benchmark datasets. And the results demonstrate that our PKAT model outperforms several state-of-the-art baselines.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A new method for predicting plant proteins function based on multi label classification algorithm

A new method for predicting plant proteins function based on...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Shuai Chen Juan Wang Maozu Guo School of Computer Science Inner Mongolia University Hohhot China School of Electrical and Information Engineering Beijing Key Laboratory of Intelligent Processing for Building Big Data Beijing University of Civil Engineering and Architecture Beijing China

ISBN: (数字)9781665468190

ISBN: (纸本)9781665468206

Protein function annotation is an important content of bioinformatics. It is unrealistic to experimentally annotate a large number of protein functions, so automated prediction of the functions of proteins is required. Studying plant proteins can help us cultivate new plant varieties. However, the existing methods mainly aim at predicting the single function of plant proteins. Most proteins only have sequence information. Therefore, the multi-function prediction method of plant protein based on sequence has become the focus of research. In this study, we propose a method based on sequence to predict the function of plant proteins, called PlantGO. We describe the functional annotation problem as a multi-label classification problem using Gene Ontology (GO) terminology, and predict multiple functions for plant proteins. PlantGO extracts features from three aspects and performs feature fusion respectively. To avoid redundant information in features, PlantGO uses the random forest to select features and obtains three groups of optimal features. PlantGO uses a multi-label learning algorithm MLKNN to predict protein function, which proves the effectiveness and accuracy of the algorithm. Finally, PlantGO adopts the ensemble learning method to integrate all models into a unified model, further improving the prediction performance. Therefore, PlantGO has achieved excellent performance. The performance metrics are Accuracy (0.936), F1 Score (0.944), Ranking loss (0.011), which is better than the previous method in the independent test. We have developed an online server to predict the functions of plant proteins.

关键词： Proteins Protein engineering Annotations Terminology Predictive models Prediction algorithms Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Backdoor Attack with Sparse and Invisible Trigger

arXiv

引用

arXiv 2023年

作者： Gao, Yinghua Li, Yiming Gong, Xueluan Li, Zhifeng Xia, Shu-Tao Wang, Qian The Tsinghua Shenzhen International Graduate School Tsinghua University Shenzhen518055 China The State Key Laboratory of Blockchain and Data Security Zhejiang University Hangzhou311200 China College of Computing and Data Science Nanyang Technological University 639798 Singapore The School of Computer Science Wuhan University China Tencent Data Platform Shenzhen518057 China The Research Center of Artificial Intelligence Peng Cheng Laboratory Shenzhen518000 China The School of Cyber Science and Engineering Wuhan University China

Deep neural networks (DNNs) are vulnerable to backdoor attacks, where the adversary manipulates a small portion of training data such that the victim model predicts normally on the benign samples but classifies the triggered samples as the target class. The backdoor attack is an emerging yet threatening training-phase threat, leading to serious risks in DNN-based applications. In this paper, we revisit the trigger patterns of existing backdoor attacks. We reveal that they are either visible or not sparse and therefore are not stealthy enough. More importantly, it is not feasible to simply combine existing methods to design an effective sparse and invisible backdoor attack. To address this problem, we formulate the trigger generation as a bi-level optimization problem with sparsity and invisibility constraints and propose an effective method to solve it. The proposed method is dubbed sparse and invisible backdoor attack (SIBA). We conduct extensive experiments on benchmark datasets under different settings, which verify the effectiveness of our attack and its resistance to existing backdoor defenses. The codes for reproducing main experiments are available at https://***/YinghuaGao/SIBA. © 2023, CC BY.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Momentum Recursive Darts

SSRN

引用

SSRN 2023年

作者： Ma, Benteng Xia, Yong Zhang, Yanning National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology School of Computer Science and Engineering Northwestern Polytechnical University Xi’an710072 China Research and Development Institute of Northwestern Polytechnical University in Shenzhen Shenzhen518057 China

DARTS has emerged as a popular method for neural architecture search (NAS) owing to its efficiency and simplicity. It employs gradient-based bi-level optimization to iteratively optimize the upper-level architecture parameters and lower-level super-network weights. One of the key challenges in DARTS is the accurate estimation of gradients for both upper-level and lower-level object functions, which existing methods struggle with, leading to significant errors in gradient approximation. To address this issue, we propose a new approach called MR-DARTS that incorporates a momentum term and a recursive scheme to improve gradient estimation. Specifically, MR-DARTS leverages historical information by using a running average of past observed gradients to enhance the quality of current gradient estimation in both upper-level and lower-level functions. Our theoretical analysis shows that the variance of our estimated gradient decreases with each iteration. By utilizing momentum and a recursive scheme, MR-DARTS effectively controls the error in stochastic gradient updates that results from inaccurate gradient estimation. Furthermore, we utilize the Neumann series approximation and Hessian Vector Product scheme to reduce computational requirements and memory usage. We evaluate our proposed method on several search spaces, including NAS Bench-201 and four variants of the DARTS search space, and demonstrate its effectiveness through comprehensive experiments. © 2023, The Authors. All rights reserved.

关键词： Image recognition

来源：评论

学校读者我要写书评

暂无评论

Kernel contextual fuzzy rule model based on conditional input space partitioning driven by data reconstruction in autoencoder and randomization-based neural networks

引用

Knowledge-Based Systems 2025年 320卷

作者： Zhang, Congcong Oh, Sung-Kwun Fu, Zunwei Pedrycz, Witold School of Mathematics and Statistics Linyi University Shandong Linyi276005 China Shandong Data Open Innovative Application Laboratory Linyi276005 China School of Automation and Electrical Engineering Linyi University Shandong Linyi276005 China School of Electrical & Electronic Engineering The University of Suwon Gyeonggi-do Hwaseong-si18323 Korea Republic of Department of Electronic Engineering Seokyeong University Seoul 02713 Korea Republic of Department of Computer Science The University of Suwon Gyeonggi-do Hwaseong-si18323 Korea Republic of Department of Electrical and Computer Engineering University of Alberta EdmontonAB T6G 2R3 Canada Systems Research Institute Polish Academy of Sciences Warsaw 00-901 Poland Istinye University Faculty of Engineering and Natural Sciences Department of Computer Engineering Sariyer/Istanbul Turkey

Fuzzy Rule-based Models (FRMs) have attracted significant interest in the field of machine learning owing to their modular architecture, robust design methodologies, and sound interpretability. This study introduces a novel Kernel Contextual Fuzzy Rule Model (KCFRM) designed to cope with regression tasks. A Kernel Contextual Fuzzy Clustering (KCFC) algorithm is proposed for conditional partitioning of the input space. Specifically, we incorporate the Mercer kernel into context fuzzy clustering to enhance the abilities of the model to distinguish, extract, and amplify useful features via nonlinear mapping, thereby generating more suitable information granules. Additionally, we employ an autoencoder's "encoding-decoding" mechanism to extract differences between data patterns and subsequently transform these into KCFC contexts via a conversion function, therefore leading to the creation of high-quality fuzzy sets. In the conclusion portion of fuzzy rules, conventional numerical or linear functions struggle to adequately describe the complex behavior present in local fuzzy regions. To mitigate this, we incorporate a Randomization-based Neural Network (RANN), capable of providing superior approximation capabilities and substantial computational efficiency. RANN overcomes traditional method constraints in representing complex behaviors within the fuzzy region. The inclusion of RANN results in more accurate and efficient conclusions for fuzzy rules. The uniqueness of this study lies in its holistic approach to designing fuzzy models with KCFC and RANN, improving the expressiveness of the rules and enhancing the generalization of the models. KCFRM's performance is assessed using various publicly available machine learning datasets, with experimental results underscoring its effectiveness and performance enhancements. © 2025

关键词： Fuzzy rules

来源：评论

学校读者我要写书评

暂无评论

Thematic Event Extraction Based on Event-Related Sentence Detection

Thematic Event Extraction Based on Event-Related Sentence De...

引用

Medical Artificial Intelligence (MedAI), IEEE International Conference on

作者： Xing Zhang Yucan Guo Xiaolong Jin Haozhe Liang Saiping Guan School of Computer Science and Technology University of Chinese Academy of Sciences CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Institute of Systems Engineering Academy of Military Science

Existing works in event extraction typically extract event arguments within the sentence scope. However, besides the sentence level, events may also be naturally presented at the document level. A document-level event usually reflects, to some extent, the theme (i.e., the main content) of the document (e.g., electronic medical records and news articles), which is thus referred to as the thematic event. Thematic Event Extraction (TEE) aims to extract the arguments of thematic events. TEE faces a major challenge, i.e., the sparsity and dispersion of arguments, which means that the arguments of a thematic event are dispersed in different sentences of the document. To overcome this challenge, we propose an Event-related Sentence Detection based TEE model, called ESDTEE, which first detects the sentences related to the thematic event and then extracts the arguments only within these detected sentences using existing models. Extensive experiments with comprehensive analyses demonstrate the effectiveness of ESDTEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Diabetes Mellitus Type 2 data Sharing System Based on Blockchain and Attribute-Encryption

Diabetes Mellitus Type 2 Data Sharing System Based on Blockc...

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Weiqi Dai Zhenhui Lu Xia Xie Duoqiang Wang Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Computer Science and Technology Hainan University Haikou China

Medical data sharing can improve the quality of medical care and promote progress in the field of public health. However, medical data has high confidentiality and complexity. Taking the clinical diagnosis and treatment data of Diabetes Mellitus Type 2 (T2DM) in medical treatment as an example, T2DM data often has the phenomenon of "multi-disease coexistence" and is insecure and inaccurate in the process of sharing. Based on Blockchain and Attribute- Encryption (ABE), we propose a T2DM data sharing system to solve the above problems. An Attribute-Encryption algorithm T2DM-CP-ABE is proposed to solve the problem of excessive sharing granularity. T2DM-CP-ABE, combined with the medical data contribution module, takes the contribution factor as an important consideration, to stimulate the power of T2DM data sharing and promote the development of national diabetes prevention. Based on the Blockchain, a medical data attribute authorization model is proposed, which provides a credible solution for multiple hospitals to realize medical data attribute authorization, and realizes the clinical diagnosis and treatment data sharing of T2DM among doctors. Based on Blockchain and ABE technology, a data sharing system for T2DM has been implemented on the Fabric platform. The result shows that the average time for the system to complete a single sharing is less than 1 second.

关键词： Authorization Hospitals Fabrics Blockchains Diabetes Encryption Security

来源：评论

学校读者我要写书评

暂无评论

High-Quality Noise Detection for Knowledge Graph Embedding with Rule-Based Triple Confidence 18th

High-Quality Noise Detection for Knowledge Graph Embedding w...

引用

18th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2021

作者： Hong, Yan Bu, Chenyang Wu, Xindong Ministry of Education Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China Mininglamp Academy of Sciences Mininglamp Technology Beijing China

ISBN: (纸本)9783030891879

Knowledge representation learning is usually used in knowledge reasoning and other related fields. Its goal is to use low-dimensional vectors to represent the entities and relations in a knowledge graph. In the process of automatic knowledge graph construction, the complexity of unstructured text and the incorrect text may make automatic construction tools unable to accurately obtain the semantic information in the text. This leads to high-quality noise with matched entity types but semantic errors. Currently knowledge representation learning methods assume that the knowledge in knowledge graphs is completely correct, and ignore the noise data generated in the process of automatic construction of knowledge graphs, resulting in errors in the vector representation of entities and relations. In order to reduce the negative impact of noise data on the construction of a representation learning model, in this study, a high-quality noise detection method with rule information is proposed. Based on the semantic association between triples in the same rule, we propose the concept of rule-based triple confidence. The calculation strategy of triple confidence is designed inspired by probabilistic soft logic (PSL). The influence of high-quality noise data in the training process of the model can be weakened by this confidence. Experiments show the effectiveness of the proposed method in dealing with high-quality noise. © 2021, Springer Nature Switzerland AG.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：