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

Efficient Multi-Query Oriented Continuous Subgraph Matching 40

学校读者我要写书评

暂无评论

Efficient Multi-Query Oriented Continuous Subgraph Matching

40th IEEE International Conference on Data Engineering, ICDE 2024

作者： Ma, Ziyi Yang, Jianye Zhou, Xu Xiao, Guoqing Wang, Jianhua Yang, Liang Li, Kenli Lin, Xuemin School of Artificial Intelligence Hebei University of Technology China Wuzhou University Guangxi Key Laboratory of Machine Vision and Intelligent Control China Cyberspace Institute of Advanced Technology Guangzhou University China PengCheng Laboratory Department of New Networks China College of Computer Science and Electronic Engineering Hunan University China Shenzhen Research Institute Hunan University China Antai College of Economics and Management Shanghai Jiao Tong University China

ISBN: (纸本)9798350317152

Continuous subgraph matching (CSM) is a critical task for analyzing dynamic graphs and has a wide range of applications, such as merchant fraud detection, cyber-attack hunting, and rumor detection. Although many efficient CSM algorithms have been recently proposed, they are mainly designed to process a single query. However, in some application scenarios, multi-query oriented continuous subgraph matching (MQCSM) may be of more interest. To our knowledge, the two existing solutions to MQCSM are outdated due to unsatisfactory performance. In this paper, we propose MQ-Match, an efficient approach to MQCSM. First, we design a compact yet effective index structure CCG, which maintains the local matching result of vertices in the data graph using a directed graph. The directed edges in CCG can be utilized as an effective pruning rule for the subsequent incremental matching algorithm when expanding a partial match. Then, we develop a computation sharing incremental matching algorithm. In specific, a set of matching trees is constructed based on the depth-first search trees of the query graphs. By utilizing CCG, we conduct subgraph matching for the matching tree to collect the incremental matches for the query graphs, where the common structures of query graphs are matched only once. Extensive experiments show that MQ-Match can achieve 3.1x-7071.4x speedup over the competitors, and consumes much less memory under the majority of the experiment settings. © 2024 IEEE.

关键词： Directed graphs

Unsupervised Entity Alignment Based on Personalized Discriminative Rooted Tree

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Yang, Yaming Wang, Zhe Guan, Ziyu Zhao, Wei Huang, Xinyan He, Xiaofei State Key Laboratory of Integrated Services Networks School of Computer Science and Technology Xidian University Xi’an710071 China Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education School of Artificial Intelligence Xidian University Xi’an710071 China State Key Laboratory of CAD&CG Zhejiang University Hangzhou China

Entity Alignment (EA) is to link potential equivalent entities across different knowledge graphs (KGs). Most existing EA methods are supervised as they require the supervision of seed alignments, i.e., manually specified aligned entity pairs. Very recently, several EA studies have made some attempts to get rid of seed alignments. Despite achieving preliminary progress, they still suffer two limitations: (1) The entity embeddings produced by their GNN-like encoders lack personalization since some of the aggregation subpaths are shared between different entities. (2) They cannot fully alleviate the distribution distortion issue between candidate KGs due to the absence of the supervised signal. In this work, we propose a novel unsupervised entity alignment approach called UNEA to address the above two issues. First, we parametrically sample a tree neighborhood rooted at each entity, and accordingly develop a tree attention aggregation mechanism to extract a personalized embedding for each entity. Second, we introduce an auxiliary task of maximizing the mutual information between the input and the output of the KG encoder, to regularize the model and prevent the distribution distortion. Extensive experiments show that our UNEA achieves a new state-of-the-art for the unsupervised EA task, and can even outperform many existing supervised EA baselines. Copyright © 2025, The Authors. All rights reserved.

关键词： Knowledge graph

HCF-Net: Hierarchical Context Fusion Network for Infrared Small Object Detection

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Xu, Shibiao Zheng, ShuChen Xu, Wenhao Xu, Rongtao Wang, Changwei Zhang, Jiguang Teng, Xiaoqiang Li, Ao Guo, Li Artificial Intelligence Beijing University of Posts and Telecommunications China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology Shandong Academy of Sciences China State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Chinese Academy of Sciences China School of Artificial Intelligence University of Chinese Academy of Sciences China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science China School of Computer Science and Technology Harbin University of Science and Technology China

Infrared small object detection is an important computer vision task involving the recognition and localization of tiny objects in infrared images, which usually contain only a few pixels. However, it encounters difficulties due to the diminutive size of the objects and the generally complex backgrounds in infrared images. In this paper, we propose a deep learning method, HCF-Net, that significantly improves infrared small object detection performance through multiple practical modules. Specifically, it includes the parallelized patch-aware attention (PPA) module, dimension-aware selective integration (DASI) module, and multi-dilated channel refiner (MDCR) module. The PPA module uses a multi-branch feature extraction strategy to capture feature information at different scales and levels. The DASI module enables adaptive channel selection and fusion. The MDCR module captures spatial features of different receptive field ranges through multiple depth-separable convolutional layers. Extensive experimental results on the SIRST infrared single-frame image dataset show that the proposed HCF-Net performs well, surpassing other traditional and deep learning models. Code is available at https://***/zhengshuchen/HCFNet. Copyright © 2024, The Authors. All rights reserved.

