Digitala Vetenskapliga Arkivet

Driftmeddelande
För närvarande är det driftstörningar. Felsökning pågår.
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
On bidirectional transitions between localist and distributed representations: The case of common substrings search using Vector Symbolic Architecture
Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.ORCID-id: 0000-0002-6032-6155
Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.ORCID-id: 0000-0003-0069-640X
2014 (Engelska)Ingår i: Procedia Computer Science, E-ISSN 1877-0509, Vol. 41, s. 104-113Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

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.

Ort, förlag, år, upplaga, sidor
Elsevier , 2014. Vol. 41, s. 104-113
Nationell ämneskategori
Datavetenskap (datalogi)
Forskningsämne
Kommunikations- och beräkningssystem
Identifikatorer
URN: urn:nbn:se:ltu:diva-15592DOI: 10.1016/j.procs.2014.11.091ISI: 000361488600014Scopus ID: 2-s2.0-84939250548Lokalt ID: f200757d-c493-4d45-af4f-2c61f85a73e8OAI: oai:DiVA.org:ltu-15592DiVA, id: diva2:988566
Konferens
International Conference on Biologically Inspired Cognitive Architectures : Fifth Annual Meeting of the BICA Society 07/11/2014 - 09/11/2014
Anmärkning
Validerad; 2015; Nivå 2; 20140824 (denkle)Tillgänglig från: 2016-09-29 Skapad: 2016-09-29 Senast uppdaterad: 2025-10-21Bibliografiskt granskad
Ingår i avhandling
1. Vector Symbolic Architectures and their applications: Computing with random vectors in a hyperdimensional space
Öppna denna publikation i ny flik eller fönster >>Vector Symbolic Architectures and their applications: Computing with random vectors in a hyperdimensional space
2018 (Engelska)Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
Alternativ titel[sv]
Vektor symboliska Arkitekturer och deras tillämpningar : Beräkning med slumpmässiga vektorer i ett hyperdimensionellt utrymme
Abstract [en]

The main focus of this thesis lies in a rather narrow subfield of Artificial Intelligence. As any beloved child, it has many names. The most common ones are Vector Symbolic Architectures and Hyperdimensional Computing. Vector Symbolic Architectures are a family of bio-inspired methods of representing and manipulating concepts and their meanings in a high-dimensional space (hence Hyperdimensional Computing). Information in Vector Symbolic Architectures is evenly distributed across representational units, therefore, it is said that they operate with distributed representations. Representational units can be of different nature, however, the thesis concentrates on the case when units have either binary or integer values. 

This thesis includes eleven scientific papers and extends the research area in three directions: theory of Vector Symbolic Architectures, their applications for pattern recognition, and unification of Vector Symbolic Architectures with other neural-like computational approaches. 

Previously, Vector Symbolic Architectures have been used mainly in the area of cognitive computing for representing and reasoning upon semantically bound information, for example, for analogy-based reasoning. This thesis significantly extends the applicability of Vector Symbolic Architectures to an area of pattern recognition. Pattern recognition is the area constantly enlarging its theoretical and practical horizons. Applications of pattern recognition and machine learning can be found in many areas of the present day world including health-care, robotics, manufacturing, economics, automation, transportation, etc. Despite the success in many domains pattern recognition algorithms are still far from being close to their biological vis-a-vis – the brain. In particular, one of the challenges is a large amount of training data required by conventional machine learning algorithms. Therefore, it is important to look for new possibilities in the area via exploring biologically inspired approaches.

All application scenarios, which are considered in the thesis, contribute to the development of the global strategy of creating an information society. Specifically, such important applications as biomedical signal processing, automation systems, and text processing were considered. All applications scenarios used novel methods of mapping data to Vector Symbolic Architectures proposed in the thesis.

In the domain of biomedical signal processing, Vector Symbolic Architectures were applied for three tasks: classification of a modality of medical images, gesture recognition, and assessment of synchronization of cardiovascular signals. In the domain of automation systems, Vector Symbolic Architectures were used for a data-driven fault isolation. In the domain of text processing, Vector Symbolic Architectures were used to search for the longest common substring and to recognize permuted words.

The theoretical contributions of the thesis come in four aspects. First, the thesis proposes several methods for mapping data from its original representation into a distributed representation suitable for further manipulations by Vector Symbolic Architectures. These methods can be used for one-shot learning of patterns of generic sensor stimuli. Second, the thesis presents the analysis of an informational capacity of Vector Symbolic Architectures in the case of binary distributed representations. Third, it is shown how to represent finite state automata using Vector Symbolic Architectures. Fourth, the thesis describes the approach of combining Vector Symbolic Architectures and a cellular automaton.

Finally, the thesis presents the results of unification of two computational approaches with Vector Symbolic Architectures. This is one of the most interesting cross-disciplinary contributions of the thesis. First, it is shown that Bloom Filters – an important data structure for an approximate membership query task – can be treated in terms of Vector Symbolic Architectures. It allows generalizing the process of building the filter. Second, Vector Symbolic Architectures and Echo State Networks (a special kind of recurrent neural networks) were combined together. It is possible to implement Echo State Networks using only integer values in network’s units and much simpler operation for a recurrency operation while preserving the entire dynamics of the network. It results in a simpler architecture with lower requirements on memory and operations. 

Ort, förlag, år, upplaga, sidor
Luleå: Luleå University of Technology, 2018
Serie
Doctoral thesis / Luleå University of Technology 1 jan 1997 → …, ISSN 1402-1544
Nationell ämneskategori
Annan elektroteknik och elektronik Datorsystem Datavetenskap (datalogi)
Forskningsämne
Kommunikations- och beräkningssystem
Identifikatorer
urn:nbn:se:ltu:diva-68338 (URN)978-91-7790-110-5 (ISBN)978-91-7790-111-2 (ISBN)
Disputation
2018-06-11, A109, Luleå, 10:00 (Engelska)
Opponent
Handledare
Forskningsfinansiär
Vetenskapsrådet, 2015-04677
Tillgänglig från: 2018-04-16 Skapad: 2018-04-13 Senast uppdaterad: 2025-10-22Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextScopus

Sök vidare i DiVA

Av författaren/redaktören
Kleyko, DenisOsipov, Evgeny
Av organisationen
Datavetenskap
I samma tidskrift
Procedia Computer Science
Datavetenskap (datalogi)

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 295 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf