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

50th International Conference on Very Large data Bases, VLDB 2024

作者： Li, Xunkai Liao, Meihao Wu, Zhengyu Su, Daohan Zhang, Wentao Li, Rong-Hua Wang, Guoren Beijing Institute of Technology China Peking University National Engineering Laboratory for Big Data Analytics and Applications China

Most existing graph neural networks (GNNs) are limited to undirected graphs, whose restricted scope of the captured relational information hinders their expressive capabilities and deployment. Compared with undirected graphs, directed graphs (digraphs) fit the demand for modeling more complex topological systems by capturing more intricate relationships between nodes. While some directed GNNs have been introduced, their inspiration mainly comes from deep learning architectures, which lead to redundant complexity and computation, making them inapplicable to large-scale databases. To address these issues, we propose LightDiC, a scalable variant of the digraph convolution based on the magnetic Laplacian. Since topology-related computations are conducted solely during offline pre-processing, LightDiC achieves exceptional scalability, enabling downstream predictions to be trained separately without incurring recursive computational costs. Theoretical analysis shows that LightDiC achieves message passing based on the complex field, which corresponds to the proximal gradient descent process of the Dirichlet energy optimization function from the perspective of digraph signal denoising, ensuring its expressiveness. Experimental results demonstrate that LightDiC performs comparably well or even outperforms other SOTA methods in various downstream tasks, with fewer learnable parameters and higher efficiency. © 2024, VLDB Endowment. All rights reserved.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

Rethinking Node-wise Propagation for Large-scale Graph Learning 24

Rethinking Node-wise Propagation for Large-scale Graph Learn...

引用

33rd ACM Web Conference, WWW 2024

作者： Li, Xunkai Ma, Jingyuan Wu, Zhengyu Su, Daohan Zhang, Wentao Li, Rong-Hua Wang, Guoren Beijing Institute of Technology Beijing China Peking University National Engineering Laboratory for Big Data Analytics and Applications Beijing China

ISBN: (纸本)9798400701719

Scalable graph neural networks (GNNs) have emerged as a promising technique, which exhibits superior predictive performance and high running efficiency across numerous large-scale graph-based web applications. However, (i) Most scalable GNNs tend to treat all nodes with the same propagation rules, neglecting their topological uniqueness;(ii) Existing node-wise propagation optimization strategies are insufficient on web-scale graphs with intricate topology, where a full portrayal of nodes' local properties is required. Intuitively, different nodes in web-scale graphs possess distinct topological roles, and therefore propagating them indiscriminately or neglecting local contexts may compromise the quality of node representations. To address the above issues, we propose Adaptive Topology-aware Propagation (ATP), which reduces potential high-bias propagation and extracts structural patterns of each node in a scalable manner to improve running efficiency and predictive performance. Remarkably, ATP is crafted to be a plug-and-play node-wise propagation optimization strategy, allowing for offline execution independent of the graph learning process in a new perspective. Therefore, this approach can be seamlessly integrated into most scalable GNNs while remaining orthogonal to existing node-wise propagation optimization strategies. Extensive experiments on 12 datasets have demonstrated the effectiveness of ATP. © 2024 ACM.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

A Symbolic Rule Integration Framework with Logic Transformer for Inductive Relation Prediction 24

A Symbolic Rule Integration Framework with Logic Transformer...

引用

33rd ACM Web Conference, WWW 2024

作者： Pan, Yudai Liu, Jun Zhao, Tianzhe Zhang, Lingling Lin, Yun Dong, Jin Song School of Computer Science and Technology Xi'an Jiaotong University Shaanxi Xi'an China National Engineering Lab for Big Data Analytics Xi'an Jiaotong University Shaanxi Xi'an China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Shaanxi Xi'an China Shanghai Jiao Tong University Shanghai China National University of Singapore Singapore Singapore

ISBN: (纸本)9798400701719

