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

Adriel Kuek

dblp:354/8186 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2025
0009-0009-5190-2534ORCID · 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 · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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.

Artificial intelligence
2 papers
Knowledge representation and reasoning · 70% Vision and language · 30%
Computer graphics and multimedia
1 paper
Multimedia analysis and retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Knowledge representation and reasoning
knowledge graph
0.912025
Improving Soft Unification with Knowledge Graph Embedding Methods · ICML 2025
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge graph
knowledge graph embedding
0.912025
Improving Soft Unification with Knowledge Graph Embedding Methods · ICML 2025
Knowledge, reasoning and agents › Knowledge representation and reasoning › neuro-symbolic reasoning
neural theorem proving
0.912025
Improving Soft Unification with Knowledge Graph Embedding Methods · ICML 2025
Knowledge, reasoning and agents › Knowledge representation and reasoning
neuro-symbolic reasoning
0.912025
Improving Soft Unification with Knowledge Graph Embedding Methods · ICML 2025
Computer vision › Vision and language › multimodal harmful content detection
hateful meme detection
0.712023
Pro-Cap: Leveraging a Frozen Vision-Language Model for Hateful Meme Detection · ACM Multimedia 2023
Computer vision › Vision and language › vision-language model › prompt learning
vision-language model prompting
0.712023
Pro-Cap: Leveraging a Frozen Vision-Language Model for Hateful Meme Detection · ACM Multimedia 2023
Multimedia analysis and retrieval › harmful content detection › hate speech detection
hateful meme detection
0.712023
Pro-Cap: Leveraging a Frozen Vision-Language Model for Hateful Meme Detection · ACM Multimedia 2023
Computer vision › Vision and language › visual question answering
zero-shot visual question answering
0.212023
Pro-Cap: Leveraging a Frozen Vision-Language Model for Hateful Meme Detection · ACM Multimedia 2023

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

zero-shot VQA · 1.3vision-language model prompting · 1.3captioning · 1.3soft unification · 0.9logic programming · 0.9
YearPublicationVenuePosition
2025 Improving Soft Unification with Knowledge Graph Embedding Methods
abstract
Neural Theorem Provers (NTPs) present a promising framework for neuro-symbolic reasoning, combining end-to-end differentiability with the interpretability of symbolic logic programming. However, optimizing NTPs remains a significant challenge due to their complex objective landscape and gradient sparcity. On the other hand, Knowledge Graph Embedding (KGE) methods offer smooth optimization with well-defined learning objectives but often lack interpretability. In this work, we propose several strategies to integrate the strengths of NTPs and KGEs, and demonstrate substantial improvements in both accuracy and computational efficiency. Specifically, we show that by leveraging the strength of structural learning in KGEs, we can greatly improve NTPs’ poorly structured embedding space, while by substituting NTPs with efficient KGE operations, we can significantly reduce evaluation time by over 1000$\times$ on large-scale dataset such as WN18RR with a mild accuracy trade-off.
Xuanming Cui, Chionh Wei Peng, Adriel Kuek, Ser-Nam Lim
ICML3
2023 MERMAID: A Dataset and Framework for Multimodal Meme Semantic Understanding
abstract
Memes are widely used to convey cultural and societal issues and have a significant impact on public opinion. However, little work has been done on understanding and explaining the semantics expressed in multimodal memes. To fill this research gap, we introduce MERMAID, a dataset consisting of 3,633 memes annotated with their entities and relations, and propose a novel MERF pipeline that extracts entities and their relationships in memes. Our framework combines state-of-the-art techniques from natural language processing and computer vision to extract text and image features and infer relationships between entities in memes. We evaluate the proposed framework on a real-world meme dataset and establish the benchmark for the new multimodal meme semantic understanding task. Our evaluation also includes a low-resource setting, where we assess the applicability of our framework to low-resource settings, which is a common problem due to the high cost and lack of labeled data for relations in memes. Overall, our work contributes to the understanding of the semantics of memes, a crucial form of communication in today’s society.
Shaun Toh, Adriel Kuek, Wen-Haw Chong, Roy Ka-Wei Lee
IEEE Big Data2
2023 Pro-Cap: Leveraging a Frozen Vision-Language Model for Hateful Meme Detection
abstract
Hateful meme detection is a challenging multimodal task that requires comprehension of both vision and language, as well as cross-modal interactions. Recent studies have tried to fine-tune pre-trained vision-language models (PVLMs) for this task. However, with increasing model sizes, it becomes important to leverage powerful PVLMs more efficiently, rather than simply fine-tuning them. Recently, researchers have attempted to convert meme images into textual captions and prompt language models for predictions. This approach has shown good performance but suffers from non-informative image captions. Considering the two factors mentioned above, we propose a probing-based captioning approach to leverage PVLMs in a zero-shot visual question answering (VQA) manner. Specifically, we prompt a frozen PVLM by asking hateful content-related questions and use the answers as image captions (which we call Pro-Cap), so that the captions contain information critical for hateful content detection. The good performance of models with Pro-Cap on three benchmarks validates the effectiveness and generalization of the proposed method1.
Rui Cao 0002, Ming Shan Hee, Adriel Kuek, Wen-Haw Chong, Roy Ka-Wei Lee, Jing Jiang 0001
ACM Multimedia3