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

arXiv 2024年

作者： Li, Hourun Wang, Yifan Xiao, Zhiping Yang, Jia Zhou, Changling Zhang, Ming Ju, Wei State Key Laboratory for Multimedia Information Processing School of Computer Science PKU-Anker LLM Lab Peking University Beijing China Computer Center Peking University Beijing China School of Information Technology & Management University of International Business and Economics Beijing China Paul G. Allen School of Computer Science and Engineering University of Washington SeattleWA United States College of Computer Science Sichuan University Chengdu China

Recommender systems are widely used in various real-world applications, but they often encounter the persistent challenge of the user cold-start problem. Cross-domain recommendation (CDR), which leverages user interactions from one domain to improve prediction performance in another, has emerged as a promising solution. However, users with similar preferences in the source domain may exhibit different interests in the target domain. Therefore, directly transferring embeddings may introduce irrelevant source-domain collaborative information. In this paper, we propose a novel graph-based disentangled contrastive learning framework to capture fine-grained user intent and filter out irrelevant collaborative information, thereby avoiding negative transfer. Specifically, for each domain, we use a multi-channel graph encoder to capture diverse user intents. We then construct the affinity graph in the embedding space and perform multi-step random walks to capture high-order user similarity relationships. Treating one domain as the target, we propose a disentangled intent-wise contrastive learning approach, guided by user similarity, to refine the bridging of user intents across domains. Extensive experiments on four benchmark CDR datasets demonstrate that DisCo consistently outperforms existing state-of-the-art baselines, thereby validating the effectiveness of both DisCo and its components. Copyright © 2024, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

GUARD: Multigranularity-based Unsupervised Anomaly Detection Algorithm for Multivariate Time Series 8

GUARD: Multigranularity-based Unsupervised Anomaly Detection...

引用

8th IEEE International Conference on Cloud Computing and Intelligence Systems, CCIS 2022

作者： Meng, Fan Yang, Qunli He, Zhengda Yang, Shangdong Tang, Weidong Public Credit Information Center Jiangsu Strategy and Development Research Center Nanjing China Nanjing University State Key Lab for Novel Software Technology Nanjing China China Pharmaceutical University School of Science Nanjing China The School of Computer Science Nanjing University of Posts and Teleconnnunications Nanjing China China Telecom Corporation Limited Nanjing Branch Customer Operations Department Nanjing China

ISBN: (纸本)9781665477352

Unsupervised anomaly detection on multivariate time series (MTS) is a valuable problem in practice because it significantly reduces labeling costs. Even though most classical methods begin to consider inter-series dependencies, the hierarchical relationships between and within-series data are often ignored. To overcome these limitations, in this paper, we propose a multiGranUlArity based unsupeRvised anomaly Detection (GUARD) algorithm that captures the hierarchical relationships in three granularities and merges these dependencies in the following anomaly detection task. Specifically, the proposed algorithm first captures the internal dependencies within the subsequence and learns a hidden representation based on a trained autoencoder. Then, a hierarchical mechanism is designed to capture the local and global dependencies between the given subsequence and the whole set and learn their hidden representation. The experimental results show that the proposed algorithm can effectively and stably exploit the potential relationship of MTS and detect anomalies more accurately than the basic approaches. © 2022 IEEE.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Mining Repetitive Negative Sequential Patterns with Gap Constraints

引用

ACM Transactions on Knowledge Discovery from Data 2025年第4期19卷

作者： Li, Yan Wang, Zhulin Liu, Jing Guo, Lei Fournier-Viger, Philippe Wu, Youxi Wu, Xindong School of Economics and Management Hebei University of Technology Tianjin China School of Artificial Intelligence Hebei University of Technology Tianjin China State Key Laboratory of Reliability and Intelligence of Electrical Equipment Hebei University of Technology Tianjin China College of Computer Science and Software Engineering Shenzhen University Shenzhen China Hebei Key Laboratory of Big Data Computing Tianjin China Hefei University of Technology Hefei 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 article 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-of-the-art algorithms. Copyright © 2025 held by the owner/author(s). Publication rights licensed to ACM.

关键词： sequential pattern mining gap constraint negative sequential pattern key-value pair

来源：评论

学校读者我要写书评

暂无评论

DeepDir: a deep learning approach for API directive detection

引用

Science China(Information Sciences) 2021年第9期64卷 238-240页

作者： Jingxuan ZHANG He JIANG Shuai LU Ge LI Xin CHEN College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics State Key Laboratory for Novel Software Technology Nanjing University Key Laboratory of Complex Systems Modeling and Simulation Ministry of Education School of Software Dalian University of Technology School of Electronic Engineering and Computer Science Peking University School of Computer Science and Technology Hangzhou Dianzi University

Dear editor,software developers tend to reuse existing libraries to facilitate their development process and implement certain functionalities by invoking application programming interfaces(APIs) [1]. However, it remains a challenging task for developers to correctly use APIs [2], so they often consult API learning resources [3, 4]. As one of the most important API learning resources,

关键词： Information Systems and Communication Service

来源：评论

学校读者我要写书评