Relation prediction in knowledge graphs (KGs) aims at predicting missing relations in incomplete triples, whereas the dominant paradigm by KG embeddings has a limitation to predict the relation between unseen entities. This situation is called an inductive setting, which is more common in the real-world scenario. To handle this issue, implicit symbolic rules have shown great potential in capturing the inductive capability. However, it is still challenging to obtain precise representations of logic rules from KGs. The argument variability and predicate non-commutativity in symbolic rule integration make the modeling of component symbols difficult. To this end, we propose a novel inductive relation prediction model named SymRITa with a logic transformer integrating rules. SymRITa firstly extracts the subgraph, whose embeddings are captured by a graph network. Meanwhile, symbolic rule graphs in the subgraph can be generated. Then, the symbolic rules are modeled by a proposed logic transformer. Specifically, the input format based on the subgraph-based embeddings is to focus on the argument variability in symbolic rules. In addition, a conjunction attention mechanism in the logic transformer can resolve predicate non-commutativity in the symbolic rule integration process. Finally, the subgraph-based and symbol-based embeddings obtained from the previous steps are combined for the training regime, and prediction results as well as rules explaining the reasoning process are explicitly output. Extensive experiments on twelve inductive datasets show that SymRITa achieves outstanding effectiveness compared to state-of-the-art inductive baselines. Moreover, the logic rules with corresponding confidences provide an interpretable paradigm. © 2024 ACM.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Inductive Relation Prediction with Logical Reasoning Using Contrastive Representations

Inductive Relation Prediction with Logical Reasoning Using C...

引用

2022 Conference on Empirical Methods in Natural Language Processing, EMNLP 2022

作者： Pan, Yudai Liu, Jun Zhang, Lingling Zhao, Tianzhe Lin, Qika Hu, Xin Wang, Qianying School of Computer Science and Technology Xi'an Jiaotong University China National Engineering Lab for Big Data Analytics China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering China Lenovo Research Beijing China

Relation prediction in knowledge graphs (KGs) aims at predicting missing relations in incomplete triples, whereas the dominant embedding paradigm has a restriction on handling unseen entities during testing. In the real-world scenario, the inductive setting is more common because entities in the training process are finite. Previous methods capture an inductive ability by implicit logic in KGs. However, it would be challenging to preciously acquire entity-independent relational semantics of compositional logic rules and to deal with the deficient supervision of logic caused by the scarcity of relational semantics. To this end, we propose a novel graph convolutional network (GCN)-based model LogCo with logical reasoning by contrastive representations. LogCo firstly extracts enclosing subgraphs and relational paths between two entities to supply the entity-independence. Then a contrastive strategy for relational path instances and the subgraph is proposed for the issue of deficient supervision. The contrastive representations are learned for a joint training regime. Finally, prediction results and logic rules for reasoning are attained. Comprehensive experiments on twelve inductive datasets show that LogCo achieves outstanding performance comparing with SOTA inductive baselines. © 2022 Association for Computational Linguistics.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Rethinking Node-wise Propagation for Large-scale Graph Learning

arXiv

引用

arXiv 2024年

作者： Li, Xunkai Su, Daohan Ma, Jingyuan Zhang, Wentao Wu, Zhengyu Li, Rong-Hua Wang, Guoren Beijing Institute of Technology Beijing China Peking University National Engineering Laboratory for Big Data Analytics and Applications Beijing China

Scalable graph neural networks (GNNs) have emerged as a promising technique, which exhibits superior predictive performance and high running efficiency across numerous large-scale graph-based web applications. However, (i) Most scalable GNNs tend to treat all nodes with the same propagation rules, neglecting their topological uniqueness;(ii) Existing node-wise propagation optimization strategies are insufficient on web-scale graphs with intricate topology, where a full portrayal of nodes’ local properties is required. Intuitively, different nodes in web-scale graphs possess distinct topological roles, and therefore propagating them indiscriminately or neglect local contexts may compromise the quality of node representations. To address the above issues, we propose Adaptive Topology-aware Propagation (ATP), which reduces potential high-bias propagation and extracts structural patterns of each node in a scalable manner to improve running efficiency and predictive performance. Remarkably, ATP is crafted to be a plug-and-play node-wise propagation optimization strategy, allowing for offline execution independent of the graph learning process in a new perspective. Therefore, this approach can be seamlessly integrated into most scalable GNNs while remain orthogonal to existing node-wise propagation optimization strategies. Extensive experiments on 12 datasets have demonstrated the effectiveness of ATP. Copyright © 2024, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

MatchPrompt: Prompt-based Open Relation Extraction with Semantic Consistency Guided Clustering

MatchPrompt: Prompt-based Open Relation Extraction with Sema...

引用

2022 Conference on Empirical Methods in Natural Language Processing, EMNLP 2022

作者： Wang, Jiaxin Zhang, Lingling Liu, Jun Liang, Xi Zhong, Yujie Wu, Yaqiang Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering School of Computer Science and Technology Xi'an Jiaotong University China National Engineering Lab for Big Data Analytics Xi'an Jiaotong University China Lenovo Research Beijing China

