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

LECF: recommendation via learnable edge collaborative filtering

Science China(Information Sciences) 2022年第1期65卷 116-130页

作者： Shitao XIAO Yingxia SHAO Yawen LI Hongzhi YIN Yanyan SHEN Bin CUI School of Computer Science (National Pilot Software Engineering School) Beijing University of Posts and Telecommunications Beijing Key Lab of Intelligent Telecommunications Software and Multimedia Beijing University of Posts and Telecommunications School of Information Technology and Electrical Engineering The University of Queensland Department of Computer Science and Engineering Shanghai Jiao Tong University Department of Computer Science and Technology Peking University National Engineering Laboratory for Big Data Analysis and Applications Peking University

The core of recommendation models is estimating the probability that a user will like an item based on historical interactions. Existing collaborative filtering(CF) algorithms compute the likelihood by utilizing simple relationships between objects, e.g., user-item, item-item, or user-user. They always rely on a single type of object-object relationship, ignoring other useful relationship information in data. In this paper, we model an interaction between user and item as an edge and propose a novel CF framework, called learnable edge collaborative filtering(LECF). LECF predicts the existence probability of an edge based on the connections among edges and is able to capture the complex relationship in data. Specifically, we first adopt the concept of line graph where each node represents an interaction edge; then calculate a weighted sum of similarity between the query edge and the observed edges(i.e., historical interactions) that are selected from the neighborhood of query edge in the line graph for a recommendation. In addition, we design an efficient propagation algorithm to speed up the training and inference of LECF. Extensive experiments on four public datasets demonstrate LECF can achieve better performance than the state-of-the-art methods.

关键词： collaborative filtering recommender system implicit feedback edge-edge similarity line graph

来源：评论

学校读者我要写书评

暂无评论

AVR: Attention based Salient Visual Relationship Detection 14

AVR: Attention based Salient Visual Relationship Detection

引用

14th International Conference on Digital Image Processing, ICDIP 2022

作者： Li, Hualiang Lv, Jianming Xiao, Qinzhe Liu, Yuzhong Wu, Siqi Huang, Xingjie Key Laboratory of Occupational Health and Safety of Guangdong Power Grid Co. Ltd. Electric Power Research Institute of Guangdong Power Grid Co. Ltd. Guangdong Guangzhou China Key Laboratory of Big Data and Intelligent Robot South China University of Technology Ministry of Education Guangdong Guangzhou China School of Computer Science and Engineering South China University of Technology Guangdong Guangzhou China

ISBN: (纸本)9781510657564

Visual relationship detection aims to locate objects in images and recognize the relationships between objects. Traditional methods treat all observed relationships in an image equally, which causes a relatively poor performance in the detection tasks on complex images with abundant visual objects and various relationships. To address this problem, we propose an attention based model, namely AVR, to achieve salient visual relationships based on both local and global context of the relationships. Specifically, AVR recognizes relationships and measures the attention on the relationships in the local context of an input image by fusing the visual features, semantic and spatial information of the relationships. AVR then applies the attention to assign important relationships with larger salient weights for effective information filtering. Furthermore, AVR is integrated with the priori knowledge in the global context of image datasets to improve the precision of relationship prediction, where the context is modeled as a heterogeneous graph to measure the priori probability of relationships based on the random walk algorithm. Comprehensive experiments are conducted to demonstrate the effectiveness of AVR in several real-world image datasets, and the results show that AVR outperforms state-of-the-art visual relationship detection methods significantly by up to 87.5% in terms of recall. © 2022 SPIE.

关键词： Information filtering

来源：评论

学校读者我要写书评

暂无评论

Decoupled Prototype Learning for Reliable Test-Time Adaptation

arXiv

引用

arXiv 2024年

作者： Wang, Guowei Ding, Changxing Tan, Wentao Tan, Mingkui the School of Electronic and Information Engineering South China University of Technology 381 Wushan Road Tianhe District Guangzhou510000 China the Pazhou Lab Guangzhou510330 China the School of Future Technology South China University of Technology 381 Wushan Road Tianhe District Guangzhou510000 China the School of Software Engineering the Key Laboratory of Big Data and Intelligent Robot Ministry of Education South China University of Technology Guangzhou510006 China

