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

Privacy-preserving explainable AI: a survey

science China(information sciences) 2025年第1期68卷 23-56页

作者： Thanh Tam NGUYEN Thanh Trung HUYNH Zhao REN Thanh Toan NGUYEN Phi Le NGUYEN Hongzhi YIN Quoc Viet Hung NGUYEN School of Information and Communication Technology Griffith University School of Computer and Communication Sciences Ecole Polytechnique Federale de Lausanne Faculty of Mathematics and Computer Science University of Bremen Faculty of Information Technology HUTECH University Department of Computer Science Hanoi University of Science and Technology School of Electrical Engineering and Computer Science The University of Queensland

As the adoption of explainable AI(XAI) continues to expand, the urgency to address its privacy implications intensifies. Despite a growing corpus of research in AI privacy and explainability, there is little attention on privacy-preserving model explanations. This article presents the first thorough survey about privacy attacks on model explanations and their countermeasures. Our contribution to this field comprises a thorough analysis of research papers with a connected taxonomy that facilitates the categorization of privacy attacks and countermeasures based on the targeted explanations. This work also includes an initial investigation into the causes of privacy leaks. Finally, we discuss unresolved issues and prospective research directions uncovered in our analysis. This survey aims to be a valuable resource for the research community and offers clear insights for those new to this domain. To support ongoing research, we have established an online resource repository, which will be continuously updated with new and relevant findings.

关键词： privacy-preserving explainable AI privacy attacks privacy defences PrivEx PPXAI

来源：评论

学校读者我要写书评

暂无评论

Enhanced Acceleration for Generalized Nonconvex Low-Rank Matrix Learning

引用

Chinese Journal of Electronics 2025年第1期34卷 98-113页

作者： Hengmin Zhang Jian Yang Wenli Du Bob Zhang Zhiyuan Zha Bihan Wen School of Electrical and Electronic Engineering Nanyang Technological University School of Computer Science and Engineering Nanjing University of Science and Technology School of Information Science and Engineering East China University of Science and Technology Department of Electrical and Computer Engineering University of Macau

Matrix minimization techniques that employ the nuclear norm have gained recognition for their applicability in tasks like image inpainting, clustering, classification, and reconstruction. However, they come with inherent biases and computational burdens, especially when used to relax the rank function, making them less effective and efficient in real-world scenarios. To address these challenges, our research focuses on generalized nonconvex rank regularization problems in robust matrix completion, low-rank representation, and robust matrix regression. We introduce innovative approaches for effective and efficient low-rank matrix learning, grounded in generalized nonconvex rank relaxations inspired by various substitutes for the ?0-norm relaxed functions. These relaxations allow us to more accurately capture low-rank structures. Our optimization strategy employs a nonconvex and multi-variable alternating direction method of multipliers, backed by rigorous theoretical analysis for complexity and *** algorithm iteratively updates blocks of variables, ensuring efficient convergence. Additionally, we incorporate the randomized singular value decomposition technique and/or other acceleration strategies to enhance the computational efficiency of our approach, particularly for large-scale constrained minimization problems. In conclusion, our experimental results across a variety of image vision-related application tasks unequivocally demonstrate the superiority of our proposed methodologies in terms of both efficacy and efficiency when compared to most other related learning methods.

关键词： Learning systems Image recognition Minimization Computational efficiency Complexity theory Matrix decomposition Optimization Image reconstruction Singular value decomposition Convergence

来源：评论

学校读者我要写书评

暂无评论

A State-Migration Particle Swarm Optimizer for Adaptive Latent Factor Analysis of High-Dimensional and Incomplete Data

引用

IEEE/CAA Journal of Automatica Sinica 2024年第11期11卷 2220-2235页

