EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC-ND 4.0

Hierarchy Depth as a Data Curation Variable: Comparing Two and Three-Level Hierarchical Leiden Structures for LLM Fine-Tuning

Ülke Balcı Yeşilkaya, İlker Yeşilkaya

Procedia Computer Science · 2026 · 292 · 1652-1661

DOI: 10.1016/j.procs.2026.09.241 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Procedia Computer Science, 2026. Verfasst von Ülke Balcı Yeşilkaya und 1 weiteren Autor:innen. Die Arbeit nennt 20 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Zitieren

APA

Yeşilkaya, Ü. B., & Yeşilkaya, İ. (2026). Hierarchy Depth as a Data Curation Variable: Comparing Two and Three-Level Hierarchical Leiden Structures for LLM Fine-Tuning. Procedia Computer Science, 292, 1652-1661. https://doi.org/10.1016/j.procs.2026.09.241

Vancouver

Yeşilkaya ÜB, Yeşilkaya İ. Hierarchy Depth as a Data Curation Variable: Comparing Two and Three-Level Hierarchical Leiden Structures for LLM Fine-Tuning. Procedia Computer Science. 2026;292:1652-1661. doi:10.1016/j.procs.2026.09.241

BibTeX
@article{Yeilkaya2026,
  author = {Yeşilkaya, Ülke Balcı and Yeşilkaya, İlker},
  title = {Hierarchy Depth as a Data Curation Variable: Comparing Two and Three-Level Hierarchical Leiden Structures for LLM Fine-Tuning},
  journal = {Procedia Computer Science},
  year = {2026},
  volume = {292},
  pages = {1652--1661},
  doi = {10.1016/j.procs.2026.09.241}
}
Kostenlos starten →