Test-time adaptation (TTA) is a task that continually adapts a pre-trained source model to the target domain during inference. One popular approach involves fine-tuning model with cross-entropy loss according to estimated pseudo-labels. However, its performance is significantly affected by noisy pseudo-labels. This study reveals that minimizing the classification error of each sample causes the cross-entropy loss’s vulnerability to label noise. To address this issue, we propose a novel Decoupled Prototype Learning (DPL) method that features prototype-centric loss computation. First, we decouple the optimization of class prototypes. For each class prototype, we reduce its distance with positive samples and enlarge its distance with negative samples in a contrastive manner. This strategy prevents the model from overfitting to noisy pseudo-labels. Second, we propose a memory-based strategy to enhance DPL’s robustness for the small batch sizes often encountered in TTA. We update each class’s pseudo-feature from a memory in a momentum manner and insert an additional DPL loss. Finally, we introduce a consistency regularization-based approach to leverage samples with unconfident pseudo-labels. This approach transfers feature styles of samples with unconfident pseudo-labels to those with confident pseudo-labels. Thus, more reliable samples for TTA are created. The experimental results demonstrate that our methods achieve state-of-the-art performance on domain generalization benchmarks, and reliably improve the performance of self-training-based methods on image corruption benchmarks. The code will be released. Copyright © 2024, The Authors. All rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

NSPG-Miner: Mining Repetitive Negative Sequential Patterns

arXiv

引用

arXiv 2025年

作者： Li, Yan Wang, Zhulin Liu, Jing Guo, Lei Fournier-Viger, Philippe Wu, Youxi Wu, Xindong School of Economics and Management Hebei University of Technology Tianjin300401 China School of Artificial Intelligence Hebei University of Technology Tianjin300401 China State Key Laboratory of Reliability and Intelligence of Electrical Equipment Hebei University of Technology Tianjin300401 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518061 China Hebei Key Laboratory of Big Data Computing 300401 China Key Laboratory of Knowledge Engineering with Big Data The Ministry of Education of China Hefei University of Technology Hefei230009 China

Sequential pattern mining (SPM) with gap constraints (or repetitive SPM or tandem repeat discovery in bioinformatics) can find frequent repetitive subsequences satisfying gap constraints, which are called positive sequential patterns with gap constraints (PSPGs). However, classical SPM with gap constraints cannot find the frequent missing items in the PSPGs. To tackle this issue, this paper explores negative sequential patterns with gap constraints (NSPGs). We propose an efficient NSPG-Miner algorithm that can mine both frequent PSPGs and NSPGs simultaneously. To effectively reduce candidate patterns, we propose a pattern join strategy with negative patterns which can generate both positive and negative candidate patterns at the same time. To calculate the support (frequency of occurrence) of a pattern in each sequence, we explore a NegPair algorithm that employs a key-value pair array structure to deal with the gap constraints and the negative items simultaneously and can avoid redundant rescanning of the original sequence, thus improving the efficiency of the algorithm. To report the performance of NSPG-Miner, 11 competitive algorithms and 11 datasets are employed. The experimental results not only validate the effectiveness of the strategies adopted by NSPG-Miner, but also verify that NSPG-Miner can discover more valuable information than the state-ofthe-art algorithms. Algorithms and datasets can be downloaded from https://***/wuc567/PatternMining/tree/master/NSPG-Miner. Copyright © 2025, The Authors. All rights reserved.

关键词： Miners

来源：评论

学校读者我要写书评

暂无评论

Joint Multi-grained Popularity-aware Graph Convolution Collaborative Filtering for Recommendation

arXiv

引用

arXiv 2022年

作者： Liu, Kang Xue, Feng He, Xiangnan Guo, Dan Hong, Richang The School of Computer Science and Information Engineering Key Laboratory of Knowledge Engineering with Big Data Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Anhui Hefei China The School of Software Key Laboratory of Knowledge Engineering with Big Data Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Anhui Hefei China The University of Science and Technology of China Anhui Hefei China

Graph Convolution Networks (GCNs), with their efficient ability to capture high-order connectivity in graphs, have been widely applied in recommender systems. Stacking multiple neighbor aggregation is the major operation in GCNs. It implicitly captures popularity features because the number of neighbor nodes reflects the popularity of a node. However, existing GCN-based methods ignore a universal problem: users’ sensitivity to item popularity is differentiated, but the neighbor aggregations in GCNs actually fix this sensitivity through Graph Laplacian Normalization, leading to suboptimal personalization. In this work, we propose to model multi-grained popularity features and jointly learn them together with high-order connectivity, to match the differentiation of user preferences exhibited in popularity features. Specifically, we develop a Joint Multi-grained Popularity-aware Graph Convolution Collaborative Filtering model, short for JMP-GCF, which uses a popularity-aware embedding generation to construct multi-grained popularity features, and uses the idea of joint learning to capture the signals within and between different granularities of popularity features that are relevant for modeling user preferences. Additionally, we propose a multistage stacked training strategy to speed up model convergence. We conduct extensive experiments on three public datasets to show the state-of-the-art performance of JMP-GCF. Copyright © 2022, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Segment Routing based In-Band Network Telemetry in IPv6 over Optical Networks

