检索结果-南通市图书馆

Neural Tucker Factorization

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2025年第2期12卷 475-477页

作者： Peng Tang Xin Luo the college of computer and information science Southwest University IEEE

Dear Editor,This letter presents a novel latent factorization model for high dimensional and incomplete (HDI) tensor, namely the neural Tucker factorization (Neu Tuc F), which is a generic neural network-based latent-...

关键词：

Attention Eraser and Quantitative Measures for Automated Bone Age Assessment

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

computers, Materials & Continua 2025年第1期82卷 627-644页

作者： Liuqiang Shu Lei Yu college of computer and information science Chongqing Normal UniversityChongqing401331China

Bone age assessment(BAA)aims to determine whether a child’s growth and development are normal concerning their chronological *** predict bone age more accurately based on radiographs,and for the left-hand X-ray images of different races model can have better adaptability,we propose a neural network in parallel with the quantitative features from the left-hand bone measurements for *** this study,a lightweight feature extractor(LFE)is designed to obtain the featuremaps fromradiographs,and amodule called attention erasermodule(AEM)is proposed to capture the fine-grained ***,the dimensional information of the metacarpal parts in the radiographs is measured to enhance the model’s generalization capability across images fromdifferent *** is trained and validated on the RSNA,RHPE,and digital hand atlas datasets,which include images from various racial *** model achieves a mean absolute error(MAE)of 4.42 months on the RSNA dataset and 15.98 months on the RHPE *** to ResNet50,InceptionV3,and several state-of-the-art methods,our proposed method shows statistically significant improvements(p<0.05),with a reduction in MAE by 0.2±0.02 years across different racial ***,t-tests on the features also confirm the statistical significance of our approach(p<0.05).

关键词： Bone age assessment attention eraser quantitative feature metacarpal bones

Local Search-Based Anytime Algorithms for Continuous Distributed Constraint Optimization Problems

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2025年第1期12卷 288-290页

作者： Xin Liao Khoi Hoang Xin Luo the college of computer and information science Southwest University the Department of computer science and Engineering Washington University in St.Louis IEEE

Dear Editor,The distributed constraint optimization problems(DCOPs) [1]-[3]provide an efficient model for solving the cooperative problems of multi-agent systems, which has been successfully applied to model the real-world problems like the distributed scheduling [4], sensor network management [5], [6], multi-robot coordination [7], and smart grid [8]. However, DCOPs were not well suited to solve the problems with continuous variables and constraint cost in functional form, such as the target tracking sensor orientation [9], the air and ground cooperative surveillance [10], and the sensor network coverage [11].

关键词：

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

Hybrid Deep Learning Approach for Automating App Review Classification:Advancing Usability Metrics Classification with an Aspect-Based Sentiment Analysis Framework

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

computers, Materials & Continua 2025年第1期82卷 949-976页

作者： Nahed Alsaleh Reem Alnanih Nahed Alowidi Department of computer science Faculty of Computing and Information TechnologyKing Abdulaziz UniversityJeddah21589Saudi Arabia Department of computer science College of Computer Science and EngineeringUniversity of HailHail81451Saudi Arabia

App reviews are crucial in influencing user decisions and providing essential feedback for developers to improve their *** the analysis of these reviews is vital for efficient review *** traditional machine learning(ML)models rely on basic word-based feature extraction,deep learning(DL)methods,enhanced with advanced word embeddings,have shown superior *** research introduces a novel aspectbased sentiment analysis(ABSA)framework to classify app reviews based on key non-functional requirements,focusing on usability factors:effectiveness,efficiency,and *** propose a hybrid DL model,combining BERT(Bidirectional Encoder Representations from Transformers)with BiLSTM(Bidirectional Long Short-Term Memory)and CNN(Convolutional Neural Networks)layers,to enhance classification *** analysis against state-of-the-art models demonstrates that our BERT-BiLSTM-CNN model achieves exceptional performance,with precision,recall,F1-score,and accuracy of 96%,87%,91%,and 94%,*** contributions of this work include a refined ABSA-based relabeling framework,the development of a highperformance classifier,and the comprehensive relabeling of the Instagram App Reviews *** advancements provide valuable insights for software developers to enhance usability and drive user-centric application development.

关键词： Requirements Engineering(RE) app review analysis usabilitymetrics hybrid deep learning BERT-BiLSTM-CNN

Hybrid DF and SIR Forwarding Strategy in Conventional and Distributed Alamouti Space-Time Coded Cooperative Networks

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

computer Modeling in Engineering & sciences 2025年第2期142卷 1933-1954页

作者： Slim Chaoui Omar Alruwaili Faeiz Alserhani Haifa Harrouch Department of computer Engineering and Networks College of Computer and Information SciencesJouf UniversitySakaka72388Saudi Arabia computer science Department Applied CollegeUniversity of HailHail55424Saudi Arabia

