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

Adaptive Intention Learning for Session-Based Recommendation

ACM Transactions on Intelligent Systems and Technology 2025年第2期16卷 1-26页

作者： Zhang, Qingbo Yang, Xiaochun Chen, Hao Wang, Bin Sun, Zhu Zhou, Xiangmin Computer Science and Engineering Northeastern University Shenyang China Northeastern University Shenyang China National Frontiers Science Center for Industrial Intelligence and Systems Optimization Shenyang China Singapore University of Technology and Design Singapore Singapore Rmit University Melbourne Australia Key Laboratory of Data Analytics and Optimization for Smart Industry Northeastern University Ministry of Education Shenyang China

In recent years, session-based recommender systems (SRSs) have emerged as a significant research focus within the recommendation field. Capturing user intentions to infer user interest accordingly has proven to be effective in enhancing the accuracy of SRSs. However, existing techniques assume that all sessions have the same number of intentions or that the items in one category belonging to the same session reflect the same intention. In real applications, such as e-commerce, sessions may have different numbers of intentions, and the same type of items in a session may correspond to different intentions. As a result, existing techniques cannot guarantee high-quality user interest prediction. In this article, we propose a novel Adaptive Intention Learning Network (AILN) to capture an adaptive number of intentions for each session, thereby enhancing the accuracy of user interest inference. Specifically, we design an intention evaluation network (IEN) to evaluate whether a subsequence of a session corresponds to a valid intention, and an intention generation network (IGN) to learn the representation of a valid intention. By checking each subsequence of a session, IEN and IGN enable the incremental learning of a session-specific intention hierarchy (IH) to store valid intentions of the session. To reduce the cost of building the IH, we propose a pruning strategy that exploits the intention validity to avoid unnecessary evaluation. The representative intentions are selected from IH and input into a designed interest predictor to infer the user interest. Experimental results on two real-world datasets demonstrate the superiority of our proposed AILN. © 2025 Copyright held by the owner/author(s). Publication rights licensed to ACM.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Auxiliary Tasks Benefit Skeleton-based Action Recognition

Auxiliary Tasks Benefit Skeleton-based Action Recognition

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Yuheng Yang Haipeng Chen College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Skeleton-based action recognition has long been a fundamental and intriguing problem in machine intelligence. This task is challenging due to pose occlusion and rapid motion, which typically results in incomplete or noisy skeleton data. State-of-the-art methods tend to learn human motion directly from these corrupted skeletons as if they were reliable. Unfortunately, this might lead to unsatisfactory results when key regions of the skeleton are occluded or disturbed. To tackle the problem, we propose a novel framework that integrates auxiliary tasks into a motion modeling network. These auxiliary tasks corrupt partial human skeletons with masking or noise and then force the network to recover the corrupted data, explicitly facilitating robust feature representation learning. We further propose supervising the auxiliary tasks with mutual information losses, mathematically ensuring feature consistency and spatial alignment between the recovered and original skeleton data. Empirically, our approach sets the new state-of-the-art performance on three benchmark datasets.

关键词： Representation learning Noise Speech recognition Benchmark testing Skeleton Mathematical models Reliability Noise measurement Speech processing Mutual information

来源：评论

学校读者我要写书评

暂无评论

SIGNAL-COMPARISON-BASED DISTRIBUTED ESTIMATION UNDER DECAYING AVERAGE data RATE COMMUNICATIONS

引用

SIAM Journal on Control and Optimization 2025年第2期63卷 1129-1155页

作者： Ke, Jieming Lu, Xiaodong Zhao, Yanlong Zhang, Ji-Feng School of Mathematical Sciences University of Chinese Academy of Sciences Beijing100049 China School of Automation and Electrical Engineering University of Science and Technology Beijing Beijing100083 China Key Laboratory of Knowledge Automation for Industrial Processes Ministry of Education Beijing100083 China State Key Laboratory of Mathematical Sciences Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China School of Mathematical Sciences University of Chinese Academy of Sciences Beijing100149 China School of Automation and Electrical Engineering Zhongyuan University of Technology Henan Province Zhengzhou450007 China

The paper investigates the distributed estimation problem under low data rate communications. Based on the signal-comparison (SC) consensus protocol under binary-valued communications, a new consensus+innovations type distributed estimation algorithm is proposed. First, the high-dimensional estimates are compressed into binary-valued messages by using a periodic compressive strategy, dithering noises, and a sign function. Next, based on the dithering noises and expanding triggering thresholds, a new stochastic event-triggered mechanism is proposed to reduce the communication frequency. Then, a modified SC consensus protocol is applied to fuse the neighborhood information. Finally, a stochastic approximation estimation algorithm is used to process innovations. The proposed SC-based algorithm has the advantages of high effectiveness and low communication cost. For the effectiveness, the estimates of the SC-based algorithm converge to the true value in the almost sure and mean square sense, and a polynomial almost sure convergence rate is also obtained. For the communication cost, the local and global average data rates decay to zero at a polynomial rate. The trade-off between the convergence rate and the communication cost is established through event-triggered coefficients. A better convergence rate can be achieved by decreasing event-triggered coefficients, while a lower communication cost can be achieved by increasing event-triggered coefficients. A simulation example is given to demonstrate the theoretical results. © 2025 Society for Industrial and Applied Mathematics.

关键词： Cost benefit analysis

来源：评论

学校读者我要写书评

暂无评论

Structure-Based Uncertainty Estimation for Source-Free Active Domain Adaptation

引用

IET Computer Vision 2025年第1期19卷

作者： Ouyang, Jihong Zhang, Zhengjie Meng, Qingyi Chi, Jinjin College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

Active domain adaptation (active DA) provides an effective solution by selectively labelling a limited number of target samples to significantly enhance adaptation performance. However, existing active DA methods often struggle in real-world scenarios where, due to data privacy concerns, only a pre-trained source model is available, rather than the source samples. To address this issue, we propose a novel method called the structure-based uncertainty estimation model (SUEM) for source-free active domain adaptation (SFADA). To be specific, we introduce an innovative active sample selection strategy that combines both uncertainty and diversity sampling to identify the most informative samples. We assess the uncertainty in target samples using structure-wise probabilities and implement a diversity selection method to minimise redundancy. For the selected samples, we not only apply standard-supervised loss but also conduct interpolation consistency training to further explore the structural information of the target domain. Extensive experiments across four widely used datasets demonstrate that our method is comparable to or outperforms current UDA and active DA methods. © 2025 The Author(s). IET Computer Vision published by John Wiley & Sons Ltd on behalf of The Institution of engineering and Technology.

关键词： computer vision convolutional neural nets image classification

来源：评论

学校读者我要写书评

暂无评论

Controlled-source electromagnetic noise attenuation via a deep convolutional neural network and high-quality sounding curve screening mechanism

引用

Geophysics 2025年第3期90卷 WA125-WA140页

作者： Liu, Yecheng Li, Diquan Li, Jin Zhang, Xian Central South University Monitoring Ministry of Education Key Laboratory of Metallogenic Prediction of Nonferrous Metals and Geological Environment Changsha China Hunan Provincial Key Laboratory of Non-ferrous Resources and Geological Hazard Detection Changsha China Central South University School of Geoscience and Info-physics Changsha China Hunan Normal University College of Information Science and Engineering Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Changsha China Hunan University of Finance and Economics School of Information Technology and Management Hunan Provincial Key Laboratory of Finance & Economics Big Data Science and Technology Changsha China

Strong noise is one of the biggest challenges in controlled-source electromagnetic (CSEM) exploration, which severely affects the quality of the recorded signal. We develop a novel and effective CSEM noise attenuation method that integrates a deep convolutional neural network (DCNN) with a high-quality sounding curve screening mechanism. This method first uses a DCNN to learn the large-scale noise characteristics of CSEM measured data and build a DCNN denoising model for attenuating the noise. Because some impulse noise remains after DCNN denoising, the high-quality sounding curve screening mechanism is innovatively applied to optimize the DCNN denoised data. The core of this method is the smoothness value (SV), which quantitatively evaluates the smoothness of the sounding curve (apparent resistivity curve). In effect, the mechanism segments the overall DCNN denoised data and calculates the corresponding sounding curve and its SV for each segment. The highest-quality sounding curve can be screened out by comparing the SVs of all curves as well as obtaining the highest-quality data segment present in the overall DCNN denoised data. Finally, our method is validated with synthetic and field data, demonstrating its feasibility and effectiveness in attenuating large-scale CSEM noise. The quality of CSEM data, which is heavily affected by noise, is significantly improved after processing by our method. © 2025 Society of Exploration Geophysicists. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Optimal torque of cantilever boring robots in the footage process under complex terrains

Robotic Intelligence and Automation

引用

Robotic Intelligence and Automation 2025年

作者： Liu, Yang Li, Fenghe Hu, Yanpeng Guo, Jin School of Automation and Electrical Engineering University of Science and Technology Beijing Beijing China Key Laboratory of Knowledge Automation for Industrial Processes Ministry of Education Beijing China

Purpose: This paper aims to propose an optimal control strategy based on the slip rate during the tunnel footage process for cantilever boring robots. Design/methodology/approach: A method combining adaptive dynamic programming and linear quadratic regulator is used to solve for the optimal torque, aiming to achieve precise and stable control strategies. Findings: The feasibility of the proposed method is demonstrated through an actual footage process. Comparative analysis with other methods further illustrates the superiority of this approach. Originality/value: Combining the slip rate to calculate the optimal torque of the cantilever boring robots under complex road conditions is essential to overcoming the slip phenomenon during the footage process. The method proposed in this paper is very useful for current systems and intuitive for similar robots. © 2025, Emerald Publishing Limited.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

NI-GDBA: Non-Intrusive Distributed Backdoor Attack Based on Adaptive Perturbation on Federated Graph Learning 34

NI-GDBA: Non-Intrusive Distributed Backdoor Attack Based on ...

引用

34th ACM Web Conference, WWW 2025

作者： Li, Ken Shi, Bin Wei, Jiazhe Dong, Bo School of Computer Science and Technology Xi’an Jiaotong University Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi’an China School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi’an China School of Distance Education Xi’an Jiaotong University Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi’an China

ISBN: (纸本)9798400712746

Federated Graph Learning (FedGL) is an emerging Federated Learning (FL) framework that learns the graph data from various clients to train better Graph Neural Networks(GNNs) model. Owing to concerns regarding the security of such framework, numerous studies have attempted to execute backdoor attacks on FedGL, with a particular focus on distributed backdoor attacks. However, all existing methods posting distributed backdoor attack on FedGL only focus on injecting distributed backdoor triggers into the training data of each malicious client, which will cause model performance degradation on original task and is not always effective when confronted with robust federated learning defense algorithms, leading to low success rate of attack. What’s more, the backdoor signals introduced by the malicious clients may be smoothed out by other clean signals from the honest clients, which potentially undermining the performance of the attack. To address the above significant shortcomings, we propose a non-intrusive graph distributed backdoor attack(NI-GDBA) that does not require backdoor triggers to be injected in the training data. Our attack trains an adaptive perturbation trigger generator model for each malicious client to learn the natural backdoor from the GNN model downloading from the server with the malicious client’s local data. In contrast to traditional distributed backdoor attacks on FedGL via trigger injection in training data, our attack on different datasets such as Molecules and Bioinformatics have higher attack success rate, stronger persistence and stealth, and has no negative impact on the performance of the global GNN model. We also explore the robustness of NI-GDBA under different defense strategies, and based on our extensive experimental studies, we show that our attack method is robust to current federated learning defense methods, thus it is necessary to consider non-intrusive distributed backdoor attacks on FedGL as a novel threat that requires custom d

关键词： Backdoor Attacks Federated Graph Learning

来源：评论

学校读者我要写书评

暂无评论

arXiv

引用

arXiv 2025年

作者： Li, Yangning Kang, Hui Li, Jiahui Sun, Geng Sun, Zemin Wang, Jiacheng Zhao, Changyuan Niyato, Dusit College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University 639798 Singapore College of Computing and Data Science Nanyang Technological University Singapore