Segment Routing based In-Band Network Telemetry in IPv6 over...

引用

Mobile Internet, Cloud Computing and Information Security (MICCIS), International Conference on

作者： Wei Liu Xu Zhang Chuan Feng Xiaoxue Gong School of Communications and Information Engineering Chongqing University of Posts and Telecommunications Chongqing China Institute of Intelligent Communication and Network Security Chongqing University of Posts and Telecommunications Chongqing China Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunications Chongqing China

ISBN: (数字)9798350389906

ISBN: (纸本)9798350389913

With the rise of automated network operations, network telemetry has become increasingly important. Optical networks play a key role in modern communication systems because of their high bandwidth, low latency, and low loss. To better manage and monitor Internet Protocol version 6 (IPv6) over optical networks, programmable data planes (PDP) are used to achieve flexible data collection. Meanwhile, to solve the scalability problem of the control plane in the software-defined network (SDN), segment routing over IPv6 (SRv6) is introduced. By programming the source node on the path, SRv6 wisely instructs packets to collect the appropriate telemetry data at the segment nodes to balance the trade-off between bandwidth usage and monitoring coverage. To efficiently achieve the observability of IPv6 over optical networks, we model the system and propose an SRv6-based in-band network telemetry (INT) algorithm. Simulation results verify the performance of our algorithm.

关键词： Protocols Simulation Bandwidth Optical fiber networks Routing Universal Serial Bus Topology

来源：评论

学校读者我要写书评

暂无评论

CEGRL-TKGR: A Causal Enhanced Graph Representation Learning Framework for Temporal Knowledge Graph Reasoning

arXiv

引用

arXiv 2024年

作者： Sun, Jinze Sheng, Yongpan He, Lirong Qin, Yongbin Liu, Ming Jia, Tao College of Computer and Information Science Southwest University Chongqing400715 China School of Big Data & Software Engineering Chongqing University Chongqing401331 China School of Information Science and Engineering Chongqing Jiaotong University Chongqing400074 China College of Computer Science and Technology The State Key Laboratory of Public Big Data Guizhou University China Deakin University VIC3125 Australia

Temporal knowledge graph reasoning (TKGR) is increasingly gaining attention for its ability to extrapolate new events from historical data, thereby enriching the inherently incomplete temporal knowledge graphs. Existing graph-based representation learning frameworks have made significant strides in developing evolving representations for both entities and relational embeddings. Despite these achievements, there’s a notable tendency in these models to inadvertently learn biased data representations and mine spurious correlations, consequently failing to discern the causal relationships between events. This often leads to incorrect predictions based on these false correlations. To address this, we propose an innovative Causal Enhanced Graph Representation Learning framework for TKGR (named CEGRL-TKGR). This framework introduces causal structures in graph-based representation learning to unveil the essential causal relationships between events, ultimately enhancing the performance of the TKGR task. Specifically, we first disentangle the evolutionary representations of entities and relations in a temporal knowledge graph sequence into two distinct components, namely causal representations and confounding representations. Then, drawing on causal intervention theory, we advocate the utilization of causal representations for predictions, aiming to mitigate the effects of erroneous correlations caused by confounding features, thus achieving more robust and accurate predictions. Finally, extensive experimental results on six benchmark datasets demonstrate the superior performance of our model in the link prediction task. © 2024, CC BY.

关键词： Spatio-temporal data

来源：评论

学校读者我要写书评

暂无评论

Keeping Pace with Ever-Increasing data: Towards Continual Learning of Code Intelligence Models

Keeping Pace with Ever-Increasing Data: Towards Continual Le...

引用

International Conference on software engineering (ICSE)

作者： Shuzheng Gao Hongyu Zhang Cuiyun Gao Chaozheng Wang School of Computer Science and Technology Harbin Institute of Technology Shenzhen China Peng Cheng Laboratory and Guangdong Provincial Key Laboratory of Novel Security Intelligence Technologies School of Big Data and Software Engineering Chongqing University China

Previous research on code intelligence usually trains a deep learning model on a fixed dataset in an offline manner. However, in real-world scenarios, new code repositories emerge incessantly, and the carried new knowledge is beneficial for providing up-to-date code intelligence services to developers. In this paper, we aim at the following problem: How to enable code intelligence models to continually learn from ever-increasing data? One major challenge here is catastrophic forgetting, meaning that the model can easily forget knowledge learned from previous datasets when learning from the new dataset. To tackle this challenge, we propose REPEAT, a novel method for continual learning of code intelligence models. Specifically, REPEAT addresses the catastrophic forgetting problem with representative exemplars replay and adaptive parameter regularization. The representative exemplars replay component selects informative and diverse exemplars in each dataset and uses them to re-train model periodically. The adaptive parameter regularization component recognizes important parameters in the model and adaptively penalizes their changes to preserve the knowledge learned before. We evaluate the proposed approach on three code intelligence tasks including code summarization, software vulnerability detection, and code clone detection. Extensive experiments demonstrate that REPEAT consistently outperforms baseline methods on all tasks. For example, REPEAT improves the conventional fine-tuning method by 1.22, 5.61, and 1.72 on code summarization, vulnerability detection and clone detection, respectively.

