Работы, цитирующие эту работу

Работ: 2

Работа: Modeling Relation Paths for Knowledge Graph Completion

1. An efficient framework for obtaining the initial cluster centers

   B. K. Mishra, Sachi Nandan Mohanty, Ritik R. Baidyanath +5

   СтатьяAdvanced Clustering Algorithms ResearchScientific Reports2023Цитирований: 0

   ABIABI:AkademIndex/openalex/2023.article.002129

2. On topological indices of third type of hex-derived networks

   Haidar Ali, Didar Abdulkhaleq Ali, Fareeha Liaqat +5

   СтатьяComputational Drug Discovery MethodsJournal of Mathematical Chemistry2023Цитирований: 0

   ABIABI:AkademIndex/openalex/2023.article.011985