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

Claudiu Creanga

dblp:361/0685 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
4since 2021 · last 2026
0009-0005-5443-5506ORCID · corroborated

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

Artificial intelligence and machine learning · 4 · 2 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Human-computer interaction and ubiquitous 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
Language models and text generation · 67% Information extraction and text analysis · 33%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 50% Recommender systems · 50%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation › text generation › text simplification
lexical simplification
0.912025
RALS: Resources and Baselines for Romanian Automatic Lexical Simplification · EMNLP 2025
Natural language and speech › Language models and text generation › text generation
text simplification
0.912025
RALS: Resources and Baselines for Romanian Automatic Lexical Simplification · EMNLP 2025
Recommender systems › personalized ranking
pairwise ranking
0.312025
RALS: Resources and Baselines for Romanian Automatic Lexical Simplification · EMNLP 2025
Information retrieval
ranking
0.312025
RALS: Resources and Baselines for Romanian Automatic Lexical Simplification · EMNLP 2025

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

pairwise ranking approximation · 1.7
YearPublicationVenuePosition
2026 The Art That Poses Back: Assessing AI Pastiches After Contemporary Artworks
Anca P. Dinu, Andreiana Mihail, Andra Maria Florescu, Claudiu Creanga
EvoMUSART4
2025 RALS: Resources and Baselines for Romanian Automatic Lexical Simplification
abstract
We introduce the first dataset that jointly covers both lexical complexity prediction (LCP) annotations and lexical simplification (LS) for Romanian, along with a comparison of lexical simplification approaches.We propose a methodology for ordering simplification suggestions using a pairwise ranking approximation method, arranging candidates from simple to complex based on a separate set of human judgments.In addition, we provide human lexical complexity annotations for 3,921 word samples in context.Finally, we explore several novel pipelines for complexity prediction and simplification and present the first text simplification system for Romanian.
Fabian Anghel, Cristea Petru-Theodor, Claudiu Creanga, Sergiu Nisioi
EMNLP3
2025 Benchmarking Large Language Models for Biomedical Relation Extraction
abstract
Extracting SNP-phenotype associations from biomedical literature is vital but challenging. We benchmarked diverse NLP models, including MLMs, hybrid architectures, and state-of-the-art LLMs (Gemini 2.0, OpenAI O-series, Qwen, Mistral), on the SNPPhenA corpus across three tasks: sentence-level, abstract-level, and association strength classification. OpenAI O1 achieved state-of-the-art (SOTA) results using few-shot learning for non-finetuned sentence-level classification (F1 0.89) and established a new SOTA for abstract-level classification (F1 0.82). Association strength classification proved difficult, though fine-tuned Gemini 2.0 Pro performed best (F1 0.60) in the first LLM evaluation of this task. Proprietary LLMs, especially in few-shot (O1) or fine-tuned (Gemini 2.0 Pro) settings, significantly outperformed other models. These findings confrm the power of modern LLMs for genomic knowledge extraction.
Claudiu Creanga, Teodor-George Marchitan, Liviu P. Dinu
KES1
2024 Fine-Tuning Models for Biomedical Relation Extraction
abstract
Next-Generation Sequencing has revolutionized the study of genetic mutations, enabling large-scale investigations into their roles in disease development. However, extracting meaningful insights from the vast amount of biomedical literature remains a complex challenge that cannot be addressed manually. In this paper, we present pre-trained models (PTMs) for the automatic extraction of relations from biomedical text, specifically targeting the variant-phenotype domain. Our evaluation on the SNPPhenA corpus demonstrates that fine-tuning small BERT-based models, particularly DeBERTa, yields strong performance, approaching the current state-of-the-art (SOTA). Additionally, our results indicate that carefully fine-tuning Google’s Gemini Pro 1.0 outperforms the existing SOTA for both sentence-level tasks (where the model processes only the target sentence) and abstract-level tasks (where the model processes the entire abstract).
Claudiu Creanga, Liviu P. Dinu, Daniela Gîfu
KES1