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

Metarelation2vec:A Metapath-Free Scalable Representation Learning Model for Heterogeneous Networks

Tsinghua science and technology 2024年第2期29卷 553-575页

作者： Lei Chen Yuan Li Yong Lei Xingye Deng School of Information and Electrical Engineering Hunan University of Science and TechnologyXiangtan 411201China School of Computer Science and Engineering Hunan University of Science and TechnologyXiangtan 411201China

Metapaths with specific complex semantics are critical to learning diverse semantic and structural information of heterogeneous networks(HNs)for most of the existing representation learning ***,any metapaths consisting of multiple,simple metarelations must be driven by domain *** sensitive,expensive,and limited metapaths severely reduce the flexibility and scalability of the existing models.A metapath-free,scalable representation learning model,called Metarelation2vec,is proposed for HNs with biased joint learning of all metarelations in a bid to address this ***,a metarelation-aware,biased walk strategy is first designed to obtain better training samples by using autogenerating cooperation probabilities for all metarelations rather than using expert-given ***,grouped nodes by the type,a common and shallow skip-gram model is used to separately learn structural proximity for each node ***,grouped links by the type,a novel and shallow model is used to separately learn the semantic proximity for each link ***,supervised by the cooperation probabilities of all meta-words,the biased training samples are thrown into the shallow models to jointly learn the structural and semantic information in the HNs,ensuring the accuracy and scalability of the *** experimental results on three tasks and four open datasets demonstrate the advantages of our proposed model.

关键词： metarelation random walk heterogeneous network metapath representation learning

来源：评论

学校读者我要写书评

暂无评论

A Global-Local Parallel Dual-Branch Deep Learning Model with Attention-Enhanced Feature Fusion for Brain Tumor MRI Classification

引用

computers, Materials & Continua 2025年第4期83卷 739-760页

作者： Zhiyong Li Xinlian Zhou School of Computer Science and Engineering Hunan University of Science and TechnologyXiangtan411100China

Brain tumor classification is crucial for personalized treatment *** deep learning-based Artificial Intelligence(AI)models can automatically analyze tumor images,fine details of small tumor regions may be overlooked during global feature ***,we propose a brain tumor Magnetic Resonance Imaging(MRI)classification model based on a global-local parallel dual-branch *** global branch employs ResNet50 with a Multi-Head Self-Attention(MHSA)to capture global contextual information from whole brain images,while the local branch utilizes VGG16 to extract fine-grained features from segmented brain tumor *** features from both branches are processed through designed attention-enhanced feature fusion module to filter and integrate important ***,to address sample imbalance in the dataset,we introduce a category attention block to improve the recognition of minority *** results indicate that our method achieved a classification accuracy of 98.04%and a micro-average Area Under the Curve(AUC)of 0.989 in the classification of three types of brain tumors,surpassing several existing pre-trained Convolutional Neural Network(CNN)***,feature interpretability analysis validated the effectiveness of the proposed *** suggests that the method holds significant potential for brain tumor image classification.

关键词： Deep learning attention mechanism feature fusion dual-branch structure brain tumor MRI classification

来源：评论

学校读者我要写书评

暂无评论

UAV-supported intelligent truth discovery to achieve low-cost communications in mobile crowd sensing

引用

Digital Communications and Networks 2024年第4期10卷 837-852页

作者： Jing Bai Jinsong Gui Guosheng Huang Shaobo Zhang Anfeng Liu School of Computer Science and Engineering Central South UniversityChangSha410083China School of Information Science and Engineering Hunan First Normal UniversityChangsha410205China School of Computer Science and Engineering Hunan University of Science and TechnologyXiangTan411100China

Unmanned and aerial systems as interactors among different system components for communications,have opened up great opportunities for truth data discovery in Mobile Crowd Sensing(MCS)which has not been properly solved in the *** this paper,an Unmanned Aerial Vehicles-supported Intelligent Truth Discovery(UAV-ITD)scheme is proposed to obtain truth data at low-cost communications for *** main innovations of the UAV-ITD scheme are as follows:(1)UAV-ITD scheme takes the first step in employing UAV joint Deep Matrix Factorization(DMF)to discover truth data based on the trust mechanism for an Information Elicitation Without Verification(IEWV)problem in MCS.(2)This paper introduces a truth data discovery scheme for the first time that only needs to collect a part of n data samples to infer the data of the entire network with high accuracy,which saves more communication costs than most previous data collection schemes,where they collect n or kn data ***,we conducted extensive experiments to evaluate the UAV-ITD *** results show that compared with previous schemes,our scheme can reduce estimated truth error by 52.25%–96.09%,increase the accuracy of workers’trust evaluation by 0.68–61.82 times,and save recruitment costs by 24.08%–54.15%in truth data discovery.

关键词： Unmanned aerial systems Trust computing Truth discovery Deep matrix factorization Low-cost communications

来源：评论

学校读者我要写书评

暂无评论

A recover-then-discriminate framework for robust anomaly detection

引用

science China(Information sciences) 2025年第4期68卷 300-318页

作者： Peng XING Dong ZHANG Jinhui TANG Zechao LI School of Computer Science and Engineering Nanjing University of Science and Technology Department of Electronic and Computer Engineering The Hong Kong University of Science and Technology

Anomaly detection(AD) has been extensively studied and applied across various scenarios in recent years. However, gaps remain between the current performance and the desired recognition accuracy required for practical *** paper analyzes two fundamental failure cases in the baseline AD model and identifies key reasons that limit the recognition accuracy of existing approaches. Specifically, by Case-1, we found that the main reason detrimental to current AD methods is that the inputs to the recovery model contain a large number of detailed features to be recovered, which leads to the normal/abnormal area has not/has been recovered into its original state. By Case-2, we surprisingly found that the abnormal area that cannot be recognized in image-level representations can be easily recognized in the feature-level representation. Based on the above observations, we propose a novel recover-then-discriminate(ReDi) framework for *** takes a self-generated feature map(e.g., histogram of oriented gradients) and a selected prompted image as explicit input information to address the identified in Case-1. Additionally, a feature-level discriminative network is introduced to amplify abnormal differences between the recovered and input representations. Extensive experiments on two widely used yet challenging AD datasets demonstrate that ReDi achieves state-of-the-art recognition accuracy.

关键词： recovery network HOG prompt discriminative network self-correlation loss anomaly detection

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Leveraging Concise Concepts With Probabilistic Modeling for Interpretable Visual Recognition

引用

IEEE Transactions on Multimedia 2025年 27卷 3117-3131页

作者： Zhang, Yixuan Liu, Chuanbin Liu, Yizhi Gao, Yifan Lu, Zhiying Xie, Hongtao Zhang, Yongdong University of Science and Technology of China School of Information Science and Technology Hefei230027 China Hunan University of Science and Technology Department of Computer Science and Engineering Hunan411199 China

Interpretable visual recognition is essential for decision-making in high-stakes situations. Recent advancements have automated the construction of interpretable models by leveraging Visual Language Models (VLMs) and Large Language Models (LLMs) with Concept Bottleneck Models (CBMs), which process a bottleneck layer associated with human-understandable concepts. However, existing methods suffer from two main problems: a) the collected concepts from LLMs could be redundant with task-irrelevant descriptions, resulting in an inferior concept space with potential mismatch. b) VLMs directly map the global deterministic image embeddings with fine-grained concepts results in an ambiguous process with imprecise mapping results. To address the above two issues, we propose a novel solution for CBMs with Concise Concept and Probabilistic Modeling (CCPM) that can achieve superior classification performance via high-quality concepts and precise mapping strategy. First, we leverage in-context examples as category-related clues to guide LLM concept generation process. To mitigate redundancy in the concept space, we propose a Relation-Aware Selection (RAS) module to obtain a concise concept set that is discriminative and relevant based on image-concept and inter-concept relationships. Second, for precise mapping, we employ a Probabilistic Distribution Adapter (PDA) that estimates the inherent ambiguity of the image embeddings of pre-trained VLMs to capture the complex relationships with concepts. Extensive experiments indicate that our model achieves state-of-the-art results with a 6.18% improvement in classification accuracy on eight mainstream recognition benchmarks as well as reliable explainability through interpretable analysis. © 1999-2012 IEEE.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

PriChain: Efficient Privacy-Preserving Fine-Grained Redactable Blockchains in Decentralized Settings

引用

Chinese Journal of Electronics 2025年第1期34卷 82-97页

作者： Hongchen Guo Weilin Gan Mingyang Zhao Chuan Zhang Tong Wu Liehuang Zhu Jingfeng Xue School of Computer Science and Technology Beijing Institute of Technology School of Cyberspace Science and Technology Beijing Institute of Technology School of Computer and Communication Engineering University of Science and Technology Beijing

Recently, redactable blockchain has been proposed and leveraged in a wide range of real systems for its unique properties of decentralization, traceability, and transparency while ensuring controllable on-chain data redaction. However, the development of redactable blockchain is now obstructed by three limitations, which are data privacy breaches, high communication overhead, and low searching efficiency, respectively. In this paper, we propose PriChain, the first efficient privacy-preserving fine-grained redactable blockchain in decentralized settings. PriChain provides data owners with rights to control who can read and redact on-chain data while maintaining downward compatibility, ensuring the one who can redact will be able to read. Specifically, inspired by the concept of multi-authority attribute-based encryption, we utilize the isomorphism of the access control tree, realizing fine-grained redaction mechanism, downward compatibility, and collusion resistance. With the newly designed structure, PriChain can realize O（n） communication and storage overhead compared to prior O（n2） schemes. Furthermore, we integrate multiple access trees into a tree-based dictionary, optimizing searching efficiency. Theoretical analysis proves that PriChain is secure against the chosen-plaintext attack and has competitive complexity. The experimental evaluations show that PriChain realizes 10× efficiency improvement of searching and 100× lower communication and storage overhead on average compared with existing schemes.

关键词： Resistance Access control Data privacy Dictionaries Blockchains Encryption Complexity theory Usability Protection

来源：评论

学校读者我要写书评

暂无评论

Aligning enhanced feature representation for generalized zero-shot learning

引用

science China(Information sciences) 2025年第2期68卷 74-88页

作者： Zhiyu FANG Xiaobin ZHU Chun YANG Hongyang ZHOU Jingyan QIN Xu-Cheng YIN School of Computer & Communication Engineering University of Science and Technology Beijing

Constructing an effective common latent embedding by aligning the latent spaces of cross-modal variational autoencoders（VAEs） is a popular strategy for generalized zero-shot learning（GZSL）. However, due to the lack of fine-grained instance-wise annotations, existing VAE methods can easily suffer from the posterior collapse problem. In this paper, we propose an innovative asymmetric VAE network by aligning enhanced feature representation（AEFR） for GZSL. Distinguished from general VAE structures, we designed two asymmetric encoders for visual and semantic observations and one decoder for visual reconstruction. Specifically, we propose a simple yet effective gated attention mechanism（GAM） in the visual encoder for enhancing the information interaction between observations and latent variables, alleviating the possible posterior collapse problem effectively. In addition, we propose a novel distributional decoupling-based contrastive learning（D2-CL） to guide learning classification-relevant information while aligning the representations at the taxonomy level in the latent representation space. Extensive experiments on publicly available datasets demonstrate the state-of-the-art performance of our method. The source code is available at https://***/seeyourmind/AEFR.

关键词： generalized zero-shot learning gated attention mechanism contrastive learning multi-modal alignment

来源：评论

学校读者我要写书评

暂无评论

SSA: semantic structure aware inference on CNN networks for weakly pixel-wise dense predictions without cost

引用

Frontiers of computer science 2025年第2期19卷 1-10页

作者： Yanpeng SUN Zechao LI School of Computer Science and Engineering Nanjing University of Science and TechnologyNanjing 210014China

The pixel-wise dense prediction tasks based on weakly supervisions currently use Class Attention Maps(CAMs)to generate pseudo masks as ***,existing methods often incorporate trainable modules to expand the immature class activation maps,which can result in significant computational overhead and complicate the training *** this work,we investigate the semantic structure information concealed within the CNN network,and propose a semantic structure aware inference(SSA)method that utilizes this information to obtain high-quality CAM without any additional training ***,the semantic structure modeling module(SSM)is first proposed to generate the classagnostic semantic correlation representation,where each item denotes the affinity degree between one category of objects and all the ***,the immature CAM are refined through a dot product operation that utilizes semantic structure ***,the polished CAMs from different backbone stages are fused as the *** advantage of SSA lies in its parameter-free nature and the absence of additional training costs,which makes it suitable for various weakly supervised pixel-dense prediction *** conducted extensive experiments on weakly supervised object localization and weakly supervised semantic segmentation,and the results confirm the effectiveness of SSA.

关键词： class attention maps semantic structure weaklysupervised object localization weakly-supervised semantic segmentation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：