Bin Chong

dblp:281/9452 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
4since 2021 · last 2026
0000-0002-8741-178XORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 since 2021Databases, data management, data science and information retrieval · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
3 papers
Knowledge graphs · 71% Data mining · 29%
Artificial intelligence
3 papers
Graph learning · 47% Language models and text generation · 26% Question answering and dialogue systems · 20%

Topics — the 13 heaviest of 13, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge graphs › knowledge graph alignment › entity alignment
multi-modal entity alignment
2.022026
Enhancing Multi-Modal Entity Alignment via Multi-Grained Decision Fusion · WWW 2026
On Modality Weighting and Specificity for Multi-Modal Entity Alignment · AAAI 2026
Machine learning › Graph learning
graph neural network
1.012026
Mitigating Homophily Disparity in Graph Anomaly Detection: A Scalable and Adaptive Approach · WWW 2026
Natural language and speech › Language models and text generation
knowledge editing
1.012026
EchoEdit: Consistent Multi-Hop Question Answering via Ripple Control in Knowledge Editing · AAAI 2026
Natural language and speech › Question answering and dialogue systems › reasoning-based question answering
multi-hop question answering
1.012026
EchoEdit: Consistent Multi-Hop Question Answering via Ripple Control in Knowledge Editing · AAAI 2026
Machine learning › Graph learning › graph neural network
scalable graph neural network
1.012026
Mitigating Homophily Disparity in Graph Anomaly Detection: A Scalable and Adaptive Approach · WWW 2026
Data mining
anomaly detection
1.012026
Mitigating Homophily Disparity in Graph Anomaly Detection: A Scalable and Adaptive Approach · WWW 2026
Knowledge graphs › knowledge graph alignment
entity alignment
1.012026
On Modality Weighting and Specificity for Multi-Modal Entity Alignment · AAAI 2026
Data mining › anomaly detection
graph anomaly detection
1.012026
Mitigating Homophily Disparity in Graph Anomaly Detection: A Scalable and Adaptive Approach · WWW 2026
Knowledge graphs
knowledge graph embedding
1.012026
On Modality Weighting and Specificity for Multi-Modal Entity Alignment · AAAI 2026
Knowledge graphs
multimodal knowledge graph
1.012026
On Modality Weighting and Specificity for Multi-Modal Entity Alignment · AAAI 2026
Natural language and speech › Language models and text generation
chain-of-thought reasoning
0.312026
EchoEdit: Consistent Multi-Hop Question Answering via Ripple Control in Knowledge Editing · AAAI 2026
Machine learning › Graph learning › graph neural network
homophily and heterophily
0.312026
Mitigating Homophily Disparity in Graph Anomaly Detection: A Scalable and Adaptive Approach · WWW 2026
Machine learning › Representation and self-supervised learning › multimodal representation learning
modality-specific representation
0.312026
On Modality Weighting and Specificity for Multi-Modal Entity Alignment · AAAI 2026

Methods — techniques the papers use, named apart from their topics

