Learning and generalizing finite state automata using higher-order recurrent neural networks

Download
056892.pdf
1996
Boyacı, Onur
Show full item record
85
views
0
downloads
https://hdl.handle.net/11511/11702
Graduate School of Natural and Applied Sciences, Thesis

Suggestions

LEARNING COMPLEX EVENT MODELS USING MARKOV LOGIC NETWORKS
Kardas, Karani; Ulusoy, İlkay; Cicekli, Nihan Kesim (2013-07-19)
An event model learning framework is proposed for indoor and outdoor surveillance applications in order to decrease human intervention in the modeling process. The resulting framework makes event detection and recognition flexible, domain and scene independent. A set of predicate types is introduced which define basic spatio-temporal relations and interactions between objects and people in the videos. A set of policies to choose the appropriate predicates is proposed for the event learning process. First, t...
Learning Smooth Pattern Transformation Manifolds
Vural, Elif (2013-04-01)
Manifold models provide low-dimensional representations that are useful for processing and analyzing data in a transformation-invariant way. In this paper, we study the problem of learning smooth pattern transformation manifolds from image sets that represent observations of geometrically transformed signals. To construct a manifold, we build a representative pattern whose transformations accurately fit various input images. We examine two objectives of the manifold-building problem, namely, approximation a...
Learning Graph Signal Representations with Narrowband Spectral Kernels
Kar, Osman Furkan; Turhan, Gülce; Vural, Elif (2022-01-01)
In this work, we study the problem of learning graph dictionary models from partially observed graph signals. We represent graph signals in terms of atoms generated by narrowband graph kernels. We formulate an optimization problem where the kernel parameters are learnt jointly with the signal representations under a triple regularization scheme: While the first regularization term aims to control the spectrum of the narrowband kernels, the second term encourages the reconstructed graph signals to vary smoot...
Learning by optimization in random neural networks
Atalay, Mehmet Volkan (1998-10-28)
The random neural network model proposed by Gelenbe has a number of interesting features in addition to a well established theory. Gelenbe has also developed a learning algorithm for the recurrent random network model using gradient descent of a quadratic error function. We present a quadratic optimization approach for learning in the random neural network, particularly for image texture reconstruction.
Learning semi-supervised nonlinear embeddings for domain-adaptive pattern recognition
Vural, Elif (null; 2019-05-20)
We study the problem of learning nonlinear data embeddings in order to obtain representations for efficient and domain-invariant recognition of visual patterns. Given observations of a training set of patterns from different classes in two different domains, we propose a method to learn a nonlinear mapping of the data samples from different domains into a common domain. The nonlinear mapping is learnt such that the class means of different domains are mapped to nearby points in the common domain in order to...
Citation Formats
O. Boyacı, “Learning and generalizing finite state automata using higher-order recurrent neural networks,” Middle East Technical University, 1996.
METU IIS - Integrated Information Service open@metu.edu.tr