作者： Jiufang Chen Kechen Liu Xin Luo Ye Yuan Khaled Sedraoui Yusuf Al-Turki MengChu Zhou IEEE the College of Computer Science and Technology Chongqing University of Posts and Telecommunications the Department of Computer Science Columbia University the College of Computer and Information Science Southwest University the Department of Electrical and Computer Engineering Faculty of Engineeringand also with K.A.CARE Energy Research and Innovation CenterKing Abdulaziz University the Center of Research Excellence in Renewable Energy and Power Systems the Department of Electrical and Computer EngineeringFaculty of Engineeringand also with K.A.CARE Energy Research and Innovation CenterKing Abdulaziz University the Department of Electrical and Computer Engineering New Jersey Institute of Technology

High-dimensional and incomplete(HDI) matrices are primarily generated in all kinds of big-data-related practical applications. A latent factor analysis(LFA) model is capable of conducting efficient representation learning to an HDI matrix,whose hyper-parameter adaptation can be implemented through a particle swarm optimizer(PSO) to meet scalable ***, conventional PSO is limited by its premature issues,which leads to the accuracy loss of a resultant LFA model. To address this thorny issue, this study merges the information of each particle's state migration into its evolution process following the principle of a generalized momentum method for improving its search ability, thereby building a state-migration particle swarm optimizer(SPSO), whose theoretical convergence is rigorously proved in this study. It is then incorporated into an LFA model for implementing efficient hyper-parameter adaptation without accuracy loss. Experiments on six HDI matrices indicate that an SPSO-incorporated LFA model outperforms state-of-the-art LFA models in terms of prediction accuracy for missing data of an HDI matrix with competitive computational ***, SPSO's use ensures efficient and reliable hyper-parameter adaptation in an LFA model, thus ensuring practicality and accurate representation learning for HDI matrices.

关键词： Data science generalized momentum high-dimensional and incomplete(HDI)data hyper-parameter adaptation latent factor analysis(LFA) particle swarm optimization(PSO)

来源：评论

学校读者我要写书评

暂无评论

A Package Level Regression Test Selection Approach for Java Software Systems

引用

IEEE Access 2025年 13卷 87848-87861页

作者： Al-Refai, Mohammed Hammad, Mahmoud M. Jordan University of Science and Technology Faculty of Computer and Information Technology Computer Science Department Irbid22110 Jordan Faculty of Engineering and Information Technology Ajman United Arab Emirates Jordan University of Science and Technology Faculty of Computer and Information Technology Software Engineering Department Irbid22110 Jordan

Regression testing of software systems is an important and critical activity yet expensive and resource-intensive. An approach to enhance its efficiency is Regression Test Selection (RTS), which selectively re-executes a subset of relevant tests that are impacted by code modifications. Previous studies on static and dynamic RTS for Java software have shown that selecting tests at the class level is more effective than using finer granularities like methods or statements. Nevertheless, RTS at the package level, which is a coarser granularity than class level, has not been thoroughly investigated or evaluated for Java projects. To address this gap, we propose PKRTS, a static package-level RTS approach that utilizes the structural dependencies of the software system under test to construct a package-level dependency graph. PKRTS analyzes dependencies in the graph and identifies relevant tests that can reach modified packages, i.e., packages containing altered classes. In contrast to conventional static RTS techniques, PKRTS implicitly considers dynamic dependencies, such as Java reflection and virtual method calls, among classes belonging to the same package by treating all those classes as a single cohesive node in the dependency graph. We evaluated PKRTS on 885 revisions of 9 open-source Java projects, with its performance compared to Ekstazi, a state-of-the-art dynamic class-level approach, and STARTS, a state-of-the-art static class-level approach. We used Ekstazi as the baseline to measure the safety and precision violations of PKRTS and STARTS. The results indicated that PKRTS outperformed static class-level RTS in terms of safety violation, which measures the extent to which relevant test cases are missed. PKRTS showed an average safety violation of 2.29% compared to 5.94% safety violation of STARTS. Despite this, PKRTS demonstrated lower precision violation and lower reduction in test suite size than class-level RTS, as it selects higher number of irrelevant te

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

Image classification of lotus in Nong Han Chaloem Phrakiat Lotus Park using convolutional neural networks

引用

Artificial Intelligence in Agriculture 2024年第1期11卷 23-33页