关键词： Deep learning

Aligning Multiple Knowledge Graphs in a Single Pass

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Yang, Yaming Wang, Zhe Guan, Ziyu Zhao, Wei Lu, Weigang Huang, Xinyan Cui, Jiangtao He, Xiaofei State Key Laboratory of Integrated Services Networks School of Computer Science and Technology Xidian University Xi’an China Key Laboratory of Intelligent Perception and Image UnDerstanding The Ministry of Education The School of Artificial Intelligence Xidian University Xi’an China State Key Laboratory of CAD&CG Zhejiang University Hangzhou China

Entity alignment (EA) is to identify equivalent entities across different knowledge graphs (KGs), which can help fuse these KGs into a more comprehensive one. Previous EA methods mainly focus on aligning a pair of KGs, and to the best of our knowledge, no existing EA method considers aligning multiple (more than two) KGs. To fill this research gap, in this work, we study a novel problem of aligning multiple KGs and propose an effective framework named MultiEA to solve the problem. First, we embed the entities of all the candidate KGs into a common feature space by a shared KG encoder. Then, we explore three alignment strategies to minimize the distances among pre-aligned entities. In particular, we propose an innovative inference enhancement technique to improve the alignment performance by incorporating high-order similarities. Finally, to verify the effectiveness of MultiEA, we construct two new real-world benchmark datasets and conduct extensive experiments on them. The results show that our MultiEA can effectively and efficiently align multiple KGs in a single pass. We release the source codes of MultiEA at: https://***/kepsail/MultiEA. Copyright © 2024, The Authors. All rights reserved.

关键词： Knowledge graph

Step-by-Step: Controlling Arbitrary Style in Text with Large Language Models 30

学校读者我要写书评

暂无评论

Step-by-Step: Controlling Arbitrary Style in Text with Large...

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Liu, Pusheng Wu, Lianwei Wang, Linyong Guo, Sensen Liu, Yang National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology School of Computer Science Northwestern Polytechnical University China Research & Development Institute of Northwestern Polytechnical University Shenzhen China Chongqing Science & Technology Innovation Center of Northwestern Polytechnical University China State Key Laboratory of Integrated Service Networks Xidian University China School of Artificial Intelligence Optics and Electronics Northwestern Polytechnical University China

ISBN: (纸本)9782493814104

Recently, the autoregressive framework based on large language models (LLMs) has achieved excellent performance in controlling the generated text to adhere to the required style. These methods guide LLMs through prompt learning to generate target text in an autoregressive manner. However, this manner possesses lower controllability and suffers from the challenge of accumulating errors, where early prediction inaccuracies might influence subsequent word generation. Furthermore, existing prompt-based methods overlook specific region editing, resulting in a deficiency of localized control over input text. To overcome these challenges, we propose a novel three-stage prompt-based approach for specific region editing. To alleviate the issue of accumulating errors, we transform the text style transfer task into a text infilling task, guiding the LLMs to modify only a small portion of text within the editing region to achieve style transfer, thus reducing the number of autoregressive iterations. To achieve an effective specific editing region, we adopt both prompt-based and word frequency-based strategies for region selection, subsequently employing a discriminator to validate the efficacy of the selected region. Experiments conducted on several publicly competitive datasets for text style transfer task confirm that our proposed approach achieves state-of-the-art performance. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Computational linguistics

Multi-Channel Hypergraph Convolution Group Recommendation with Member Information Enhancement 25

学校读者我要写书评

暂无评论

Multi-Channel Hypergraph Convolution Group Recommendation wi...

25th IEEE International Conferences on High Performance Computing and Communications, 9th International Conference on Data Science and Systems, 21st IEEE International Conference on Smart City and 9th IEEE International Conference on Dependability in Sensor, Cloud and Big Data Systems and Applications, HPCC/DSS/SmartCity/DependSys 2023

作者： Chen, Tianhao Gao, Qian Fan, Jun Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Shandong Jinan250014 China Qilu University of Technology Shandong Academy of Sciences Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Shandong Jinan250353 China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Shandong Jinan250014 China China Telecom Digital Intelligence Techonology Co Ltd Shandong Jinan250101 China

ISBN: (纸本)9798350330014

