Szczegóły publikacji

Opis bibliograficzny

Associative pattern matching and inference using associative graph data structures / Adrian HORZYK, Agata Czajkowska // W: Artificial Intelligence and Soft Computing : 18th International conference, ICAISC 2019 : Zakopane, Poland, June 16-20 2019 : proceedings, Pt. 2 / eds. Leszek Rutkowski, Rafał Scherer, Marcin Korytkowski, Witold Pedrycz, Ryszard Tadeusiewicz, Jacek M. Zurada. — Cham : Springer, cop. 2019. — (Lecture Notes in Computer Science ; ISSN 0302-9743. Lecture Notes in Artificial Intelligence ; LNAI 11509). — ISBN: 978-3-030-20914-8; e-ISBN: 978-3-030-20915-5. — S. 371-383. — Bibliogr. s. 382-383, Abstr.

Autorzy (2)

Słowa kluczowe

associative pattern matchingneural networksdata accessbig dataassociative graph data structuresAVB+treesassociative inference

Dane bibliometryczne

ID BaDAP123146
Data dodania do BaDAP2019-07-23
Tekst źródłowyURL
DOI10.1007/978-3-030-20915-5_34
Rok publikacji2019
Typ publikacjimateriały konferencyjne (aut.)
Otwarty dostęptak
WydawcaSpringer
KonferencjaInternational Conference on Artificial Intelligence and Soft Computing 2019
Czasopismo/seriaLecture Notes in Computer Science

Abstract

Inference on the still growing amount of data is a challenging problem that must be solved to operate efficiently and mine Big Data sources successfully and in a sensible time. This paper introduces a new inference method based on associative recalling of data and their relationships stored in associative graph data structures (AGDS) used for pattern matching for given criteria. These structures represent a richer set of relationships than popular tabular structures do because of their natural limitations. They recall relationships and related data faster than the time-consuming search algorithms based on many loops and conditions on tabular structures. It explains why brain processes trigger information so quickly, outperforming solution based on the Turing Machine and contemporary fast processors. The presented associative inference can work in constant time thanks to the specific data organization, access and direct representation of more relationships in AGDS structures than in the commonly used tabular structures. © Springer Nature Switzerland AG 2019.

Publikacje, które mogą Cię zainteresować

fragment książki
#164450Data dodania: 22.1.2026
Efficiently parallelized associative inference of associative graph data neural networks / Adam SZRETER, Adrian HORZYK // W: Artificial Intelligence and Soft Computing : 24th International Conference, ICAISC 2025 : Zakopane, Poland, June 22–26, 2025 : proceedings , Pt. 3 / eds. Leszek Rutkowski, Rafał Scherer, Marcin Korytkowski, Witold Pedrycz, Ryszard Tadeusiewicz, Jacek M. Zurada. — Cham : Springer Nature Switzerland, cop. 2026. — ( Lecture Notes in Computer Science ; ISSN  0302-9743. Lecture Notes in Artificial Intelligence ; 15950 ). — ISBN: 978-3-032-03710-7; e-ISBN: 978-3-032-03711-4. — S. 339–352. — Bibliogr., Abstr. — Publikacja dostępna online od: 2025-11-01
fragment książki
#116030Data dodania: 2.10.2018
Associative graph data structures with an efficient access via AVB+trees / Adrian HORZYK // W: 2018 11th International conference on Human System Interaction (HSI) [Dokument elektroniczny] : July 4–6 2018, Gdańsk : conference proceedings / eds. Adam Bujnowski, Mariusz Kaczmarek, Jacek Rumiński. — Wersja do Windows. — Dane tekstowe. — [Piscataway] : IEEE, 2018. — Dod. USB ISBN 978-1-5386-5023-3. — ISBN: 978-1-5386-5025-7; e-ISBN: 978-1-5386-5024-0. — S. 169–175. — Wymagania systemowe: Adobe Reader. — Bibliogr. s. 175, Abstr.