Дисертації з теми "Neural Sequence Models"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-30 дисертацій для дослідження на тему "Neural Sequence Models".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Kann, Katharina [Verfasser], and Hinrich [Akademischer Betreuer] Schütze. "Neural sequence-to-sequence models for low-resource morphology / Katharina Kann ; Betreuer: Hinrich Schütze." München : Universitätsbibliothek der Ludwig-Maximilians-Universität, 2019. http://d-nb.info/1192663276/34.
Повний текст джерелаKhouzam, Bassem. "Neural networks as cellular computing models for temporal sequence processing." Thesis, Supélec, 2014. http://www.theses.fr/2014SUPL0007/document.
Повний текст джерелаThe thesis proposes a sequence learning approach that uses the mechanism of fine grain self-organization. The manuscript initially starts by situating this effort in the perspective of contributing to the promotion of cellular computing paradigm in computer science. Computation within this paradigm is divided into a large number of elementary calculations carried out in parallel by computing cells, with information exchange between them.In addition to their fine grain nature, the cellular nature of such architectures lies in the spatial topology of the connections between cells that complies with to the constraints of the technological evolution of hardware in the future. In the manuscript, most of the distributed architecture known in computer science are examined following this perspective, to find that very few of them fall within the cellular paradigm.We are interested in the learning capacity of these architectures, because of the importance of this notion in the related domain of neural networks for example, without forgetting, however, that cellular systems are complex dynamical systems by construction.This inevitable dynamical component has motivated our focus on the learning of temporal sequences, for which we reviewed the different models in the domains of neural networks and self-organization maps.At the end, we proposed an architecture that contributes to the promotion of cellular computing in the sense that it exhibits self-organization properties employed in the extraction of a representation of a dynamical system states that provides the architecture with its entries, even if the latter are ambiguous such that they partially reflect the system state. We profited from an existing supercomputer to simulate complex architecture, that indeed exhibited a new emergent behavior. Based on these results we pursued a critical study that sets the perspective for future work
Cherla, S. "Neural probabilistic models for melody prediction, sequence labelling and classification." Thesis, City, University of London, 2016. http://openaccess.city.ac.uk/17444/.
Повний текст джерелаSarabi, Zahra. "Revealing the Positive Meaning of a Negation." Thesis, University of North Texas, 2019. https://digital.library.unt.edu/ark:/67531/metadc1505158/.
Повний текст джерелаRehn, Martin. "Aspects of memory and representation in cortical computation." Doctoral thesis, KTH, Numerisk Analys och Datalogi, NADA, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4161.
Повний текст джерелаIn this thesis I take a modular approach to cortical function. I investigate how the cerebral cortex may realise a number of basic computational tasks, within the framework of its generic architecture. I present novel mechanisms for certain assumed computational capabilities of the cerebral cortex, building on the established notions of attractor memory and sparse coding. A sparse binary coding network for generating efficient representations of sensory input is presented. It is demonstrated that this network model well reproduces the simple cell receptive field shapes seen in the primary visual cortex and that its representations are efficient with respect to storage in associative memory. I show how an autoassociative memory, augmented with dynamical synapses, can function as a general sequence learning network. I demonstrate how an abstract attractor memory system may be realised on the microcircuit level -- and how it may be analysed using tools similar to those used experimentally. I outline some predictions from the hypothesis that the macroscopic connectivity of the cortex is optimised for attractor memory function. I also discuss methodological aspects of modelling in computational neuroscience.
QC 20100916
Svensk, Gustav. "TDNet : A Generative Model for Taxi Demand Prediction." Thesis, Linköpings universitet, Programvara och system, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-158514.
Повний текст джерелаTaylor, Neill Richard. "Neural models of temporal sequences." Thesis, King's College London (University of London), 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.300844.
Повний текст джерелаCalvert, David. "A distance-based neural network model for sequence processing." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape17/PQDD_0010/NQ30591.pdf.
Повний текст джерелаSchmidle, Wolfgang. "A model of neural sequence detectors for sentence processing." Thesis, University of Sunderland, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.439973.
Повний текст джерелаHuang, Yiming. "Phoneme Recognition Using Neural Network and Sequence Learning Model." Ohio University / OhioLINK, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1236027180.
Повний текст джерелаVasa, Suresh. "A spiking neural model for flexible representation and recall of cognitive response sequences." University of Cincinnati / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1305893537.
Повний текст джерелаMeader, Stephen. "Application of the Neutral Indel Model to genome sequences for diverse metazoans." Thesis, University of Oxford, 2010. http://ora.ox.ac.uk/objects/uuid:18f8c5fc-28f2-4d5e-aa87-c1086582213c.
Повний текст джерелаMeenakshisundaram, Venkatesh. "ELUCIDATING PHYSICS OF SEQUENCE-SPECIFIC POLYMERS AND THE GLASS TRANSITION VIA EVOLUTIONARY COMPUTATIONAL DESIGN." University of Akron / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=akron1513717453745275.
Повний текст джерелаWestkott, Maren [Verfasser], Klaus [Akademischer Betreuer] [Gutachter] Pawelzik, and Stefan [Gutachter] Bornholdt. "Neuronal Models of Motor Sequence Learning in the Songbird / Maren Westkott. Betreuer: Klaus Pawelzik. Gutachter: Klaus Pawelzik ; Stefan Bornholdt." Bremen : Staats- und Universitätsbibliothek Bremen, 2016. http://d-nb.info/1100604014/34.
Повний текст джерелаHolcner, Jonáš. "Strojový překlad pomocí umělých neuronových sítí." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2018. http://www.nusl.cz/ntk/nusl-386020.
Повний текст джерелаEspaña, Boquera Salvador. "Contributions to the joint segmentation and classification of sequences (My two cents on decoding and handwriting recognition)." Doctoral thesis, Universitat Politècnica de València, 2016. http://hdl.handle.net/10251/62215.
Повний текст джерела[ES] Este trabajo se centra en problemas (como reconocimiento automático del habla (ASR) o de escritura manuscrita (HTR)) que cumplen: 1) pueden representarse (quizás aproximadamente) en términos de secuencias unidimensionales, 2) su resolución implica descomponer la secuencia en segmentos que se pueden clasificar en un conjunto finito de unidades. Las tareas de segmentación y de clasificación necesarias están tan intrínsecamente interrelacionadas ("paradoja de Sayre") que deben realizarse conjuntamente. Nos hemos inspirado en lo que algunos autores denominan "La trilogía exitosa", refereido a la sinergia obtenida cuando se tiene: - un buen formalismo, que dé lugar a buenos algoritmos; - un diseño e implementación ingeniosos y eficientes, que saquen provecho de las características del hardware; - no descuidar el "saber hacer" de la tarea, un buen preproceso y el ajuste adecuado de los diversos parámetros. Describimos y estudiamos "modelos generativos en dos etapas" sin reordenamientos (TSGMs), que incluyen no sólo los modelos ocultos de Markov (HMM), sino también modelos segmentales (SMs). Se puede obtener un decodificador de "dos pasos" considerando a la inversa un TSGM introduciendo no determinismo: 1) se genera un grafo acíclico dirigido (DAG) y 2) se utiliza conjuntamente con un modelo de lenguaje (LM). El decodificador de "un paso" es un caso particular. Se formaliza el proceso de decodificación con ecuaciones de lenguajes y semianillos, se propone el uso de redes de transición recurrente (RTNs) como forma normal de gramáticas de contexto libre (CFGs) y se utiliza el paradigma de análisis por composición de manera que el análisis de CFGs resulta una extensión del análisis de FSA. Se proponen algoritmos de composición de transductores que permite el uso de RTNs y que no necesita recurrir a composición de filtros incluso en presencia de transiciones nulas y semianillos no idempotentes. Se propone una extensa revisión de LMs y algunas contribuciones relacionadas con su interfaz, con su representación y con la evaluación de LMs basados en redes neuronales (NNLMs). Se ha realizado una revisión de SMs que incluye SMs basados en combinación de modelos generativos y discriminativos, así como un esquema general de tipos de emisión de tramas y de SMs. Se proponen versiones especializadas del algoritmo de Viterbi para modelos de léxico y que manipulan estados activos sin recurrir a estructuras de tipo diccionario, sacando provecho de la caché. Se ha propuesto una arquitectura "dataflow" para obtener reconocedores a partir de un pequeño conjunto de piezas básicas con un protocolo de serialización de DAGs. Describimos generadores de DAGs que pueden tener en cuenta restricciones sobre la segmentación, utilizar modelos segmentales no limitados a HMMs, hacer uso de los decodificadores especializados propuestos en este trabajo y utilizar un transductor de control que permite el uso de unidades dependientes del contexto. Los decodificadores de DAGs hacen uso de un interfaz bastante general de LMs que ha sido extendido para permitir el uso de RTNs. Se proponen también mejoras para reconocedores "un paso" basados en algoritmos especializados para léxicos y en la interfaz de LMs en modo "bunch", así como su paralelización. La parte experimental está centrada en HTR en diversas modalidades de adquisición (offline, bimodal). Hemos propuesto técnicas novedosas para el preproceso de escritura que evita el uso de heurísticos geométricos. En su lugar, utiliza redes neuronales. Se ha probado con HMMs hibridados con redes neuronales consiguiendo, para la base de datos IAM, algunos de los mejores resultados publicados. También podemos mencionar el uso de información de sobre-segmentación, aproximaciones sin restricción de un léxico, experimentos con datos bimodales o la combinación de HMMs híbridos con reconocedores de tipo holístico.
[CAT] Aquest treball es centra en problemes (com el reconeiximent automàtic de la parla (ASR) o de l'escriptura manuscrita (HTR)) on: 1) les dades es poden representar (almenys aproximadament) mitjançant seqüències unidimensionals, 2) cal descompondre la seqüència en segments que poden pertanyer a un nombre finit de tipus. Sovint, ambdues tasques es relacionen de manera tan estreta que resulta impossible separar-les ("paradoxa de Sayre") i s'han de realitzar de manera conjunta. Ens hem inspirat pel que alguns autors anomenen "trilogia exitosa", referit a la sinèrgia obtinguda quan prenim en compte: - un bon formalisme, que done lloc a bons algorismes; - un diseny i una implementació eficients, amb ingeni, que facen bon us de les particularitats del maquinari; - no perdre de vista el "saber fer", emprar un preprocés adequat i fer bon us dels diversos paràmetres. Descrivim i estudiem "models generatiu amb dues etapes" sense reordenaments (TSGMs), que inclouen no sols inclouen els models ocults de Markov (HMM), sinò també models segmentals (SM). Es pot obtindre un decodificador "en dues etapes" considerant a l'inrevés un TSGM introduint no determinisme: 1) es genera un graf acíclic dirigit (DAG) que 2) és emprat conjuntament amb un model de llenguatge (LM). El decodificador "d'un pas" en és un cas particular. Descrivim i formalitzem del procés de decodificació basada en equacions de llenguatges i en semianells. Proposem emprar xarxes de transició recurrent (RTNs) com forma normal de gramàtiques incontextuals (CFGs) i s'empra el paradigma d'anàlisi sintàctic mitjançant composició de manera que l'anàlisi de CFGs resulta una lleugera extensió de l'anàlisi de FSA. Es proposen algorismes de composició de transductors que poden emprar RTNs i que no necessiten recorrer a la composició amb filtres fins i tot amb transicions nul.les i semianells no idempotents. Es proposa una extensa revisió de LMs i algunes contribucions relacionades amb la seva interfície, amb la seva representació i amb l'avaluació de LMs basats en xarxes neuronals (NNLMs). S'ha realitzat una revisió de SMs que inclou SMs basats en la combinació de models generatius i discriminatius, així com un esquema general de tipus d'emissió de trames i altre de SMs. Es proposen versions especialitzades de l'algorisme de Viterbi per a models de lèxic que permeten emprar estats actius sense haver de recórrer a estructures de dades de tipus diccionari, i que trauen profit de la caché. S'ha proposat una arquitectura de flux de dades o "dataflow" per obtindre diversos reconeixedors a partir d'un xicotet conjunt de peces amb un protocol de serialització de DAGs. Descrivim generadors de DAGs capaços de tindre en compte restriccions sobre la segmentació, emprar models segmentals no limitats a HMMs, fer us dels decodificadors especialitzats proposats en aquest treball i emprar un transductor de control que permet emprar unitats dependents del contexte. Els decodificadors de DAGs fan us d'una interfície de LMs prou general que ha segut extesa per permetre l'ús de RTNs. Es proposen millores per a reconeixedors de tipus "un pas" basats en els algorismes especialitzats per a lèxics i en la interfície de LMs en mode "bunch", així com la seua paral.lelització. La part experimental està centrada en el reconeiximent d'escriptura en diverses modalitats d'adquisició (offline, bimodal). Proposem un preprocés d'escriptura manuscrita evitant l'us d'heurístics geomètrics, en el seu lloc emprem xarxes neuronals. S'han emprat HMMs hibridats amb xarxes neuronals aconseguint, per a la base de dades IAM, alguns dels millors resultats publicats. També podem mencionar l'ús d'informació de sobre-segmentació, aproximacions sense restricció a un lèxic, experiments amb dades bimodals o la combinació de HMMs híbrids amb classificadors holístics.
España Boquera, S. (2016). Contributions to the joint segmentation and classification of sequences (My two cents on decoding and handwriting recognition) [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/62215
TESIS
Premiado
Pandiscia, Nicola. "Analisi di sequenze video per rilevazioni demografiche ed emotive da software su microcontroller." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2020.
Знайти повний текст джерелаNováčik, Tomáš. "Rekurentní neuronové sítě pro rozpoznávání řeči." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2016. http://www.nusl.cz/ntk/nusl-255371.
Повний текст джерелаLu, Peng. "Empirical study and multi-task learning exploration for neural sequence labeling models." Thèse, 2019. http://hdl.handle.net/1866/22530.
Повний текст джерелаSoliman, Zakaria. "Predictive models for career progression." Thèse, 2018. http://hdl.handle.net/1866/21286.
Повний текст джерелаLian, Chi-Li, and 連崔立. "Using Probabilistic Neural Networks and Binary Sequence Algorithm to Build Financial Prediction Models - A Case of the Electronic Industry in Taiwan." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/3t54vc.
Повний текст джерела國立臺北科技大學
工業工程與管理研究所
96
This research attempts to use probabilistic neural networks(PNN) and binary sequence algorithm(BSA) to build financial prediction models, regard listed company as the research object, take three annual financial materials of company. The main purpose to build this financial prediction models, lie in finding the potential financial crisis inside enterprises ahead of time, offer investors and electronic industry one to consult alert news by this. This research is divided into two stages and built the model, the first stage is to use two kinds of data type and four kinds of period to build financial classification model, elect the best model to produce the classifying value, The second stage is to rise from these classifying value prediction pattern through BSA, predicting via these prediction patterns. Looked by the real example result, with appropriate prediction pattern, can offer better prediction result.
Dragomir, Andrei. "Discovery of gene interactions in regulatory networks using genomic data mining and computational intelligence methods." Thesis, 2006. http://nemertes.lis.upatras.gr/jspui/handle/10889/1176.
Повний текст джерелаH έλευση ικανών υπολογιστικών εργαλείων για την μελέτη της γενομικής ακολουθίας και της ερευνητικής βιοτεχνολογίας υψηλής ανάλυσης, οδήγησε σε μια τεράστια πρόοδο στις επιστήμες ζωής. Μεταξύ των πιο σημαντικών καινοτομιών είναι η τεχνολογία μικροσυστοιχιών. H τεχνολογία αυτή επιτρέπει την ποσοτικοποίηση της έκφρασης χιλιάδων γονιδίων ταυτόχρονα, μετρώντας τον υβριδισμό από έναν ιστό ενδιαφέροντος έως σε δείγματα σε μικρό γυαλί η σε πλαστικά τσιπ. Πριν ξεκινήσουμε την έρευνα πάνω στις μικροσυστοιχίες είναι σημαντικό να θυμόμαστε ότι τα χαρακτηριστικά των δεδομένων αυτής περιλαμβάνουν αρκετό ποσό θορύβου και ένα μη τυπικό αριθμό διαστάσεων (το οποίο καθιστά δύσκολη την χρήση κλασσικών στατιστικών μεθόδων – μέγεθος δείγματος σε δωδεκάδες και μέγεθος χαρακτηριστικών σε χιλιάδες η δεκάδες η εκατοντάδες). Επομένως, ο κύριος στόχος αυτής της διδακτορικής εργασίας είναι η ανάπτυξη ικανών υπολογιστικών μεθόδων και αλγόριθμων έτσι ώστε να εξάγουν πολύτιμη βιολογική γνώση από τον συγκεκριμένο τύπο δεδομένων. Εφαρμογές της τεχνολογίας μικροσυστοιχιών σαν ένα εργαλείο για την ανάλυση έκφρασης γονιδίων ξεκινούν από την εύρεση και απόδοση λειτουργικών κατηγοριών για γονίδια άγνωστης βιολογικής λειτουργικότητας (βασισμένη στην ανάλυση των γονιδίων ήδη εδραιωμένου βιολογικού ρόλου) έως την ακριβή και πρώιμη διάγνωση διαφορετικών κακοήθων όγκων. Όμως ο κύριος στόχος της υπολογιστικής ανάλυσης της έκφρασης γονιδίων είναι η εξαγωγή ρυθμιζόμενης γνώσης στο γενετικό επίπεδο το οποίο μπορεί να χρησιμοποιηθεί ώστε να παρέχει μία ευρύτερη κατανόηση της λειτουργίας πολύπλοκων κυτταρικών συστημάτων. Σε αυτή την κατεύθυνση, το να αναδεικνύεις τις δομές ρυθμιστικών δικτύων βασισμένων στην έκφραση γονιδίων γίνεται καίριο έργο. Η διδακτορική διατριβή συνεισφέρει στο πλαίσιο για την ανακάλυψη βιολογικά λειτουργικών κατηγοριών γονιδίων βασισμένη στην συνεργία της ΙCA και της δυναμικού βασισμένου στη SOM ομαδοποίηση αλγορίθμου η οποία με ακρίβεια βρίσκει ομάδες γονιδίων που συν-ρυθμίζονται ενώ παράλληλα αναγνωρίζει ενδιαφέροντα ρυθμιστικά σήματα μέσα στα δεδομένα με τη βοήθεια της ΙCA αποδόμησης. Eπίσης, προσανατολιζόμαστε στην εύρεση του μοριακού χαρακτηρισμού διαφορετικών τύπων όγκων χρησιμοποιώντας το προφίλ της γονιδιακής έκφρασης, βασισμένο σε ένα σύνολο κατηγοριοποιητών οι οποίοι εκπαιδεύτηκαν σειριακά σε επανασταθμισμένες παραλλαγές των δεδομένων. Ο αλγόριθμος, γνωστός και σαν boosting, έχει προσαρμοστεί στις ιδιαιτερότητες των δεδομένων έκφρασης γονιδίου και εφαρμόζεται σε συνδυασμό με τα SVMs. Επιπλέον, εξετάζεται η πρωτοποριακή τεχνική της εύρεσης προβλέψιμων τιμών των οποίων οι υπογραφές είναι σημαντικές για τον χαρακτηρισμό φαινότυπου. Τελικά, η παρούσα διδακτορική διατριβή παρουσιάζει μια μέθοδο που αναπτύχθηκε για αντίστροφα μηχανικά ελεγχόμενα από γονίδια νευρωνικά δίκτυα βασισμένα σε αναδρομικά νευρωνικά δίκτυα τύπου fuzzy, τα οποία αξιοποιούν τα πλεονεκτήματα των μοντέλων τύπου fuzzy σε βάση επεξηγηματικότητας αποτελεσμάτων, και αυτών των νευρωνικών δικτύων σε βάση υπολογιστικής δύναμης και ικανότητας πρόβλεψης χρονοσειρών.
Lief, Eric. "Použití hlubokých kontextualizovaných slovních reprezentací založených na znacích pro neuronové sekvenční značkování." Master's thesis, 2019. http://www.nusl.cz/ntk/nusl-393167.
Повний текст джерелаYu-DeLin and 林宇德. "Text Analysis for Prediction of Bitcoin Price by Sequence Neural Network Model." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/r8hw6e.
Повний текст джерела國立成功大學
資訊工程學系
106
With the accelerated development of artificial intelligence, some people want to use it to predict market trends. Simultaneously, digital currency, headed by Bitcoin and Ethereum, caught people’s attention because of its soaring price in last year. The reputation of digital currency get higher and higher in social media and traditional media. People certainly hope to use AI to predict the digital currency market. In this research, we use Twitter posts as training data and vectored method to represent the tweet information (day vector) per day. After cleaning Twitter raw data, we converted the tweets in the giving day as day vector and feed the day vector to sequence to Sequence model use to predict the change of Bitcoin price. The entire system uses attention model in day vector model and the sequence to sequence model, respectively. The experiments show that the prediction accuracy rise slightly by increasing day vector dimension and the attention model of the SequenceDecoder model can significantly improve the accuracy. Finally, we analyzed the 7-day predicted results individually and found that the accuracy decrease when predicting latter day. This meet our understanding that it is harder to predict the latter day than the near day.
Zeid, Omar Mohamed. "Moving in time: a neural network model of rhythm-based motor sequence performance." Thesis, 2018. https://hdl.handle.net/2144/37992.
Повний текст джерелаAugust, David Adam. "Sequence learning by an integrate-and-fire neural network model of hippocampal area CA3 /." 1997. http://wwwlib.umi.com/dissertations/fullcit/9738815.
Повний текст джерелаBoulanger-Lewandowski, Nicolas. "Modeling High-Dimensional Audio Sequences with Recurrent Neural Networks." Thèse, 2014. http://hdl.handle.net/1866/11181.
Повний текст джерелаThis thesis studies models of high-dimensional sequences based on recurrent neural networks (RNNs) and their application to music and speech. While in principle RNNs can represent the long-term dependencies and complex temporal dynamics present in real-world sequences such as video, audio and natural language, they have not been used to their full potential since their introduction by Rumelhart et al. (1986a) due to the difficulty to train them efficiently by gradient-based optimization. In recent years, the successful application of Hessian-free optimization and other advanced training techniques motivated an increase of their use in many state-of-the-art systems. The work of this thesis is part of this development. The main idea is to exploit the power of RNNs to learn a probabilistic description of sequences of symbols, i.e. high-level information associated with observed signals, that in turn can be used as a prior to improve the accuracy of information retrieval. For example, by modeling the evolution of note patterns in polyphonic music, chords in a harmonic progression, phones in a spoken utterance, or individual sources in an audio mixture, we can improve significantly the accuracy of polyphonic transcription, chord recognition, speech recognition and audio source separation respectively. The practical application of our models to these tasks is detailed in the last four articles presented in this thesis. In the first article, we replace the output layer of an RNN with conditional restricted Boltzmann machines to describe much richer multimodal output distributions. In the second article, we review and develop advanced techniques to train RNNs. In the last four articles, we explore various ways to combine our symbolic models with deep networks and non-negative matrix factorization algorithms, namely using products of experts, input/output architectures, and generative frameworks that generalize hidden Markov models. We also propose and analyze efficient inference procedures for those models, such as greedy chronological search, high-dimensional beam search, dynamic programming-like pruned beam search and gradient descent. Finally, we explore issues such as label bias, teacher forcing, temporal smoothing, regularization and pre-training.
Elbita, Abdulhakim M., Rami S. R. Qahwaji, Stanley S. Ipson, Mhd Saeed Sharif, and Faruque Ghanchi. "Preparation of 2D sequences of corneal images for 3D model building." 2014. http://hdl.handle.net/10454/7730.
Повний текст джерелаA confocal microscope provides a sequence of images, at incremental depths, of the various corneal layers and structures. From these, medical practioners can extract clinical information on the state of health of the patient's cornea. In this work we are addressing problems associated with capturing and processing these images including blurring, non-uniform illumination and noise, as well as the displacement of images laterally and in the anterior posterior direction caused by subject movement. The latter may cause some of the captured images to be out of sequence in terms of depth. In this paper we introduce automated algorithms for classification, reordering, registration and segmentation to solve these problems. The successful implementation of these algorithms could open the door for another interesting development, which is the 3D modelling of these sequences.
Lin, Min-Chen, and 林旻蓁. "DNA Sequences Analysis of Single-Gene Disorders and Prediction Model Construction Based on Machine Learning and Convolutional Neural Networks." Thesis, 2019. http://ndltd.ncl.edu.tw/cgi-bin/gs32/gsweb.cgi/login?o=dnclcdr&s=id=%22107NCHU5396048%22.&searchmode=basic.
Повний текст джерела國立中興大學
資訊管理學系所
107
There are many types of single-gene disorders, which could affect a wide range of human bodies, include heart disease, metabolic abnormality, brain or neurological disorders, skin lesion, etc., and even lead to death. Nowadays, machine learning and deep learning techniques have been able to assist physicians in clinical diagnosis with objective and accurate advantages. In order to prevent diseases onset or from getting worse, these techniques could perform analysis of human genes and let patients to receive early treatment or adjust their habits of eating and living. NCBI GenBank database is applied to gather DNA sequences in this study. These sequences are transformed into global data and local data as inputs by multiple algorithms and tools. Convolutional Neural Networks, Naïve Bayes, Support Vector Machine, C4.5 algorithm and Random Forest are implemented to construct classification models of sequences of single-gene disorders. Performance of various models would be compared by validation indexes of confusion matrix. The experimental results show that when the global data is used as the input data, a higher classification effect could be obtained. Among all algorithms, Random Forest and Convolutional Neural Networks have the best performance with accuracy over 97%. Performances of other algorithms are sorted from best to worst in the following order: Naïve Bayes > C4.5 algorithm > Support Vector Machine. In the analysis of local data, the 10-second segmented audio signal images have the best classification effect in the Convolutional Neural Networks model with sensitivity 84.81%, F1 score 84.08%, MCC 82.64% and accuracy 84.28%. Multiple classification models of single-gene disorders are proposed in this study. The combination of algorithms and input data with best performance could be selected as a tool and direction for genetic disorders diagnosis and screening. This study expects that these classification models could assist physicians in clinical diagnosis of single-gene disorders and as a research basis of bioinformatics.
Xu, Kelvin. "Exploring Attention Based Model for Captioning Images." Thèse, 2017. http://hdl.handle.net/1866/20194.
Повний текст джерела