Group recommendation involves comprehensively considering various aspects, including members and items, to predict the overall interests of a group and recommend suitable items through a recommendation system. With the rapid evolution of the Internet, online group activities have become increasingly prevalent, making group recommendation a highly discussed topic within the realm of recommendation systems. However, current research in group recommendation still confronts the following challenges. Firstly, a predominant portion of group recommendation research focuses solely on aggregating group-level information, neglecting the valuable contribution of higher-order member-level insights to group recommendation. Moreover, some aggregation strategies overly prioritize fairness, thereby disregarding common real-world patterns. Secondly, previous studies have primarily relied on aggregating individual member interests to establish group preferences, lacking a holistic consideration of group dynamics. To tackle these challenges, this study introduces an innovative approach by implementing multi-channel hypergraph convolution within the member perspective. This approach aims to effectively extract higher-order insights from members by utilizing a member information enhancement module. By establishing group interconnections based on similarity and employing an adaptive fusion network to amalgamate multiple viewpoints, a final representation is derived. Experimental results demonstrate that our proposed model surpasses baseline models by 3% to 4% in terms of hit rate and accuracy, validating the efficacy of our approach. © 2023 IEEE.

关键词： Recommender systems

Social-enhanced recommendation using graph-based contrastive learning 25

学校读者我要写书评

暂无评论

Social-enhanced recommendation using graph-based contrastive...

作者： Xue, Peng Gao, Qian Fan, Jun Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Shandong Jinan250014 China Qilu University of Technology Shandong Academy of Sciences Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Shandong Jinan250353 China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Shandong Jinan250014 China China Telecom Digital Intelligence Techonology Co Ltd Shandong Jinan250101 China

ISBN: (纸本)9798350330014

The social network-based recommendation model use social network information to mitigate data sparsity issues and improve the accuracy of recommendation models. However, In most social network-based recommendation algorithms, the social neighbors' contributions are difficult to distinguish from the central user's, neglecting hidden correlations in social infor-mation. In order to solve this problem, this paper presents a graph-based contrastive learning framework for social-enhanced recommendation (SoGCLR) that utilizes implicit social information captured by a new social relation attention mechanism, en-rich user representations, and improve model robustness through graph-based contrastive learning. Specifically, the paper captures the degree of contribution of each neighbor in the social graph to the central user through a social relation attention layer, thus obtaining hidden correlations in social information, and further integrates this with user information in the user-item interaction graph to enrich user representations. In addition, the paper incorporates graph-based contrastive learning into the recommendation task using cross-layer contrastive learning, calculating contrastive loss and mapping nodes with similar but different exposure rates to nearby regions to mitigate exposure bias issues. Results from Ciao and Epinions demonstrate that SoGCLR reduces RMSE and MAE by 1.33% to 1.84% compared with baseline models. © 2023 IEEE.

关键词： Recommender systems

HCF-Net: Hierarchical Context Fusion Network for Infrared Small Object Detection

学校读者我要写书评

暂无评论

HCF-Net: Hierarchical Context Fusion Network for Infrared Sm...

IEEE International Conference on Multimedia and Expo (ICME)

作者： Shibiao Xu Shuchen Zheng Wenhao Xu Rongtao Xu Changwei Wang Jiguang Zhang Xiaoqiang Teng Ao Li Li Guo School of Artificial Intelligence Beijing University of Posts and Telecommunications CASIA MAIS School of Artificial Intelligence University of Chinese Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science School of Computer Science and Technology Harbin University of Science and Technology

ISBN: (数字)9798350390155

ISBN: (纸本)9798350390162

关键词： Deep learning Location awareness Convolutional codes computer vision Adaptation models Image recognition Object detection

CHECKWHY: Causal Fact Verification via Argument Structure

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Si, Jiasheng Zhao, Yibo Zhu, Yingjie Zhu, Haiyang Lu, Wenpeng Zhou, Deyu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology Shandong Academy of Sciences China School of Computer Science and Engineering Southeast University China Key Laboratory of New Generation Artificial Intelligence Technology and Its Interdisciplinary Applications Southeast University Ministry of Education China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science China

With the growing complexity of fact verification tasks, the concern with "thoughtful" reasoning capabilities is increasing. However, recent fact verification benchmarks mainly focus on checking a narrow scope of semantic factoids within claims and lack an explicit logical reasoning process. In this paper, we introduce CHECKWHY, a challenging dataset tailored to a novel causal fact verification task: checking the truthfulness of the causal relation within claims through rigorous reasoning steps. CHECKWHY consists of over 19K "why" claim-evidence-argument structure triplets with supports, refutes, and not enough info labels. Each argument structure is composed of connected evidence, representing the reasoning process that begins with foundational evidence and progresses toward claim establishment. Through extensive experiments on state-of-the-art models, we validate the importance of incorporating the argument structure for causal fact verification. Moreover, the automated and human evaluation of argument structure generation reveals the difficulty in producing satisfying argument structure by fine-tuned models or Chain-of-Thought prompted LLMs, leaving considerable room for future improvements1 Copyright © 2024, The Authors. All rights reserved.

关键词： Benchmarking