knowledge distillation · 3.0contrastive learning · 3.0mixture of experts · 2.0mini-batch training · 2.0chebyshev filters · 2.0adaptive fusion · 2.0multi-modal knowledge encoding · 1.0graph modeling · 1.0chain-of-thought · 1.0
YearPublicationVenuePosition
2026 EchoEdit: Consistent Multi-Hop Question Answering via Ripple Control in Knowledge Editing
abstract
Knowledge editing aims to update specific knowledge in Large Language Models (LLMs) without retraining the entire model. However, existing methods generally struggle to manage the ripple effects of knowledge updates, particularly in multi-hop reasoning tasks, where conflicts between old and new information often lead to shifts in reasoning chains and degraded consistency. To address this issue, a ripple-aware knowledge editing framework, namely EchoEdit, is proposed. EchoEdit introduces the RippleGraph to explicitly model potentially affected knowledge regions and employs a RippleRule generator to dynamically produce diffusion rules, precisely constraining knowledge propagation. Furthermore, we distill a Chain-of-Thought (CoT) planner from an external teacher model, which decouples complex reasoning chain planning into RippleGraph-guided reasoning, thereby alleviating the reasoning burden on low-resource LLMs in multi-hop tasks. Experimental results on the MQuAKE and RIPPLEEDITS multi-hop reasoning benchmarks demonstrate that EchoEdit significantly outperforms existing mainstream methods, effectively enhancing post-edit reasoning consistency and generalization capabilities.
Jinwei Shi, Yunhui Liu 0002, Tao Zheng 0005, Bin Chong, Tieke He
AAAI6
2026 On Modality Weighting and Specificity for Multi-Modal Entity Alignment
abstract
Multi-modal entity alignment aims to identify equivalent entities across different multi-modal knowledge graphs (MMKGs). While prior work has achieved notable progress through improved multi-modal encoding and cross-modal fusion techniques, two critical challenges remain unresolved. First, due to the heterogeneous and often inconsistent sources from which MMKGs are constructed, the quality and informativeness of modalities vary significantly across entities, leading to the modality weighting problem. Second, existing cross-modal fusion mechanisms predominantly emphasize modality-shared information, often at the expense of modality-specific signals that are also essential for precise alignment. To address these issues, we propose HUMEA, a novel framework that integrates hierarchical Mixture-of-Experts (MoE) with unimodal distillation. HUMEA consists of: (1) A hierarchical MoE module comprising intra-modal and inter-modal experts, which adaptively modulates modality contributions by capturing entity representations at fine-to-coarse semantic granularities. In addition, we introduce a contrastive mutual information loss to enhance expert diversity and reduce redundancy. (2) A unimodal distillation strategy that preserves modality-specific information in the fused representations through single-modality alignment and distillation, achieving a balanced integration of shared and unique modality features. Extensive experiments on two benchmark datasets, FB15K-DB15K and FB15K-YAGO15K, demonstrate state-of-the-art performance, validating the effectiveness of our approach.
Qizhuo Xie, Yunhui Liu 0002, Qing Gu 0001, Tao Zheng 0005, Bin Chong, Tieke He
AAAI6
2026 Mitigating Homophily Disparity in Graph Anomaly Detection: A Scalable and Adaptive Approach
abstract
Graph anomaly detection (GAD) aims to identify nodes that deviate from normal patterns in structure or features. While recent GNN-based approaches have advanced this task, they struggle with two major challenges: 1) homophily disparity, where nodes exhibit varying homophily at both class and node levels; and 2) limited scalability, as many methods rely on costly whole-graph operations. To address them, we propose SAGAD, a Scalable and Adaptive framework for GAD. SAGAD precomputes multi-hop embeddings and applies reparameterized Chebyshev filters to extract low- and high-frequency information, enabling efficient training and capturing both homophilic and heterophilic patterns. To mitigate node-level homophily disparity, we introduce an Anomaly Context-Aware Adaptive Fusion, which adaptively fuses low- and high-pass embeddings using fusion coefficients conditioned on Rayleigh Quotient-guided anomalous subgraph structures for each node. To alleviate class-level disparity, we design a Frequency Preference Guidance Loss, which encourages anomalies to preserve more high-frequency information than normal nodes. SAGAD supports mini-batch training, achieves linear time and space complexity, and drastically reduces memory usage on large-scale graphs. Theoretically, SAGAD ensures asymptotic linear separability between normal and abnormal nodes under mild conditions. Extensive experiments on 10 benchmarks confirm SAGAD's superior accuracy and scalability over state-of-the-art methods.
Yunhui Liu 0002, Qizhuo Xie, Xudong Jin, Tao Zheng 0005, Bin Chong, Tieke He
WWW6
2026 Enhancing Multi-Modal Entity Alignment via Multi-Grained Decision Fusion
abstract
Multi-modal entity alignment (MMEA) aims to identify equivalent entities across heterogeneous multi-modal knowledge graphs (MMKGs), which play a crucial role in organizing and integrating web knowledge from diverse modalities. Although prior studies have made progress by multi-modal features fusion, three inherent limitations remain unresolved. First, instance-level feature fusion is misaligned with the pair-wise task format of MMEA. Second, joint representations often overlook modality-specific characteristics, resulting in insufficient alignment. Third, most existing methods rely solely on global features of modality. This may lead to the misalignment of entities that are similar yet distinct. To address above issues, we propose DMEA, a new decision-fusion-based framework. Specifically, we first design a multi-modal knowledge encoding module to extract both global and local features for different modalities and then introduce a multi-grained alignment module, which consists of two components: intra-modal alignment and cross-modal alignment. The former computes alignment scores between the global and local features of entity pairs within the same modality, while the latter leverages the complementarity across modalities to compute cross-modal alignment scores. Each score is regarded as an independent decision, and the final alignment judgment is made by integrating all decisions. Finally, we incorporate an intra-modal contrastive loss to obtain more discriminative embedding representations. DMEA achieves improvements of 13.2% and 14.8% in hit@1 over the state-of-the-art models on two benchmark datasets, FB15K-DB15K and FB15K-YAGO15K, respectively, validating the superiority of our framework.
Qizhuo Xie, Qianzi Hou, Qing Gu 0001, Bin Chong, Tieke He
WWW7