作者： Thanawat Phattaraworamet Sawinee Sangsuriyun Phoempol Kutchomsri Susama Chokphoemphun Department of Electrical and Computer Engineering Faculty of Science and EngineeringKasetsart University Chalermphrakiat Sakonnakhon Province Campus SakonnakhonThailand Department of Computer and Information Science Faculty of Science and EngineeringKasetsart University Chalermphrakiat Sakonnakhon Province Campus SakonnakhonThailand

The Nong Han Chaloem Phrakiat Lotus Park is a tourist attraction and a source of learning regarding lotus ***,as a training area,it lacks appeal and learning motivation due to its conventional presentation of information regarding lotus *** current study introduced the concept of smart learning in this setting to increase interest and motivation for *** neural networks(CNNs)were used for the classification of lotus plant species,for use in the development of a mobile application to display details about each *** scope of the study was to classify 11 species of lotus plants using the proposed CNN model based on different techniques(augmentation,dropout,and L2)and hyper parameters(dropout and epoch number).The expected outcome was to obtain a high-performance CNN model with reduced total parameters compared to using three different pre-trained CNN models(Inception V3,VGG16,and VGG19)as *** performance of the model was presented in terms of accuracy,F1-score,precision,and recall *** results showed that the CNN model with the augmentation,dropout,and L2 techniques at a dropout value of 0.4 and an epoch number of 30 provided the highest testing accuracy of *** best proposed model was more accurate than the pre-trained CNN models,especially compared to Inception *** addition,the number of total parameters was reduced by approximately 1.80–2.19 *** findings demonstrated that the proposed model with a small number of total parameters had a satisfactory degree of classification accuracy.

关键词： Lotus Park Classification Smart learning park Convolutional neural network

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Framework for Classification and Detection of Android Malware

International Journal of Interactive Mobile Technologies

引用

International Journal of Interactive Mobile Technologies 2024年第21期18卷 59-73页

作者： Al Sharah, Ashraf Alrub, Yousef Abu Owida, Hamza Abu Elsoud, Esraa Abu Alshdaifat, Nawaf Khtatnaha, Hamzah Department of Electrical Engineering College of Engineering Technology Al-Balqa Applied University Amman Jordan Department of Computer Information Systems Faculty of Prince Al-Hussein Bin Abdallah II for Information Technology The Hashemite University Zarqa Jordan Department of Medical Engineering Faculty of Engineering Al-Ahliyya Amman University Amman Jordan Department of Computer Science Faculty of Information Technology Zarqa University Zarqa Jordan Faculty of Information Technology Applied Science Private University Amman Jordan

The hardware and software of a computer are controlled by its operating system (OS), which performs essential tasks such as input and output processing, file and memory management, and the management of peripheral devices such as disk drives and printers. Application software refers to programs designed for specific purposes, these applications, often freely available and open source, contribute to the rising number of downloads. In the third quarter of 2022, combined downloads from the Apple App Store and Google Play Reached an estimated 35.3 billion. However, the prevalence of insecurity in these applications and technologies heightens the potential for cybercrimes. Protection against unauthorized intruders is crucial in identifying malicious applications. Machine learning (ML) serves as a promising avenue for detecting malware attacks, offering potential solutions to bolster cybersecurity measures. We propose a novel approach utilizing ML to enhance malware detection accuracy by segmenting datasets into distinct groups. Our research employs supervised ML techniques on the CICMaldroid2020 dataset, which includes comprehensive information such as intent actions, permissions, and sensitive APIs. The dataset was partitioned into four groups, each containing 150 features, and analyzed across four experiments to distinguish between attack and benign classes. Our proposed model demonstrated exceptional performance, with the random forest algorithm achieving an accuracy of 98.6% and a precision of 98.75%. These results highlight the effectiveness of our segmentation approach and its significant contribution to advancing malware detection in Android applications, offering a promising direction for future cybersecurity solutions. © 2024 by the authors of this article.

关键词： Android malware

来源：评论

学校读者我要写书评

暂无评论

IRS-enabled NOMA communication systems:A network architecture primer with future trends and challenges

引用