暂无评论

STDEN: Towards Physics-Guided Neural Networks for Traffic Flow Prediction

arXiv

引用

arXiv 2022年

作者： Ji, Jiahao Wang, Jingyuan Jiang, Zhe Jiang, Jiawei Zhang, Hu State Key Laboratory of Software Development Environment School of Computer Science & Engineering Beihang University Beijing China Peng Cheng Laboratory Shenzhen China Department of Computer & Information Science & Engineering The University of Florida United States MOE Engineering Research Center of Advanced Computer Application Technology School of Computer Science & Engineering Beihang University Beijing China

High-performance traffic flow prediction model designing, a core technology of Intelligent Transportation System, is a long-standing but still challenging task for industrial and academic communities. The lack of integration between physical principles and data-driven models is an important reason for limiting the development of this field. In the literature, physics-based methods can usually provide a clear interpretation of the dynamic process of traffic flow systems but are with limited accuracy, while data-driven methods, especially deep learning with black-box structures, can achieve improved performance but can not be fully trusted due to lack of a reasonable physical basis. To bridge the gap between purely data-driven and physics-driven approaches, we propose a physics-guided deep learning model named Spatio- Temporal Differential Equation Network (STDEN), which casts the physical mechanism of traffic flow dynamics into a deep neural network framework. Specifically, we assume the traffic flow on road networks is driven by a latent potential energy field (like water flows are driven by the gravity field), and model the spatio-temporal dynamic process of the potential energy field as a differential equation network. STDEN absorbs both the performance advantage of data-driven models and the interpretability of physics-based models, so is named a physics-guided prediction model. Experiments on three real-world traffic datasets in Beijing show that our model outperforms state-of-the-art baselines by a significant margin. A case study further verifies that STDEN can capture the mechanism of urban traffic and generate accurate predictions with physical meaning. The proposed framework of differential equation network modeling may also cast light on other similar applications. Copyright © 2022, The Authors. All rights reserved.

关键词： Differential equations

来源：评论

学校读者我要写书评

暂无评论

Towards Fully Decoupled End-to-End Person Search

Towards Fully Decoupled End-to-End Person Search

引用

Proceedings of the Digital Image Computing: Technqiues and Applications (DICTA)

作者： Pengcheng Zhang Xiao Bai Jin Zheng Xin Ning School of Computer Science and Engineering State Key Laboratory of Software Development Environment Jiangxi Research Institute Beihang University Beijing China Institute of Semiconductors Chinese Academy of Sciences Cognitive Computing Technology Joint Laboratory Wave Group Beijing China

End-to-end person search aims to jointly detect and re-identify a target person in raw scene images with a unified model. The detection task unifies all persons while the re-id task discriminates different identities, resulting in conflict optimal objectives. Existing works proposed to decouple end-to-end person search to alleviate such conflict. Yet these methods are still sub-optimal on one or two of the sub-tasks due to their partially decoupled models, which limits the overall person search performance. In this paper, we propose to fully decouple person search towards optimal person search. A task-incremental person search network is proposed to incrementally construct an end-to-end model for the detection and re-id sub-task, which decouples the model architecture for the two sub-tasks. The proposed task-incremental network allows task-incremental training for the two conflicting tasks. This enables independent learning for different objectives thus fully decoupled the model for personsearch. Comprehensive experimental evaluations demonstrate the effectiveness of the proposed fully decoupled models for end-to-end person search.

关键词：

来源：评论

学校读者我要写书评

暂无评论

zsLLMCode: An Effective Approach for Code Embedding via LLM with Zero-Shot Learning

arXiv

引用

arXiv 2024年

作者： Xian, Zixiang Huang, Rubing Cui, Chenhui Fang, Chunrong Chen, Zhenyu School of Computer Science and Engineering Macau University of Science and Technology Macau Taipa999078 China Macau University of Science and Technology Zhuhai MUST Science and Technology Research Institute Guangdong Zhuhai519099 China State Key Laboratory for Novel Software Technology Nanjing University Nanjing210093 China

The advent of large language models (LLMs) has greatly advanced artificial intelligence (AI) in software engineering (SE), with code embeddings playing a critical role in tasks like code-clone detection and code clustering. However, existing methods for code embedding, including those based on LLMs, often depend on costly supervised training or fine-tuning for domain adaptation. This paper proposes a novel zero-shot approach, zsLLMCode, to generate code embeddings by using LLMs and sentence embedding models. This approach attempts to eliminate the need for task-specific training or fine-tuning, and to effectively address the issue of erroneous information commonly found in LLM-generated outputs. We conducted a series of experiments to evaluate the performance of the proposed approach by considering various LLMs and embedding models. The results have demonstrated the effectiveness and superiority of our method zsLLMCode over state-of-the-art unsupervised approaches such as SourcererCC, Code2vec, InferCode, and TransformCode. Our findings highlight the potential of zsLLMCode to advance the field of SE by providing robust and efficient solutions for code embedding tasks. © 2024, CC BY.

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

Abstract Syntax Tree for Programming Language Understanding and Representation: How Far Are We?

arXiv

引用

