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

Multimodal and Temporal Graph Fusion Framework for Advanced Phishing Website Detection

IEEE Access 2025年 13卷 74128-74146页

作者： Kavya, S. Sumathi, D. Vellore Institute of Technology School of Computer Science Engineering and Information Systems Vellore India

Phishing attacks are among the persistent threats that are dynamically evolving and demand advanced detection mechanisms to counter more sophisticated techniques. Traditional detection approaches are usually based on single-modal features or static analysis, failing to capture the complex, multi-faceted nature of phishing websites and their dynamic behaviors. Thus, we present a robust Multi-Modal and Temporal Graph Fusion Framework integrating advanced learning paradigms that enhance accuracy and adaptability in phishing detection. Our work proposes four brand-new methods: Multi-Modal Hypergraph Fusion Network (MM-HFN), Temporal Graph Neural Network with Attention (TGNN-Att), Federated Graph Contrastive Learning Network (FGCL-Net), and Multi-Modal Temporal Hypergraph Fusion Network (MMTHF-Net). MM-HFN leverages hypergraphs to capture complex, high-order relationships at textual levels (BERT) and graph-based features versus visual ones (CNNs) for an accuracy in the 95–97% range. TGNN-Att addresses temporal variations in phishing behavior by using attention-enhanced temporal graph networks and LSTMs, providing dynamic detection with 94–96% accuracy. FGCL-Net ensures privacy-preserving learning across decentralized datasets through federated contrastive learning, achieving 93–95% accuracy while safeguarding data privacy. Finally, MMTHF-Net fuses multi-modal and temporal features into a dynamic hypergraph framework, achieving state-of-the-art accuracy of 96–98% with an F1-score of 0.97. These approaches together allow for exact, real-time phishing detection by capturing static and temporal behaviors, high-order relationships, and cross-modal features. The framework proposed demonstrates significant improvements compared to the state of the art, eliminating the shortcomings of single-modality and static analysis while offering scalability, privacy, and adaptability levels. © 2013 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Coarse-to-fine lightweight meta-embedding for ID-based recommendations

引用

science China(information sciences) 2025年第4期68卷 82-97页

作者： Yang WANG Haipeng LIU Zeqian YI Biao QIAN Meng WANG School of Computer Science and Information Engineering Hefei University of Technology College of Information and Intelligence Hunan Agricultural University

State-of-the-art recommender systems are increasingly focused on optimizing implementation efficiency, such as enabling on-device recommendations under memory constraints. Current methods commonly use lightweight embeddings for users and items or employ compact embeddings to enhance reusability and reduce memory usage. However, these approaches consider only the coarse-grained aspects of embeddings, overlooking subtle semantic nuances. This limitation results in an adversarial degradation of meta-embedding performance, impeding the system's ability to capture intricate relationships between users and items, leading to suboptimal recommendations. To address this, we propose a novel approach to efficiently learn meta-embeddings with varying grained and apply fine-grained meta-embeddings to strengthen the representation of their coarse-grained counterparts. Specifically, we introduce a recommender system based on a graph neural network, where each user and item is represented as a node. These nodes are directly connected to coarse-grained virtual nodes and indirectly linked to fine-grained virtual nodes, facilitating learning of multi-grained semantics. Fine-grained semantics are captured through sparse meta-embeddings, which dynamically balance embedding uniqueness and memory constraints. To ensure their sparseness, we rely on initialization methods such as sparse principal component analysis combined with a soft thresholding activation function. Moreover, we propose a weight-bridging update strategy that aligns coarse-grained meta-embedding with several fine-grained meta-embeddings based on the underlying semantic properties of users and items. Comprehensive experiments demonstrate that our method outperforms existing baselines. The code of our proposal is available at https://***/htyjers/C2F-MetaEmbed.

关键词： lightweight meta-embedding coarse-to-fine learning ID-based recommendations

来源：评论

学校读者我要写书评

暂无评论

Classifying distinct emotions from parents of ASD child using EEG source data by combining Bernoulli–Laplace Prior and graph neural networks

引用

Neural Computing and Applications 2025年第12期37卷 7877-7895页

作者： ArulDass, Stephen Dass Jayagopal, Prabhu School of Computer Science Engineering and Information Systems Vellore Institute of Technology Tamil Nadu Vellore632014 India

Emotion recognition using biological brain signals needs to be reliable to attain effective signal processing and feature extraction techniques. The impact of emotions in interpretations, conversations, and decision-making, has made automatic emotion recognition and examination of a significant feature in the field of psychiatric disease treatment and cure. The problem arises from the limited spatial resolution of EEG recorders. Predetermined quantities of electroencephalography (EEG) channels are used by existing algorithms, which combine several methods to extract significant data. The major intention of this study was to focus on enhancing the efficiency of recognizing emotions using signals from the brain through an experimental, adaptive selective channel selection approach that recognizes that brain function shows distinctive behaviors that vary from one individual to another individual and from one state of emotions to another. We apply a Bernoulli–Laplace-based Bayesian model to map each emotion from the scalp senses to brain sources to resolve this issue of emotion mapping. The standard low-resolution electromagnetic tomography (sLORETA) technique is employed to instantiate the source signals. We employed a progressive graph convolutional neural network (PG-CNN) to identify the sources of the suggested localization model and the emotional EEG as the main graph nodes. In this study, the proposed framework uses a PG-CNN adjacency matrix to express the connectivity between the EEG source signals and the matrix. Research on an EEG dataset of parents of an ASD (autism spectrum disorder) child has been utilized to investigate the ways of parenting of the child's mother and father. We engage with identifying the personality of parental behaviors when regulating the child and supervising his or her daily activities. These recorded datasets incorporated by the proposed method identify five emotions from brain source modeling, which significantly improves the accurac

关键词： Electroencephalography

来源：评论

学校读者我要写书评

暂无评论

Domain generalization with semi-supervised learning for people-centric activity recognition

引用

science China(information sciences) 2025年第1期68卷 171-188页

作者： Jing LIU Wei ZHU Di LI Xing HU Liang SONG Academy for Engineering & Technology Fudan University Shanghai East-bund Research Institute on Networking Systems of AI School of Optoelectronic Information and Computer Engineering University of Shanghai for Science & Technology

People-centric activity recognition is one of the most critical technologies in a wide range of real-world applications,including intelligent transportation systems, healthcare services, and brain-computer interfaces. Large-scale data collection and annotation make the application of machine learning algorithms prohibitively expensive when adapting to new tasks. One way of circumventing this limitation is to train the model in a semi-supervised learning manner that utilizes a percentage of unlabeled data to reduce the labeling burden in prediction tasks. Despite their appeal, these models often assume that labeled and unlabeled data come from similar distributions, which leads to the domain shift problem caused by the presence of distribution gaps. To address these limitations, we propose herein a novel method for people-centric activity recognition,called domain generalization with semi-supervised learning(DGSSL), that effectively enhances the representation learning and domain alignment capabilities of a model. We first design a new autoregressive discriminator for adversarial training between unlabeled and labeled source domains, extracting domain-specific features to reduce the distribution gaps. Second, we introduce two reconstruction tasks to capture the task-specific features to avoid losing information related to representation learning while maintaining task-specific consistency. Finally, benefiting from the collaborative optimization of these two tasks, the model can accurately predict both the domain and category labels of the source domains for the classification task. We conduct extensive experiments on three real-world sensing datasets. The experimental results show that DGSSL surpasses the three state-of-the-art methods with better performance and generalization.

关键词： activity recognition deep learning domain generalization semi-supervised learning adversarial training

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Partial multi-label learning via label-specific feature corrections

引用

science China(information sciences) 2025年第3期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

来源：评论

学校读者我要写书评

暂无评论

An enhanced framework for smart automated evaluations of answer scripts using NLP and deep learning methods

引用

Multimedia Tools and Applications 2025年第11期84卷 8491-8513页

作者： G, Mohanraj R.K, Nadesh M, Marimuthu V, Sathiyapriya School of Computer Science Engineering and Information Systems Vellore Institute of Technology Vellore632014 India School of Computer Science and Engineering Vellore Institute of Technology Chennai600127 India Knowledge Institute of Technology Salem637504 India

The manual process of evaluating answer scripts is strenuous. Evaluators use the answer key to assess the answers in the answer scripts. Advancements in technology and the introduction of new learning paradigms need automation of the evaluation process. This work aims to develop an enhanced novel hybrid framework that can evaluate answer scripts and automatically assign marks for different type of questions based on keywords, grammar, symbols, special keywords, and the given factors. First, the proposed system uses Optical Character Recognition (OCR) to convert image answer scripts into an editable text format. Second, the sentence transformers, the Natural Language Processing (NLP) technique flips the answer script and answers key texts into word embedding vectors. To find similarity measures, these vectors are matched using BERT encoding, spearmanś rank-order correlation, and fuzzy search. At last, the proposed model is trained using Deep Columnar Convolutional Neural Network (DCCNN) in the third step with MINST and Kaggle handwritten mathematical symbols and tested with the segmented mathematical equations to find the similarity. The performance of proposed model is measured using precision, recall, accuracy, and F1-score, and its gives highest accuracy of 93% and 95% when compared to the existing methodologies. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Optical character recognition

来源：评论

学校读者我要写书评

暂无评论

BMFNet: Bidirectional Multimodal Fusion Network for image captioning

引用

Multimedia systems 2025年第3期31卷 1-13页

作者： Xue, Lixia Jin, ZiQian Wang, Ronggui Yang, Juan School of Computer Science and Information Engineering Hefei University of Technology Hefei China

Image captioning is a multimodal task that involves both computer vision and natural language processing. In recent years, to address the issue of insufficient visual information, multiple features are often used. However, existing image description methods based on the encoder–decoder framework fail to achieve effective interaction and fusion of different modality features. In this paper, we propose a Bidirectional Multimodal Fusion Network (BMFNet) for image captioning, which provides deep interaction and fusion of multiple features throughout the encoding and decoding process. BMFNet first enhances grid features and region features at the channel level, then incorporates an effective bidirectional channel-level multimodal feature fusion module (CMFF) in the encoder. This module effectively compensates for differences between features and integrates their respective advantages. In the decoder, we introduce a cross-attention mechanism that adopts a dual-path information flow architecture for image caption generation. This design enables multi-stage interaction and progressive fusion between visual and semantic features, which significantly enhances the model’s cross-modal reasoning capability. Qualitative and quantitative experiments conducted on the MSCOCO dataset show that, compared to traditional methods using dual features, our model improves the CIDEr score by 2.8% on the Karpathy test split, achieving a score of 136.6 CIDEr. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2025.

关键词： Image coding

来源：评论

学校读者我要写书评

暂无评论

Data-driven output regulation control for constrained linear systems

引用

science China(information sciences) 2025年第3期68卷 338-353页

作者： Chaoyu XIA Yi DONG Chaoli WANG Shengyuan XU Shanghai Research Institute for Intelligent Autonomous Systems Tongji University College of Electronic and Information Engineering Shanghai Research Institute for Intelligent Autonomous SystemsTongji University Department of Control Science and Engineering School of Optical-Electrical and Computer EngineeringUniversity of Shanghai for Science and Technology Department of Automation Nanjing University of Science and Technology

This study introduces a data-driven approach for state and output feedback control addressing the constrained output regulation problem in unknown linear discrete-time systems. Our method ensures effective tracking performance while satisfying the state and input constraints, even when system matrices are not available. We first establish a sufficient condition necessary for the existence of a solution pair to the regulator equation and propose a data-based approach to obtain the feedforward and feedback control gains for state feedback control using linear programming. Furthermore, we design a refined Luenberger observer to accurately estimate the system state, while keeping the estimation error within a predefined set. By combining output regulation theory, we develop an output feedback control strategy. The stability of the closed-loop system is rigorously proved to be asymptotically stable by further leveraging the concept of λ-contractive sets.

关键词： output regulation constrained system data-driven.

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：