Digital Communications and Networks 2024年第5期10卷 1503-1528页

作者： Haleema Sadia Ahmad Kamal Hassan Ziaul Haq Abbas Ghulam Abbas Muhammad Waqas Zhu Han Faculty of Electrical Engineering and Telecommunications and Networking(TeleCoN)Research Center Ghulam Ishaq Khan Institute of Engineering and Technology(GIKI)Topi 23640Pakistan Faculty of Computer Science and Engineering GIKITopi 23640Pakistan Department of Computer Engineering College of Information TechnologyUniversity of Bahrain32028Bahrain School of Engineering Edith Cowan UniversityPerth WA6027Australia Department of Electrical and Computer Engineering University of HoustonHoustonTX 77004USA Department of Computer Science and Engineering Kyung Hee UniversitySeoul 446-701South Korea

Non-Orthogonal Multiple Access(NOMA)has already proven to be an effective multiple access scheme for5th Generation(5G)wireless *** provides improved performance in terms of system throughput,spectral efficiency,fairness,and energy efficiency(EE).However,in conventional NOMA networks,performance degradation still exists because of the stochastic behavior of wireless *** combat this challenge,the concept of Intelligent Reflecting Surface(IRS)has risen to prominence as a low-cost intelligent solution for Beyond 5G(B5G)*** this paper,a modeling primer based on the integration of these two cutting-edge technologies,i.e.,IRS and NOMA,for B5G wireless networks is *** in-depth comparative analysis of IRS-assisted Power Domain(PD)-NOMA networks is provided through 3-fold ***,a primer is presented on the system architecture of IRS-enabled multiple-configuration PD-NOMA systems,and parallels are drawn with conventional network configurations,i.e.,conventional NOMA,Orthogonal Multiple Access(OMA),and IRS-assisted OMA *** by this,a comparative analysis of these network configurations is showcased in terms of significant performance metrics,namely,individual users'achievable rate,sum rate,ergodic rate,EE,and outage ***,for multi-antenna IRS-enabled NOMA networks,we exploit the active Beamforming(BF)technique by employing a greedy algorithm using a state-of-the-art branch-reduceand-bound(BRB)*** optimality of the BRB algorithm is presented by comparing it with benchmark BF techniques,i.e.,minimum-mean-square-error,zero-forcing-BF,and ***,we present an outlook on future envisioned NOMA networks,aided by IRSs,i.e.,with a variety of potential applications for 6G wireless *** work presents a generic performance assessment toolkit for wireless networks,focusing on IRS-assisted NOMA *** comparative analysis provides a solid foundation for the dev

关键词： Intelligent reflecting surface Non-orthogonal multiple access 6G Beamforming Sum rate Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Transaction transmission model for blockchain channels based on non-cooperative games

引用

science China(information sciences) 2023年第1期66卷 97-114页

作者： Peiyun ZHANG Chenxi LI Mengchu ZHOU Wenjun HUANG Abdullah ABUSORRAH Omaimah O.BAMASAG Engineering Research Center of Digital Forensics of Ministry of Education School of Computer and SoftwareNanjing University of Information Science and Technology School of Computer and Information Anhui Normal University Department of Electrical and Computer Engineering New Jersey Institute of Technology Center of Research Excellence in Renewable Energy and Power Systems Department of Electrical and Computer Engineering Faculty of Engineering and K.A.CARE Energy Research and Innovation CenterKing Abdulaziz University Department of Computer Science Faculty of Computing and Information Technology Center of Excellence in Smart Environment Research King Abdulaziz University

In blockchain networks, transactions can be transmitted through channels. The existing transmission methods depend on their routing information. If a node randomly chooses a channel to transmit a transaction, the transmission may be aborted due to insufficient funds(also called balance) or a low transmission rate. To increase the success rate and reduce transmission delay across all transactions, this work proposes a transaction transmission model for blockchain channels based on non-cooperative game *** balance, channel states, and transmission probability are fully considered. This work then presents an optimized channel transaction transmission algorithm. First, channel balances are analyzed and suitable channels are selected if their balance is sufficient. Second, a Nash equilibrium point is found by using an iterative sub-gradient method and its related channels are then used to transmit transactions. The proposed method is compared with two state-of-the-art approaches: Silent Whispers and Speedy Murmurs. Experimental results show that the proposed method improves transmission success rate, reduces transmission delay,and effectively decreases transmission overhead in comparison with its two competitive peers.