Relation clustering is a general approach for open relation extraction (OpenRE). Current methods have two major problems. One is that their good performance relies on large amounts of labeled and pre-defined relational instances for pre-training, which are costly to acquire in reality. The other is that they only focus on learning a high-dimensional metric space to measure the similarity of novel relations and ignore the specific relational representations of clusters. In this work, we propose a new prompt-based framework named MatchPrompt, which can realize OpenRE with efficient knowledge transfer from only a few predefined relational instances as well as mine the specific meanings for cluster interpretability. To our best knowledge, we are the first to introduce a prompt-based framework for unlabeled clustering. Experimental results on different datasets show that MatchPrompt achieves the new SOTA results for OpenRE. © 2022 Association for Computational Linguistics.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

Protein Structure Prediction Using A New Optimization-Based Evolutionary and Explainable Artificial Intelligence Approach

引用

IEEE Transactions on Evolutionary Computation 2024年第3期29卷 1-1页

作者： Hong, Jun Zhan, Zhi-Hui He, Langchong Xu, Zongben Zhang, Jun School of Computer Science and Engineering South China University of Technology Guangzhou P. R. China Health Science Center School of Pharmacy Xi’an Jiaotong University Xi’an P. R. China National Engineering Laboratory for Big Data Analytics Xi’an Jiaotong University Xi’an P. R. China College of Artificial Intelligence Nankai University Tianjin P. R. China

Protein structure prediction (PSP) is an important scientific problem because it helps humans to understand how proteins perform their biological functions. This paper models the PSP problem as a multi-objective optimization problem with three fast and accurate knowledge-based energy functions. This way, using evolutionary computation (EC)-based artificial intelligence (AI) approach to solve this multi-objective PSP problem to find the optimal structure is explainable. Considering that the multiple populations for multiple objectives (MPMO) framework shows efficient performance in solving lots of multi-objective benchmarks and real-world problems, this paper proposes a new AI approach named improved MPMO-based differential evolution (IMPMO-DE) to solve the multi-objective PSP problem. To our best knowledge, this is the first time that MPMO is applied to PSP, with three novel strategies. First, an adaptive archive-based mutation strategy is proposed to better balance the exploration and exploitation abilities by adaptively using different archive-based mutation operators in different evolutionary stages. Second, a mixed individual transfer strategy is proposed to share search information among the multiple populations to accelerate the convergence speed. Third, an evolvable archive update strategy is proposed to generate more promising solutions through evolving the archived solutions. IMPMO-DE is tested on 28 representative proteins and all the available template-free modeling proteins up to 404 residues in the famous Critical Assessment of Protein Structure Prediction (CASP14) competition. Experimental results show that IMPMO-DE performs better than the compared state-of-the-art EC-based PSP methods and ranks above average compared with all the CASP14 competitors. More importantly, IMPMO-DE is a new efficient AI approach that opens a promising optimization-based evolutionary and explainable way for efficient PSP rather than deep learning approaches like AlphaFold2,

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Unlabeled data driven cost-sensitive inverse projection sparse representation-based classification with 1/2 regularization

引用

Science China(Information Sciences) 2022年第8期65卷 39-56页

作者： Xiaohui YANG Zheng WANG Jian SUN Zongben XU Henan Engineering Research Center for Artificial Intelligence Theory and Algorithms School of Mathematics and StatisticsHenan University National Engineering Laboratory for Big Data Analytics School of Mathematics and StatisticsXi'an Jiaotong University

Sparse representation-based classification(SRC) has been widely used because it just relies on simple linear regression ideas to do classification, and it does not need learning. However, the performance of SRC is limited by needing sufficient labeled samples per class and the sensitivity to class imbalance. For tackling these problems, an improved SRC model is constructed in this paper. For alleviating the problem of insufficient labeled samples, an unlabeled data-driven inverse projection sparse representation-based classification model is constructed to achieve effective and stable representation and recognition results. The L1/2 and S1/2 regularizations are introduced to capture the sparsity of 1-D and 2-D, and to make the model have good statistical properties. Moreover, the cost-sensitive strategy is integrated into the model's classification criteria to improve the imbalance of class distribution adaptively, especially for multiclass imbalanced data.A solver utilizing the mixed Gauss-Seidel and Jacobian ADMM algorithm is developed to obtain the approximate solution. Experiments on common public test databases show that the proposed model achieves competitive results compared with the latest published results and some deep-learning algorithms.

