Publication:
Construction of a learning automaton for cycle detection in noisy data sequences

dc.contributor.authorsUstimov A., Tümer B.
dc.date.accessioned2022-03-15T01:54:57Z
dc.date.accessioned2026-01-11T08:20:27Z
dc.date.available2022-03-15T01:54:57Z
dc.date.issued2005
dc.description.abstractThis paper investigates the problem of cycle detection in periodic noisy data sequences. Our approach is based on reinforcement learning principles. A constructive approach is used to devise a variable structure learning automaton (VSLA) that becomes capable of recognizing the potential cycles of the noisy input sequence. The constructive approach allows for VSLAs to analyze sequences not requiring a priori information about their cycle and noise. Consecutive tokens of the input sequence are presented to VSLA, one at a time, where VSLA uses data's syntactic property to construct itself from a single state at the beginning to a topology that is able to recognize an unknown cycle of the given data. The main strength of this approach is applicability in many fields and high recognition rates. © Springer-Verlag Berlin Heidelberg 2005.
dc.identifier.doi10.1007/11569596_57
dc.identifier.isbn3540294147; 9783540294146
dc.identifier.issn3029743
dc.identifier.urihttps://hdl.handle.net/11424/246643
dc.language.isoeng
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.titleConstruction of a learning automaton for cycle detection in noisy data sequences
dc.typeconferenceObject
dspace.entity.typePublication
oaire.citation.endPage552
oaire.citation.startPage543
oaire.citation.titleLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
oaire.citation.volume3733 LNCS

Files