关键词： Blockchain channel transaction transmission channel balance channel state channel transmission probability non-cooperative game

来源：评论

学校读者我要写书评

暂无评论

Hybrid Optimization Algorithm for Handwritten Document Enhancement

引用

computers, Materials & Continua 2024年第3期78卷 3763-3786页

作者： Shu-Chuan Chu Xiaomeng Yang Li Zhang Václav Snášel Jeng-Shyang Pan College of Computer Science and Engineering Shandong University of Science and TechnologyQingdao266590China School of Information and Control Engineering Qingdao University of TechnologyQingdao266520China Faculty of Electrical Engineering and Computer Science VŠB-TU OstravaOstrava70080Czech Republic Department of Information Management Chaoyang University of TechnologyTaichung41349Taiwan

The Gannet Optimization Algorithm (GOA) and the Whale Optimization Algorithm (WOA) demonstrate strong performance;however, there remains room for improvement in convergence and practical applications. This study introduces a hybrid optimization algorithm, named the adaptive inertia weight whale optimization algorithm and gannet optimization algorithm (AIWGOA), which addresses challenges in enhancing handwritten documents. The hybrid strategy integrates the strengths of both algorithms, significantly enhancing their capabilities, whereas the adaptive parameter strategy mitigates the need for manual parameter setting. By amalgamating the hybrid strategy and parameter-adaptive approach, the Gannet Optimization Algorithm was refined to yield the AIWGOA. Through a performance analysis of the CEC2013 benchmark, the AIWGOA demonstrates notable advantages across various metrics. Subsequently, an evaluation index was employed to assess the enhanced handwritten documents and images, affirming the superior practical application of the AIWGOA compared with other algorithms.

关键词： Metaheuristic algorithm gannet optimization algorithm hybrid algorithm handwritten document enhancement

来源：评论

学校读者我要写书评

暂无评论

An Experimental Study on Dynamic Lifelong Learning with GPT for Mitigating Catastrophic Forgetting in Aspect-Based Sentiment Analysis

引用

IEEE Access 2025年 13卷 90316-90332页

作者： Huang, Huang Mustafa, Mumtaz Begum Asemi, Adeleh University of Malaya Faculty of Computer Science and Information Technology Department of Software Engineering Kuala Lumpur50603 Malaysia Branch Faculty of Engineering Department of Computer Engineering Isfahan81551-39998 Iran

GPT is widely recognized as one of the most versatile and powerful large language models, excelling across diverse domains. However, its significant computational demands often render it economically unfeasible for individuals and small businesses, underscoring the need for efficient, domain-specific alternatives. In Aspect-Based Sentiment Analysis (ABSA), existing models are typically optimized for single domains, facing challenges in performing effectively across multiple domains. A key issue, known as "catastrophic forgetting,"arises when models trained on one domain lose previously learned knowledge upon exposure to new domain data. This leads to two significant problems: limited cross-domain generalization and difficulty in retaining prior knowledge while learning domain-specific information. To address these challenges, we introduce the Dynamic Lifelong Learning Aspect-Based Sentiment Analysis GPT (DllaGPT), a model designed to handle multiple domains while mitigating catastrophic forgetting. Leveraging datasets from four ABSA domains - Laptops, Restaurants, Tweets, and Finance - this study fine-tunes a pretrained GPT model from HuggingFace sequentially across domains. DllaGPT employs a mechanism to retain real data from earlier domains during new domain training, effectively preserving prior knowledge. Experimental results highlight that DllaGPT achieves an average accuracy of 0.85 and a Backward Transfer (BWT) score of -0.09 across the four domains, showcasing its high accuracy and robust lifelong learning capabilities. © 2013 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：