关键词： unlabeled-data driven 1/2 regularization cost-sensitive inverse projection sparse representation-based classification

来源：评论

学校读者我要写书评

暂无评论

Logic-Aware Knowledge Graph Reasoning for Structural Sparsity under Large Language Model Supervision 25

Logic-Aware Knowledge Graph Reasoning for Structural Sparsit...

引用

34th ACM Web Conference, WWW 2025

作者： Pan, Yudai Hong, Jiajie Zhao, Tianzhe Song, Lingyun Liu, Jun Shang, Xuequn School of Computer Science Northwest Polytechnical University Shaanxi Xi’an China Key Laboratory of Big Data Storage and Management Northwestern Polytechnical University Shaanxi Xi’an China School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an China Research & Development Institute of Northwestern Polytechnical University in Shenzhen Shenzhen China National Engineering Lab for Big Data Analytics Xi’an Jiaotong University Shaanxi Xi’an China

ISBN: (纸本)9798400712746

Knowledge Graph (KG) reasoning aims to predict missing entities in incomplete triples, which requires adequate structural information to derive accurate embeddings. However, KGs in the real world are not as dense as the idealized benchmarks, where sparse graph structures restrict the comprehensive structural information for superior performance. Although the logical semantics in KGs shows its potential in alleviating the impact of structural sparsity, there still exist some challenges. The deficient supervision and the semantic gap of logic make it difficult to introduce logical semantics in sparse KG reasoning. To this end, we propose a novel KG reasoning approach LoLLM injecting logic with the supervised information supplied by the Large Language Model (LLM), which is proved to be effective in evaluating and scoring. Firstly, LoLLM derives structural embeddings employing a graph convolutional network (GCN) with relation-aware and triple-aware attention. LoLLM secondly constructs reasoning paths instantiated from the first-order logic rules extracted from sparse KGs, and injects the logical semantics by a designed LLM-enhanced tuning strategy. We propose a textual loss (TL) and a logical loss (LL) in the optimization and obtain logical tuning embeddings of KG in this process. Finally, LoLLM fuses structural embeddings from the GCN and logical tuning embeddings from the LLM-enhanced tuning for scoring and incomplete triple prediction. Extensive experiments on two sparse KGs and a benchmark show that LoLLM outperforms state-of-the-art structure-based and Language Model (LM)-augmented baselines. Moreover, the logic rules with corresponding confidences provide explicit explanations as an interpretable paradigm. © 2025 Copyright held by the owner/author(s).

关键词： Structural analysis

来源：评论

学校读者我要写书评

暂无评论

Mitigating Object Hallucinations in Large Vision-Language Models with Assembly of Global and Local Attention

arXiv

引用

arXiv 2024年

作者： An, Wenbin Tian, Feng Leng, Sicong Nie, Jiahao Lin, Haonan Wang, Qianying Chen, Ping Zhang, Xiaoqin Lu, Shijian Xi’an Jiaotong University China National Engineering Laboratory for Big Data Analytics China Nanyang Technological University Singapore Lenovo Research University of Massachusetts Boston United States Zhejiang University of Technology China

Despite great success across various multimodal tasks, Large Vision-Language Models (LVLMs) often encounter object hallucinations with generated textual responses being inconsistent with the actual objects in images. We examine different LVLMs and pinpoint that one root cause of object hallucinations lies with deficient attention on discriminative image features. Specifically, LVLMs often predominantly attend to prompt-irrelevant global features instead of prompt-relevant local features, undermining their visual grounding capacity and leading to object hallucinations. We propose Assembly of Global and Local Attention (AGLA), a training-free and plug-and-play approach that mitigates hallucinations by assembling global features for response generation and local features for visual discrimination simultaneously. Specifically, we introduce an image-prompt matching scheme that captures prompt-relevant local features from images, leading to an augmented view of the input image where prompt-relevant content is highlighted while irrelevant distractions are suppressed. Hallucinations can thus be mitigated with a calibrated logit distribution that is from generative global features of the original image and discriminative local features of the augmented image. Extensive experiments show the superiority of AGLA in LVLM hallucination mitigation, demonstrating its wide applicability across both discriminative and generative tasks. Our code is available at https://***/Lackel/AGLA. © 2024, CC BY.

关键词： Visual languages

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：