EUVIMEDEUVIMED entdecken
Crossref

Robust Trust Optimization in Social Graphs: Centrality-Aware GNNs with Genetic Optimization

Aseel Hussein

Alkadhim Journal for Computer Science · 2026

DOI: 10.61710/ahabcz81 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Alkadhim Journal for Computer Science, 2026. Verfasst von Aseel Hussein. Die Arbeit nennt 27 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Precisely evaluating trust inside social networks is essential for recognizing reliable users amid chaotic and varied interactions. This research introduces a triadic hybrid model that integrates structural centrality measures, a Centrality-Aware Graph Attention Network (CA-GAT), and Genetic Algorithm (GA) optimization. At the outset, centrality metrics degree, closeness, betweenness, eigenvector, and PageRank are standardized and integrated to produce a comprehensible initial structural trust measure. Upon application to a processed graph derived from Epinions data, which consists of 4,039 nodes and 76,879 edges, the most robust individual centrality baseline attained an ROC-AUC of 0.67. The CA-GAT model improved the structural depiction and elevated the ROC-AUC to 0.83, thereby pinpointing 3,360 nodes that exceeded the trust threshold. Following this, a GA-driven optimization phase further refined the final selection of reliable nodes, identifying 3,005 nodes and elevating the ROC-AUC to 0.85. Ablation ana

Zitieren

APA

Hussein, A. (2026). Robust Trust Optimization in Social Graphs: Centrality-Aware GNNs with Genetic Optimization. Alkadhim Journal for Computer Science. https://doi.org/10.61710/ahabcz81

Vancouver

Hussein A. Robust Trust Optimization in Social Graphs: Centrality-Aware GNNs with Genetic Optimization. Alkadhim Journal for Computer Science. 2026. doi:10.61710/ahabcz81

BibTeX
@article{Hussein2026,
  author = {Hussein, Aseel},
  title = {Robust Trust Optimization in Social Graphs: Centrality-Aware GNNs with Genetic Optimization},
  journal = {Alkadhim Journal for Computer Science},
  year = {2026},
  doi = {10.61710/ahabcz81}
}
Kostenlos starten →