In this paper,we propose a hybrid decode-and-forward and soft information relaying(HDFSIR)strategy to mitigate error propagation in coded cooperative *** the HDFSIR approach,the relay operates in decode-and-forward(DF)mode when it successfully decodes the received message;otherwise,it switches to soft information relaying(SIR)*** benefits of the DF and SIR forwarding strategies are combined to achieve better performance than deploying the DF or SIR strategy ***-form expressions for the outage probability and symbol error rate(SER)are derived for coded cooperative communication with HDFSIR and energy-harvesting ***,we introduce a novel normalized log-likelihood-ratio based soft estimation symbol(NL-SES)mapping technique,which enhances soft symbol accuracy for higher-order modulation,and propose a model characterizing the relationship between the estimated complex soft symbol and the actual high-order modulated ***-more,the hybrid DF-SIR strategy is extended to a distributed Alamouti space-time-coded cooperative *** evaluate the~performance of the proposed HDFSIR strategy,we implement extensive Monte Carlo simulations under varying channel *** demonstrate significant improvements with the hybrid technique outperforming individual DF and SIR strategies in both conventional and distributed Alamouti space-time coded cooperative ***,at a SER of 10^(-3),the proposed NL-SES mapping demonstrated a 3.5 dB performance gain over the conventional averaging one,highlighting its superior accuracy in estimating soft symbols for quadrature phase-shift keying modulation.

关键词： Cooperative communication soft information relaying soft symbols modeling cooperative diversity gain distributed Alamouti space-time code

A Support Vector Machine(SVM)Model for Privacy Recommending Data Processing Model(PRDPM)in Internet of Vehicles

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

computers, Materials & Continua 2025年第1期82卷 389-406页

作者： Ali Alqarni Department of computer science and Artificial Intelligence College of Computing and Information TechnologyUniversity of BishaBisha61922Saudi Arabia

Open networks and heterogeneous services in the Internet of Vehicles(IoV)can lead to security and privacy *** key requirement for such systems is the preservation of user privacy,ensuring a seamless experience in driving,navigation,and *** privacy needs are influenced by various factors,such as data collected at different intervals,trip durations,and user *** address this,the paper proposes a Support Vector Machine(SVM)model designed to process large amounts of aggregated data and recommend privacy preserving *** model analyzes data based on user demands and interactions with service providers or neighboring *** aims to minimize privacy risks while ensuring service continuity and *** SVMmodel helps validate the system’s reliability by creating a hyperplane that distinguishes between maximum and minimum privacy *** results demonstrate the effectiveness of the proposed SVM model in enhancing both privacy and service performance.

关键词： Support vector machine big data IoV privacy-preserving

Partial multi-label learning via label-specific feature corrections

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

science China(information sciences) 2025年第03期68卷 95-109页

作者： Jun-Yi HANG Min-Ling ZHANG School of computer science and Engineering Southeast University Key Laboratory of computer Network and information Integration(Southeast University) Ministry of Education

Partial multi-label learning（PML） allows learning from rich-semantic objects with inaccurate annotations, where a set of candidate labels are assigned to each training example but only some of them are valid. Existing approaches rely on disambiguation to tackle the PML problem, which aims to correct noisy candidate labels by recovering the ground-truth labeling information ahead of prediction model induction. However, this dominant strategy might be suboptimal as it usually needs extra assumptions that cannot be fully satisfied in real-world scenarios. Instead of label correction, we investigate another strategy to tackle the PML problem, where the potential ambiguity in PML data is eliminated by correcting instance features in a label-specific manner. Accordingly, a simple yet effective approach named PASE, i.e., partial multi-label learning via label-specific feature corrections, is proposed. Under a meta-learning framework, PASElearns to exert label-specific feature corrections so that potential ambiguity specific to each class label can be eliminated and the desired prediction model can be induced on these corrected instance features with the provided candidate labels. Comprehensive experiments on a wide range of synthetic and real-world data sets validate the effectiveness of the proposed approach.

关键词： machine learning multi-label learning partial multi-label learning label-specific features feature correction

同方期刊数据库

GPS: graph contrastive learning via multi-scale augmented views from adversarial pooling

在线全文

学校读者我要写书评

暂无评论

science China(information sciences) 2025年第1期68卷 145-158页

作者： Wei JU Yiyang GU Zhengyang MAO Ziyue QIAO Yifang QIN Xiao LUO Hui XIONG Ming ZHANG School of computer science National Key Laboratory for Multimedia Information ProcessingPeking University Artificial Intelligence Thrust The Hong Kong University of Science and Technology Department of computer science University of California

Self-supervised graph representation learning has recently shown considerable promise in a range of fields, including bioinformatics and social networks. A large number of graph contrastive learning approaches have shown promising performance for representation learning on graphs, which train models by maximizing agreement between original graphs and their augmented views(i.e., positive views). Unfortunately, these methods usually involve pre-defined augmentation strategies based on the knowledge of human experts. Moreover, these strategies may fail to generate challenging positive views to provide sufficient supervision signals. In this paper, we present a novel approach named graph pooling contrast(GPS) to address these *** by the fact that graph pooling can adaptively coarsen the graph with the removal of redundancy, we rethink graph pooling and leverage it to automatically generate multi-scale positive views with varying emphasis on providing challenging positives and preserving semantics, i.e., strongly-augmented view and weakly-augmented view. Then, we incorporate both views into a joint contrastive learning framework with similarity learning and consistency learning, where our pooling module is adversarially trained with respect to the encoder for adversarial robustness. Experiments on twelve datasets on both graph classification and transfer learning tasks verify the superiority of the proposed method over its counterparts.

关键词： graph representation learning graph neural networks graph contrastive learning graph augmentations graph pooling