Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yingyao Ma

dblp:408/3740 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
6since 2021 · last 2026
0009-0004-3783-0128ORCID · corroborated

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

Artificial intelligence and machine learning · 3 · 3 since 2021Databases, data management, data science and information retrieval · 3 · 1 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 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
1 paper
Knowledge graphs · 100%
Artificial intelligence
1 paper
Information extraction and text analysis · 100%

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

TopicWeightPapersLastEvidence papers
Knowledge graphs
link prediction
1.012026
FocusKG: A Novel Multimodal Knowledge Graph Dataset With Temporal Information for Link Prediction · IEEE Trans. Knowl. Data Eng. 2026
Knowledge graphs
multimodal knowledge graph
1.012026
FocusKG: A Novel Multimodal Knowledge Graph Dataset With Temporal Information for Link Prediction · IEEE Trans. Knowl. Data Eng. 2026
Knowledge graphs
temporal knowledge graph
1.012026
FocusKG: A Novel Multimodal Knowledge Graph Dataset With Temporal Information for Link Prediction · IEEE Trans. Knowl. Data Eng. 2026
Natural language and speech › Information extraction and text analysis
entity linking
0.912025
Multimodal Entity Linking With Dynamic Modality Selection and Interactive Prompt Learning · IEEE Trans. Knowl. Data Eng. 2025
Natural language and speech › Information extraction and text analysis › entity linking
multimodal entity linking
0.912025
Multimodal Entity Linking With Dynamic Modality Selection and Interactive Prompt Learning · IEEE Trans. Knowl. Data Eng. 2025
Knowledge graphs
knowledge graph embedding
0.312026
FocusKG: A Novel Multimodal Knowledge Graph Dataset With Temporal Information for Link Prediction · IEEE Trans. Knowl. Data Eng. 2026
Knowledge graphs › knowledge graph embedding
multimodal knowledge graph embedding
0.312026
FocusKG: A Novel Multimodal Knowledge Graph Dataset With Temporal Information for Link Prediction · IEEE Trans. Knowl. Data Eng. 2026

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

time aggregation · 1.0modality-specific encoder · 1.0graph neural network · 1.0reparameterization · 0.9prompt learning · 0.9gating network · 0.9expert networks · 0.9
YearPublicationVenuePosition
2026 HMTE: Memory-transformer representation learning for knowledge hypergraph completion
Wanqiang Cai, Yingyao Ma, Lotfi Senhadji, Huazhong Shu, Jiasong Wu
Neurocomputing4
2026 FocusKG: A Novel Multimodal Knowledge Graph Dataset With Temporal Information for Link Prediction
abstract
Knowledge graphs (KGs) play a central role in enabling structured reasoning for AI applications. Recent research has advanced two prominent extensions of KGs: multimodal KGs, which integrate diverse data sources such as text, images, audio, and video; and temporal KGs, which capture the dynamic evolution of knowledge over time. However, these two paradigms remain largely disjoint—multimodal KGs typically ignore temporal dynamics, while temporal KGs overlook rich multimodal context. To bridge this gap, we introduceFocusKG, the first discrete-time multimodal knowledge graph that unifies four modalities (text, image, audio, and video) with temporal annotations. Built from the Focus news program, FocusKG captures real-world events as temporally grounded multimodal facts, offering new expressiveness for time-sensitive tasks. We further propose aDiscrete-TimeMultimodal Knowledge GraphEmbedding (DTME) method, a novel framework tailored for learning representations over temporal multimodal KGs. DTME is composed of three key modules: (1) Multimodal Preprocessing, which encodes raw inputs from each modality into vector representations using modality-specific encoders; (2) Cross-Modal Graph Enhancer, which captures semantic interplay between entity and relation modalities through role-aware subgraph construction and a modality interaction network; and (3) Multi-Branch Time Aggregation, which injects temporal signals by modeling interactions between time and modality-aware features. Extensive experiments demonstrate FocusKG's value and DTME's efficacy. On link prediction, DTME outperforms state-of-the-art multimodal KG models and temporal KG models. We release FocusKG as a benchmark to foster research in multimodal temporal reasoning.
Yingyao Ma, Wanqiang Cai, Rubing Duan, Jiasong Wu, Lotfi Senhadji, Huazhong Shu
IEEE Trans. Knowl. Data Eng.2
2025 CrackMamba with Normalized Soft-Frangi-Filter Enhancement towards Accurate Crack Segmentation
abstract
Crack segmentation is crucial in monitoring infrastructure degradation. However, the strong contextual dependencies of long-spanned morphology and numerous fine-grained branches hinder high-precision segmentation performance. To tackle the above obstacles, we provide a pure Mamba-based model termed CrackMamba for accurate crack segmentation. CrackMamba utilizes the Mamba-based Feature Extractor (MFE) to effectively model global dependencies of long-spanned cracks with linear computational complexity for powerful representation. To capture fine-grained crack branches, we design a novel texture refinement module, which employs a multi-scale aggregation strategy and utilizes the MFE and a Normalized Soft-Frangi-Filter (NSFF) module to integrate hierarchical features from the decoder. The CrackMamba and NSFF exhibit strong complementarity. The NSFF module enhances the capability of CrackMamba to segment fine-grained crack textures, while CrackMamba effectively eliminating crack-unrelated curves extracted by NSFF module. Extensive experiments are conducted on two benchmark crack datasets, and the results demonstrate that the proposed CrackMamba achieves the state-of-the-art (SOTA) performance with fewer parameters and higher computational efficiency.
Wanqiang Cai, Yingyao Ma, Jiasong Wu, ZongYuan Ge, Bin Wang 0041
ICMR4
2025 HSAE: Hierarchical structure augment embedding for various knowledge graph completion
Wanqiang Cai, Yingyao Ma, Lotfi Senhadji, Huazhong Shu, Jiasong Wu
Knowl. Based Syst.3
2025 Make your choice for multimodal knowledge graph completion
Shuoyan Ren, Wanqiang Cai, Yingyao Ma, Lotfi Senhadji, Huazhong Shu, Jiasong Wu
Knowl. Based Syst.4
2025 Multimodal Entity Linking With Dynamic Modality Selection and Interactive Prompt Learning
abstract
Recent advances in Multimodal Entity Linking leverage multimodal information to link target mentions to corresponding entities. However, existing methods uniformly adopt a “one-size-fits-all” approach, which overlooks the unique requirements of individual samples and fails to adequately balance modality-assisted disambiguation and modality-induced noise. Also, the commonly used separate large-scale visual and text pretrained models for feature extraction do not address inter-modal heterogeneity and the high computational cost of fine-tuning. To resolve these two issues, we introduce a novel approach named Multimodal Entity Linking with Dynamic Modality Selection and Interactive Prompt Learning (DSMIP). First, we design three expert networks that utilize different subsets of modalities tailored to the task and train them individually. Specifically, for the multimodal expert network, we enhance entity and mention feature extraction by updating multimodal prompts and setting up a coupling function to realize the interaction of prompts between modalities. Subsequently, to select the best-suited expert network for each specific sample, we devise a Modality Selection Gating Network to gain the optimal one-hot selection vector by applying a specialized reparameterization technique and a two-stage training process. Experimental results on three public benchmark datasets demonstrate that the proposed DSMIP outperforms all state-of-the-art baselines. The code is released on https://github.com/mayy-seu/DSMIP-code.
Yingyao Ma, Jiasong Wu, Lotfi Senhadji, Huazhong Shu, Jian Yang 0009
IEEE Trans. Knowl. Data Eng.1