Szczegóły publikacji
Opis bibliograficzny
Structural properties of associative knowledge graphs / Janusz A. Starzyk, Przemysław Stokłosa, Adrian HORZYK, Paweł Raif // W: Neural Information Processing : 30th International Conference, ICONIP 2023 : Changsha, China, November 20–23, 2023 : proceedings, Pt. 4 / eds. Biao Luo, [et al.]. — Singapore : Springer Nature Singapore, cop. 2024. — (Lecture Notes in Computer Science ; ISSN 0302-9743 ; vol. 14450). — ISBN: 978-981-99-8069-7; e-ISBN: 978-981-99-8070-3. — S. 326–339. — Bibliogr., Abstr. — Publikacja dostępna online od: 2023-11-15
Autorzy (4)
- Starzyk Janusz A.
- Stokłosa Przemysław
- AGHHorzyk Adrian
- Raif Paweł
Słowa kluczowe
Dane bibliometryczne
ID BaDAP | 150912 |
---|---|
Data dodania do BaDAP | 2024-02-01 |
DOI | 10.1007/978-981-99-8070-3_25 |
Rok publikacji | 2024 |
Typ publikacji | materiały konferencyjne (aut.) |
Otwarty dostęp | |
Wydawca | Springer |
Konferencja | International Conference on Neural Information Processing |
Czasopismo/seria | Lecture Notes in Computer Science |
Abstract
This paper introduces a novel structural approach to constructing associative knowledge graphs. These graphs are composed of many overlapping scenes, with each scene representing a specific set of objects. In the knowledge graph, each scene is represented as a complete subgraph associating scene objects. Knowledge graph nodes represent various objects present within the scenes. The same object can appear in multiple scenes. The recreation of the stored scenes from the knowledge graph occurs through association with a given context, which includes some of the objects stored in the graph. The memory capacity of the system is determined by the size of the graph and the density of its synaptic connections. Theoretical dependencies are derived to describe both the critical graph density and the memory capacity of scenes stored in such graphs. The critical graph density represents the maximum density at which it is possible to reproduce all elements of the scene without errors.