An expansion of Internet of Things (IoTs) has led to significant challenges in wireless data harvesting, dissemination, and energy management due to the massive volumes of data generated by IoT devices. These challenges are exacerbated by data redundancy arising from spatial and temporal correlations. To address these issues, this paper proposes a novel data-driven collaborative beamforming (CB)-based communication framework for IoT networks. Specifically, the framework integrates CB with an overlap-based multi-hop routing protocol (OMRP) to enhance data transmission efficiency while mitigating energy consumption and addressing hot spot issues in remotely deployed IoT networks. Based on the data aggregation to a specific node by OMRP, we formulate a node selection problem for the CB stage, with the objective of optimizing uplink transmission energy consumption. Given the complexity of the problem, we introduce a softmax-based proximal policy optimization with long-short-term memory (SoftPPO-LSTM) algorithm to intelligently select CB nodes for improving transmission efficiency. Simulation results show that the proposed OMRP improves network lifetime by 17% compared to benchmark routing protocols, while the SoftPPO-LSTM method for CB node selection achieves an 8.3% increase in throughput over benchmark algorithms. The results also reveal that the combined OMRP with the SoftPPO- Copyright © 2025, The Authors. All rights reserved.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

TraSculptor: Visual Analytics for Enhanced Decision-Making in Road Traffic Planning

引用

IEEE Transactions on Visualization and Computer Graphics 2025年 PP卷 PP页

作者： Deng, Zikun Liu, Yuanbang Zhu, Mingrui Xiang, Da Yu, Haiyue Su, Zicheng Lu, Qinglong Schreck, Tobias Cai, Yi South China University of Technology School of Software Engineering China South China University of Technology Ministry of Education Key Laboratory of Big Data and Intelligent Robot China Tongji University Key Laboratory of Road and Traffic Engineering of the Ministry of Education China National University of Singapore Department of Civil and Environmental Engineering Singapore Graz University of Technology Austria

The design of urban road networks significantly influences traffic conditions, underscoring the importance of informed traffic planning. Traffic planning experts rely on specialized platforms to simulate traffic systems, assessing the efficacy of the road network across various states of modifications. Nevertheless, a prevailing issue persists: many existing traffic planning platforms exhibit inefficiencies in flexibly interacting with the road network's structure and attributes and intuitively comparing multiple states during the iterative planning process. This paper introduces TraSculptor, an interactive planning decision-making system. To develop TraSculptor, we identify and address two challenges: interactive modification of road networks and intuitive comparison of multiple network states. For the first challenge, we establish flexible interactions to enable experts to easily and directly modify the road network on the map. For the second challenge, we design a comparison view with a history tree of multiple states and a road-state matrix to facilitate intuitive comparison of road network states. To evaluate TraSculptor, we provided a usage scenario where the Braess's paradox was showcased, invited experts to perform a case study on the Sioux Falls network, and collected expert feedback through interviews. © 1995-2012 IEEE.

关键词： Visual analytics

来源：评论

学校读者我要写书评

暂无评论

Dual-Aspect Noise-Based Regularization for Multi-Modal Relation Extraction in Media Posts

IEEE Transactions on Audio, Speech and Language Processing

引用

IEEE Transactions on Audio, Speech and Language Processing 2025年 33卷 1324-1336页

作者： Kai Sun Bin Shi Samuel Mensah Wenjian Liu Bo Dong School of Computer Science and Technology and Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Xi'an China School of Computer Science and Technology The University of Sheffield Sheffield U.K. Faculty of Data Science City University of Macau Macau China School of Continuing Education and Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Xi'an China

Multi-Modal Relation Extraction (MMRE) plays a key role in various multimedia applications including, recommendation and information retrieval systems. MMRE aims to extract the semantic relation between entities by leveraging context from a text-image pair. By utilizing context from images, the challenge of learning from noisy images in MMRE emerges as a research problem by itself. For instance, subtle variations in similar images can act as noise and potentially impact the predictions made by MMRE models. To tackle this problem, current work utilizes attention mechanisms to fuse relevant text and image features or devise data augmentation techniques (e.g., via generative models) to improve generalization. However, the current performance still remains unsatisfactory. In an effort to improve upon the performance, we propose a Dual-Aspect Noise-based Regularization framework that encompasses two techniques: 1) noise removal through an adaptive gating mechanism, 2) fighting noise with noise to improve feature stability in the learning process. We find that combining these techniques encourages the model to focus on more relevant image features for MMRE. We carry out extensive experiments and demonstrate that our proposed model is further enhanced by exploring data augmentation techniques. This additional improvement leads the model to achieve state-of-the-art performance on the widely-used Multi-modal Neural Relation Extraction (MNRE) dataset, and show its effectiveness and generalizability on the Multi-Modal Named Entity Recognition task.

关键词： Feature extraction Noise data mining Noise measurement Social networking (online) Adaptation models Transformers Training Predictive models data models

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：