关键词：

来源：评论

学校读者我要写书评

暂无评论

OFFLINE MODEL-BASED OPTIMIZATION BY LEARNING TO RANK

arXiv

引用

arXiv 2024年

作者： Tan, Rong-Xi Xue, Ke Lyu, Shen-Huan Shang, Haopu Wang, Yao Wang, Yaoyuan Fu, Sheng Qian, Chao National Key Laboratory for Novel Software Technology Nanjing University China School of Artificial Intelligence Nanjing University China Key Laboratory of Water Big Data Technology of Ministry of Water Resources Hohai University China College of Computer Science and Software Engineering Hohai University China Huawei Technologies Ltd. China

Offline model-based optimization (MBO) aims to identify a design that maximizes a black-box function using only a fixed, pre-collected dataset of designs and their corresponding scores. This problem has garnered significant attention from both scientific and industrial domains. A common approach in offline MBO is to train a regression-based surrogate model by minimizing mean squared error (MSE) and then find the best design within this surrogate model by different optimizers (e.g., gradient ascent). However, a critical challenge is the risk of out-of-distribution errors, i.e., the surrogate model may typically overestimate the scores and mislead the optimizers into suboptimal regions. Prior works have attempted to address this issue in various ways, such as using regularization techniques and ensemble learning to enhance the robustness of the model, but it still remains. In this paper, we argue that regression models trained with MSE are not well-aligned with the primary goal of offline MBO, which is to select promising designs rather than to predict their scores precisely. Notably, if a surrogate model can maintain the order of candidate designs based on their relative score relationships, it can produce the best designs even without precise predictions. To validate it, we conduct experiments to compare the relationship between the quality of the final designs and MSE, finding that the correlation is really very weak. In contrast, a metric that measures order-maintaining quality shows a significantly stronger correlation. Based on this observation, we propose learning a ranking-based model that leverages learning to rank techniques to prioritize promising designs based on their relative scores. We show that the generalization error on ranking loss can be well bounded. Empirical results across diverse tasks demonstrate the superior performance of our proposed ranking-based models than twenty existing methods. Copyright © 2024, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Multi-Quadrotor Cooperative Encirclement and Capture Approach in Obstacle Environments

Multi-Quadrotor Cooperative Encirclement and Capture Approac...

引用

International Conference on Mechatronics (ICM)

作者： Zhenyu Li Ruixin Wu Jin Wang Chuanqi Hu Zhi Zheng Jun Meng Guodong Lu School of Mechanical Engineering Zhejiang University Hangzhou China State Key Laboratory of Fluid Power and Mechatronic Systems Zhejiang University Hangzhou China Zhejiang Key Laboratory of Industrial Big Data and Robot Intelligent Systems Zhejiang University Hangzhou China Robotics Research Center of Yuyao City Ningbo China Polytechnic Institute Zhejiang University Hangzhou China College of Electrical Engineering Zhejiang University Hangzhou China Center for Data Mining and Systems Biology College of Electrical Engineering Zhejiang University Hangzhou China

ISBN: (数字)9798331533892

ISBN: (纸本)9798331533908

This article proposes an algorithm designed for autonomous quadrotors to capture target quadrotors in complex obstacle environments, enabling multiple pursuers to perform distributed capture while simultaneously avoiding obstacles and collisions. We first introduce a 3D obstacle space representation method based on safety-priority reachable region (SPRR) and implement real-time construction for general point cloud maps. Subsequently, leveraging SPRR, we employ an area minimization approach to ensure the effective capture of the evader within a limited time. The outcomes are then integrated into a MINCO-based trajectory planning framework to ensure their practical execution by real quadrotors. Relying on SPRR, the optimization problem is simplified and the solution efficiency is improved. In the scenario of simulating the dynamics of real quadrotors, we compare the proposed algorithm with state-of-the-art evasion and pursuit methods, validating its effectiveness and advancements. This work presents a practical solution for multi-quadrotor collaborative capture.

关键词： Point cloud compression Visualization Three-dimensional displays Trajectory planning Heuristic algorithms Collaboration Real-time systems Safety Optimization Quadrotors

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：