Sökning: onr:"swepub:oai:DiVA.org:ltu-15592" >
On bidirectional tr...
On bidirectional transitions between localist and distributed representations : The case of common substrings search using Vector Symbolic Architecture
-
- Kleyko, Denis (författare)
- Luleå tekniska universitet,Datavetenskap
-
- Osipov, Evgeny (författare)
- Luleå tekniska universitet,Datavetenskap
-
(creator_code:org_t)
- Elsevier BV, 2014
- 2014
- Engelska.
-
Ingår i: Procedia Computer Science. - : Elsevier BV. - 1877-0509. ; 41, s. 104-113
- Relaterad länk:
-
https://doi.org/10.1...
-
visa fler...
-
https://urn.kb.se/re...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- The contribution of this article is twofold. First, it presents an encoding approach for seamless bidirectional transitions between localist and distributed representation domains. Second, the approach is demonstrated on the example of using Vector Symbolic Architecture for solving a problem of finding common substrings. The proposed algorithm uses elementary operations on long binary vectors. For the case of two patterns with respective lengths L1 and L2 it requires Θ(L1 + L2 – 1) operations on binary vectors, which is equal to the suffix trees approach – the fastest algorithm for this problem. The simulation results show that in order to be robustly detected by the proposed approach the length of a common substring should be more than 4% of the longest pattern.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Nyckelord
- Dependable Communication and Computation Systems
- Kommunikations- och beräkningssystem
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas