Demo Data from EDBT 2026 / reviewers in the wild / expert
Minju Song
dblp:240/8428
· DBLP profile ↗
4ranked-venue papers
1as first author
4since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Theory of computation · 1 · 1 first-author · 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
1 paper |
Knowledge representation and reasoning · 67% Language models and text generation · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge, reasoning and agents › Knowledge representation and reasoning
analogical reasoning |
1.0 | 1 | 2026 | The Curious Case of Analogies: Investigating Analogical Reasoning in Large Language Models · AAAI 2026 |
Natural language and speech › Language models and text generation
large language model |
1.0 | 1 | 2026 | The Curious Case of Analogies: Investigating Analogical Reasoning in Large Language Models · AAAI 2026 |
Knowledge, reasoning and agents › Knowledge representation and reasoning
relational reasoning |
1.0 | 1 | 2026 | The Curious Case of Analogies: Investigating Analogical Reasoning in Large Language Models · AAAI 2026 |
Methods — techniques the papers use, named apart from their topics
layer-wise probing · 1.0hidden representation patching · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | The Curious Case of Analogies: Investigating Analogical Reasoning in Large Language ModelsabstractAnalogical reasoning is at the core of human cognition, serving as an important foundation for a variety of intellectual activities. While prior work has shown that LLMs can represent task patterns and surface-level concepts, it remains unclear whether these models can encode high-level relational concepts and apply them to novel situations through structured comparisons. In this work, we explore this fundamental aspect using proportional and story analogies, and identify three key findings. First, LLMs effectively encode the underlying relationships between analogous entities; both attributive and relational information propagate through mid-upper layers in correct cases, whereas reasoning failures reflect missing relational information within these layers. Second, unlike humans, LLMs often struggle not only when relational information is missing, but also when attempting to apply it to new entities. In such cases, strategically patching hidden representations at critical token positions can facilitate information transfer to a certain extent. Lastly, successful analogical reasoning in LLMs is marked by strong structural alignment between analogous situations, whereas failures often reflect degraded or misplaced alignment. Overall, our findings reveal that LLMs exhibit emerging but limited capabilities in encoding and applying high-level relational concepts, highlighting both parallels and gaps with human cognition. Taewhoo Lee, Minju Song, Chanwoong Yoon, Jungwoo Park, Jaewoo Kang |
AAAI | 2 |
| 2025 | CoTox: Chain-of-Thought-Based Molecular Toxicity Reasoning and PredictionabstractDrug toxicity remains a major challenge in phar-maceutical development. Recent machine learning models have improved in silico toxicity prediction, but their reliance on annotated data and lack of interpretability limit their applica-bility. This limits their ability to capture organ-specific toxicities driven by complex biological mechanisms. Large language mod-els (LLMs) offer a promising alternative through step-by-step reasoning and integration of textual data, yet prior approaches lack biological context and transparent rationale. To address this issue, we propose CoTox, a novel framework that integrates LLM with chain-of-thought (CoT) reasoning for multi-organ toxicity prediction. CoTox combines chemical structure data, biological pathways, and Gene Ontology (GO) terms to generate interpretable toxicity predictions through step-by-step reasoning. Using GPT-40, we show that CoTox outperforms both traditional machine learning and deep learning models. We further examine its performance across various LLMs to identify where CoTox is most effective. In particular, Gemini-2.5-Pro demonstrates strong performance across multiple organ-specific toxicity tasks. Its reasoning outputs are consistently grounded in biologically validated mechanisms documented in the literature, as shown in the case study. This result highlights the potential of LLM-based frameworks to improve interpretability and support early-stage drug safety assessment. The code and prompt used in this work are available at https://github.comJdmis-lab/CoTox. Jueon Park, Yein Park, Minju Song, Soyon Park, Seungheun Baek, Jaewoo Kang |
BIBM | 3 |
| 2025 | ETHIC: Evaluating Large Language Models on Long-Context Tasks with High Information CoverageabstractTaewhoo Lee, Chanwoong Yoon, Kyochul Jang, Donghyeon Lee, Minju Song, Hyunjae Kim, Jaewoo Kang. Proceedings of the 2025 Conference of the Nations of the Americas Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers). 2025. Taewhoo Lee, Chanwoong Yoon, Kyochul Jang, Minju Song, Hyunjae Kim, Jaewoo Kang |
NAACL (Long Papers) | 5 |
| 2025 | Farthest-Point Voronoi Diagrams in the Hilbert MetricabstractThe Hilbert metric, introduced by David Hilbert in 1895, is a projective metric defined on a bounded convex domain in a Euclidean space. For a convex polygon with m vertices and n point sites lying inside the polygon in the plane, it is shown that the nearest-point Voronoi diagram in the Hilbert metric has combinatorial complexity of O(mn) [Gezalyan and Mount, SoCG 2023]. In this paper, we show that the farthest-point Voronoi diagram in the Hilbert metric has combinatorial complexity O(m), which is independent of the number of sites. Also, we present an efficient algorithm to compute the farthest-point Voronoi diagram. Minju Song, Mook Kwon Jung, Hee-Kap Ahn |
WADS | 1 |