arXiv 2023年

作者： Sun, Weisong Fang, Chunrong Miao, Yun You, Yudu Yuan, Mengzhe Chen, Yuchen Zhang, Quanjun Guo, An Chen, Xiang Liu, Yang Chen, Zhenyu State Key Laboratory for Novel Software Technology Nanjing University Jiangsu Nanjing210093 China School of Computer Science and Engineering Nanyang Technological University 50 Nanyang Avenue Singapore639798 Singapore Nantong University Jiangsu Nantong226019 China

Programming language understanding and representation (a.k.a code representation learning) has always been a hot and challenging task in the field of software engineering. It aims to apply deep learning techniques to produce numerical representations of the source code features while preserving its semantics. These representations can be used for facilitating subsequent code-related tasks, e.g., code summarization. The abstract syntax tree (AST), a fundamental code feature, illustrates the syntactic information of the source code and has been widely used in code representation learning. It is commonly acknowledged that AST-based code representation is critical to solving code-related tasks. However, there is still a lack of systematic and quantitative evaluation of how well AST-based code representation facilitates subsequent code-related tasks. Additionally, learning an AST-based code representation is an extremely complex endeavor involving three intertwining stages, including, AST parsing, AST preprocessing, and AST encoding. The solutions available inMSC Codes 68-04, 68T30 Copyright © 2023, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

科学研究的第五范式——以智能驱动的材料设计为例

引用

engineering 2023年第5期24卷 126-137,I0003,I0004页

作者： Can Leng Zhuo Tang Yi-Ge Zhou Zean Tian Wei-Qing Huang Jie Liu Keqin Li Kenli Li Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense TechnologyChangsha 410073China Laboratory of Software Engineering for Complex Systems National University of Defense TechnologyChangsha 410073China National Supercomputing Center in Changsha Changsha 410082China College of Computer Science and Electronic Engineering Hunan UniversityChangsha 410082China Institute of Chemical Biology and Nanomedicine State Key Laboratory of Chemo/Biosensing and ChemometricsCollege of Chemistry and Chemical EngineeringHunan UniversityChangsha 410082China Department of Applied Physics School of Physics and ElectronicsHunan UniversityChangsha 410082China Department of Computer Science State University of New YorkNew PaltzNY 12561USA

科学正在进入一个新时代——第五范式——它被认为是知识整合到不同领域的主要特征,是基于无所不在的机器学习系统的计算社区中智能驱动的工作。在此,我们通过在天河一号超级计算机系统上构建的催化材料专门设计的典型平台案例,生动地... 详细信息

科学正在进入一个新时代——第五范式——它被认为是知识整合到不同领域的主要特征,是基于无所不在的机器学习系统的计算社区中智能驱动的工作。在此,我们通过在天河一号超级计算机系统上构建的催化材料专门设计的典型平台案例,生动地阐明了第五范式的本质,旨在促进第五范式在其他领域的培养。第五范式平台主要包括模型自动构建(原始数据提取)、指纹自动构建(神经网络特征选择)以及跨学科知识串联的重复迭代(“火山图”)。与分解一起进行的是对迭代中实现的体系结构的性能评估。通过讨论,第五范式的智能驱动平台可以极大地简化和改进研究中极其繁琐和具有挑战性的工作,并通过补偿机器学习中缺少样本和替代一些由于计算资源不足而导致的数值计算来实现数值计算与机器学习之间的相互反馈,从而加速探索过程。在数据驱动的学科中,跨学科专家的协同作用和对动态数据需求的急剧增长仍然是一个挑战。我们相信,对第五范式平台的一瞥可以为其在其他领域的应用铺平道路。

关键词：机器学习自动构建天河一号数据驱动神经网络动态数据知识整合科学研究

来源：评论

学校读者我要写书评

暂无评论

Towards Fully Decoupled End-to-End Person Search

arXiv

引用

arXiv 2023年

作者： Zhang, Pengcheng Zheng, Jin Bai, Xiao Ning, Xin School of Computer Science and Engineering State Key Laboratory of Software Development Environment Jiangxi Research Institute Beihang University Beijing China Institute of Semiconductors Chinese Academy of Sciences Cognitive Computing Technology Joint Laboratory Wave Group Beijing China

End-to-end person search aims to jointly detect and re-identify a target person in raw scene images with a unified model. The detection task unifies all persons while the re-id task discriminates different identities, resulting in conflict optimal objectives. Existing works proposed to decouple end-to-end person search to alleviate such conflict. Yet these methods are still sub-optimal on one or two of the sub-tasks due to their partially decoupled models, which limits the overall person search performance. In this paper, we propose to fully decouple person search towards optimal person search. A task-incremental person search network is proposed to incrementally construct an end-to-end model for the detection and re-id sub-task, which decouples the model architecture for the two sub-tasks. The proposed task-incremental network allows task-incremental training for the two conflicting tasks. This enables independent learning for different objectives thus fully decoupled the model for persons earch. Comprehensive experimental evaluations demonstrate the effectiveness of the proposed fully decoupled models for end-to-end person search. Copyright © 2023, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：