DOCSLIB.ORG

A Multilayer Perceptron Based Ensemble Technique for Fine-Grained Financial Sentiment Analysis

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Multilayer Perceptron Based Ensemble Technique for Fine-Grained Financial Sentiment Analysis A Multilayer Perceptron based Ensemble Technique for Fine-grained Financial Sentiment Analysis A and B and C and D and E [email protected] Abstract in company stock prices and vice-versa. Benefits of such analysis are two-fold: (i). an individual In this paper, we propose a novel method can take informed decision before buying/selling for combining deep learning and classical his/her share; and (ii). an organization can utilize feature based models using a Multi-Layer this information to forecast its economic situation. Perceptron (MLP) network for financial Sentiment prediction is a core component of sentiment analysis. We develop various an end-to-end stock market forecasting business deep learning models based on Convolu- model. Thus, an efficient sentiment analysis sys- tional Neural Network (CNN), Long Short tem is required for real-time analysis of financial Term Memory (LSTM) and Gated Recur- text originating from the web. Sentiment analy- rent Unit (GRU). These are trained on sis in financial domain offers more challenges (as top of pre-trained, autoencoder-based, fi- compared to product reviews domains etc.) due nancial word embeddings and lexicon fea- to the presence of various financial and techni- tures. An ensemble is constructed by com- cal terms along with numerous statistics. Coarse- bining these deep learning models and a level sentiment analysis in financial texts usually classical supervised model based on Sup- ignores critical information towards a particular port Vector Regression (SVR). We eval- company, therefore making it unreliable for the uate our proposed technique on a bench- stock prediction. In fine-grained sentiment anal- mark dataset of SemEval 2017. The pro- ysis, we can emphasize on a given company with- pose model shows impressive results on out losing any critical information. For example, two datasets, i.e. microblogs and news in the following tweet sentiment towards $APPL headlines datasets. Comparisons show (APPLE Inc.) is positive while negative towards that our proposed model performs better $FB (Facebook Inc.). than the existing state-of-the-art systems for the above two datasets by 2.0 and 4.1 ‘$APPL going strong; $FB not so.’ cosine points, respectively. In literature, many methods for sentiment anal- 1 Introduction ysis from financial news have been described. O’Hare et al. (2009) used word-based approach Microblog messages and news headlines are freely on financial blogs to train a sentiment classifier for available on Internet in vast amount. Dynamic na- automatically determining the sentiment towards ture of these texts can be utilized effectively to companies and their stocks. Authors in (Schu- analyze the shift in the stock prices of any com- maker and Chen, 2009) use the bag-of-words and pany (Goonatilake and Herath, 2007). By keep- named entities for predicting stock market. They ing a track of microblog messages and news head- successfully showed that the stock market behav- lines for financial domain one can observe the ior is based on the opinions. A fine-grained sen- trend in stock prices, which in turn, allows an in- timent annotation scheme was incorporated by dividual to predict the future stock prices. An (de Kauter et al., 2015) for predicting the explicit increase in positive opinions towards a particular and implicit sentiment in the financial text. An ap- company would indicate that the company is do- plication of multiple regression model was devel- ing well and this would be reflected in the increase oped by (Oliveira et al., 2013). In this paper, we propose a novel Multi-Layer (Word2Vec: given a context, a word is predicted Perceptron (MLP) based ensemble technique for or vice-versa; GloVe: count-based model utiliz- fine-grained sentiment analysis. It combines the ing word co-occurrence matrix), some applica- outputs of four systems, one is feature-driven su- tions adapt well to Word2Vec while others per- pervised model and the rest three are deep learning form well on GloVe model. We, therefore, at- based. tempt to leverage the richness of both the models We further propose to develop an enhanced by using a stacked denoising autoencoder.Finally, word representation by learning through a stacked we combine predictions of these models using the denoising autoencoder network (Vincent et al., MLP network in order to obtain the final sentiment 2010) using word embeddings of Word2Vec scores. An overview of the proposed method is de- (Mikolov et al., 2013) and GloVe (Pennington picted in Figure1. et al., 2014) models. For evaluation purpose we use datasets of SemEval-2017 ‘Fine-Grained Sentiment Analysis on Financial Microblogs and News’ shared task (Keith Cortis and Davis, 2017). The dataset com- prises of financial short texts for two domains i.e. microblog messages and news headlines. Com- parisons with the state-of-the-art models show that our system produces better performance. Figure 1: MLP based ensemble architecture. The main contributions of the current work are summarized as follows: a) we effectively com- A. Convolution Neural Network (CNN): bine competing systems to work as a team via Lit- MLP based ensemble learning; b) develop an en- erature suggests that CNN architecture had been hanced word representation by leveraging the syn- successfully applied for sentiment analysis at tactic and semantic richness of the two distributed various level (Kim, 2014; Akhtar et al., 2016; word representation through a stacked denoising Singhal and Bhattacharyya, 2016). Most of these autoencoder; and c) build a state-of-the-art model works involve classification tasks, however, we for sentiment analysis in financial domain. adopt CNN architecture for solving the regres- sion problem. Our proposed system employs a 2 Proposed Methodology convolution layer followed by a max pool layer, 2 fully connected layers and an output layer. We We propose a Multi-Layer Perceptron based en- use 100 different filters while sliding over 2, 3 and semble approach to leverage the goodness of 4 words at a time. We employ all these filters in various supervised systems. We develop three parallel. deep neural network architecture based models, viz. Convolution Neural Network (CNN) (Kim, B. Long Short Term Memory Network 2014), Long Shrort Term Memory (LSTM) net- (LSTM): LSTMs (Hochreiter and Schmidhuber, work (Hochreiter and Schmidhuber, 1997) and 1997) are a special kind of recurrent neural Gated Recurrent Unit (GRU) network (Cho et al., network (RNN) capable of learning long-term 2014)). The other model is based on Support dependencies by effectively handling the vanish- Vector Regression (SVR) (Smola and Scholkopf¨ , ing or exploding gradient problem. We use two 2004) based feature-driven system. LSTM layers on top of each other having 100 The classical feature based system utilizes a neurons in each. This was followed by 2 fully diverse set of features (c.f. Section 2.D). On connected layers and an output layer. the other hand we train a CNN, a LSTM and a GRU network on top of distributed word rep- C. Gated Recurrent Unit (GRU): GRUs (Cho resentations. We utilize Word2Vec and GloVe et al., 2014) are also a special kind of RNN which word representation techniques to learn our fi- can efficiently learn long-term dependencies. A nancial word embeddings. Since Word2Vec and key difference of GRU with LSTM is that, GRU’s GloVe models capture syntactic and semantic re- recurrent state is completely exposed at each time lations among words using different techniques step in contrast to LSTM’s recurrent state which controls its recurrent state. Thus, comparably lexicons (Kiritchenko et al., 2014; Mohammad GRUs have lesser parameters to learn and training et al., 2013) which associate a positive or negative is computationally efficient. We use two GRU score to a token. Following features are extracted layers on top of each other having 100 neurons for each of these: i) positive, negative and net in each. This was followed by 2 fully connected count. ii) maximum of positive and negative layers and an output layer. scores. iii) sum of positive, negative and net scores. D. Feature based Model (SVR): We extract and - Vader Sentiment: Vader sentiment (Gilbert, implement following set of features to learn a 2014) score is a rule-based method that generates Support Vector Regression (SVR) (Smola and a compound sentiment score for each sentence Scholkopf¨ , 2004) for predicting the sentiment between -1 (extreme negative) and +1 (extreme score in the continuous range of -1 to +1. positive). It also produces ratio of positive, - Word Tf-Idf: Term frequency-inverse docu- negative and neutral tokens in the sentence. We ment frequency (tf-idf) is a numerical statistic that obtain score and ratio of each instance in the is intended to reflect how important a word is datasets and use as feature for training. to a document in a corpus. We consider tf-idf weighted counts of continuous sequences of n- Network parameters for CNN, LSTM & GRU: grams (n=2,3,4,5) at a time. In the fully connected layers we use 50 and 10 - Lexicon Features: Sentiment lexicons are neurons , respectively for the two hidden layers. widely utilized resources in the field of sentiment We use Relu activations (Glorot et al., 2011) for analysis. Its application and effectiveness in senti- intermediate layers and tanh activation in the final ment prediction task had been widely studied. We layer. We employ 20% Dropout (Srivastava et al., employ two lexicons i.e. Bing Liu opinion lexi- 2014) in the fully connected layers as a measure con (Ding et al., 2008) and MPQA (Wilson et al., of regularization and Adam optimizer (Kingma 2005) subjectivity lexicon for news headlines do- and Ba, 2014) for optimization. main. First we compile a comprehensive list of positive and negative words form these lexicons E. MultiLayer Perceptron (MLP) based En- and then extract the following lexicon driven fea- semble: Ensemble of models improves the pre- tures.
Load more

Recommended publications
  • Audio Event Classification Using Deep Learning in an End-To-End Approach
    Audio Event Classification using Deep Learning in an End-to-End Approach Master thesis Jose Luis Diez Antich Aalborg University Copenhagen A. C. Meyers Vænge 15 2450 Copenhagen SV Denmark Title: Abstract: Audio Event Classification using Deep Learning in an End-to-End Approach The goal of the master thesis is to study the task of Sound Event Classification Participant(s): using Deep Neural Networks in an end- Jose Luis Diez Antich to-end approach. Sound Event Classifi- cation it is a multi-label classification problem of sound sources originated Supervisor(s): from everyday environments. An auto- Hendrik Purwins matic system for it would many applica- tions, for example, it could help users of hearing devices to understand their sur- Page Numbers: 38 roundings or enhance robot navigation systems. The end-to-end approach con- Date of Completion: sists in systems that learn directly from June 16, 2017 data, not from features, and it has been recently applied to audio and its results are remarkable. Even though the re- sults do not show an improvement over standard approaches, the contribution of this thesis is an exploration of deep learning architectures which can be use- ful to understand how networks process audio. The content of this report is freely available, but publication (with reference) may only be pursued due to agreement with the author. Contents 1 Introduction1 1.1 Scope of this work.............................2 2 Deep Learning3 2.1 Overview..................................3 2.2 Multilayer Perceptron...........................4
    [Show full text]
  • 4 Nonlinear Regression and Multilayer Perceptron
    4 Nonlinear Regression and Multilayer Perceptron In nonlinear regression the output variable y is no longer a linear function of the regression parameters plus additive noise. This means that estimation of the parameters is harder. It does not reduce to minimizing a convex energy functions { unlike the methods we described earlier. The perceptron is an analogy to the neural networks in the brain (over-simplified). It Pd receives a set of inputs y = j=1 !jxj + !0, see Figure (3). Figure 3: Idealized neuron implementing a perceptron. It has a threshold function which can be hard or soft. The hard one is ζ(a) = 1; if a > 0, ζ(a) = 0; otherwise. The soft one is y = σ(~!T ~x) = 1=(1 + e~!T ~x), where σ(·) is the sigmoid function. There are a variety of different algorithms to train a perceptron from labeled examples. Example: The quadratic error: t t 1 t t 2 E(~!j~x ; y ) = 2 (y − ~! · ~x ) ; for which the update rule is ∆!t = −∆ @E = +∆(yt~! · ~xt)~xt. Introducing the sigmoid j @!j function rt = sigmoid(~!T ~xt), we have t t P t t t t E(~!j~x ; y ) = − i ri log yi + (1 − ri) log(1 − yi ) , and the update rule is t t t t ∆!j = −η(r − y )xj, where η is the learning factor. I.e, the update rule is the learning factor × (desired output { actual output)× input. 10 4.1 Multilayer Perceptrons Multilayer perceptrons were developed to address the limitations of perceptrons (introduced in subsection 2.1) { i.e.
    [Show full text]
  • Petroleum and Coal
    Petroleum and Coal Article Open Access IMPROVED ESTIMATION OF PERMEABILITY OF NATURALLY FRACTURED CARBONATE OIL RESER- VOIRS USING WAVENET APPROACH Mohammad M. Bahramian 1, Abbas Khaksar-Manshad 1*, Nader Fathianpour 2, Amir H. Mohammadi 3, Bengin Masih Awdel Herki 4, Jagar Abdulazez Ali 4 1 Department of Petroleum Engineering, Abadan Faculty of Petroleum Engineering, Petroleum University of Technology (PUT), Abadan, Iran 2 Department of Mining Engineering, Isfahan University of Technology, Isfahan, Iran 3 Discipline of Chemical Engineering, School of Engineering, University of KwaZulu-Natal, Howard College Campus, King George V Avenue, Durban 4041, South Africa 4 Faculty of Engineering, Soran University, Kurdistan-Iraq Received June 18, 2017; Accepted September 30, 2017 Abstract One of the most important parameters which is regarded in petroleum industry is permeability that its accurate knowledge allows petroleum engineers to have adequate tools to evaluate and minimize the risk and uncertainty in the exploration of oil and gas reservoirs. Different direct and indirect methods are used to measure this parameter most of which (e.g. core analysis) are very time -consuming and cost consuming. Hence, applying an efficient method that can model this important parameter has the highest importance. Most of the researches show that the capability (i.e. classification, optimization and data mining) of an Artificial Neural Network (ANN) is suitable for imperfections found in petroleum engineering problems considering its successful application. In this study, we have used a Wavenet Neural Network (WNN) model, which was constructed by combining neural network and wavelet theory to improve estimation of permeability. To achieve this goal, we have also developed MLP and RBF networks and then compared the results of the latter two networks with the results of WNN model to select the best estimator between them.
    [Show full text]
  • Learning Sabatelli, Matthia; Loupe, Gilles; Geurts, Pierre; Wiering, Marco
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by University of Groningen University of Groningen Deep Quality-Value (DQV) Learning Sabatelli, Matthia; Loupe, Gilles; Geurts, Pierre; Wiering, Marco Published in: ArXiv IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish to cite from it. Please check the document version below. Document Version Early version, also known as pre-print Publication date: 2018 Link to publication in University of Groningen/UMCG research database Citation for published version (APA): Sabatelli, M., Loupe, G., Geurts, P., & Wiering, M. (2018). Deep Quality-Value (DQV) Learning. ArXiv. Copyright Other than for strictly personal use, it is not permitted to download or to forward/distribute the text or part of it without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license (like Creative Commons). Take-down policy If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim. Downloaded from the University of Groningen/UMCG research database (Pure): http://www.rug.nl/research/portal. For technical reasons the number of authors shown on this cover page is limited to 10 maximum. Download date: 19-05-2020 Deep Quality-Value (DQV) Learning Matthia Sabatelli Gilles Louppe Pierre Geurts Montefiore Institute Montefiore Institute Montefiore Institute Université de Liège, Belgium Université de Liège, Belgium Université de Liège, Belgium [email protected] [email protected] [email protected] Marco A.
    [Show full text]
  • The Architecture of a Multilayer Perceptron for Actor-Critic Algorithm with Energy-Based Policy Naoto Yoshida
    The Architecture of a Multilayer Perceptron for Actor-Critic Algorithm with Energy-based Policy Naoto Yoshida To cite this version: Naoto Yoshida. The Architecture of a Multilayer Perceptron for Actor-Critic Algorithm with Energy- based Policy. 2015. hal-01138709v2 HAL Id: hal-01138709 https://hal.archives-ouvertes.fr/hal-01138709v2 Preprint submitted on 19 Oct 2015 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. The Architecture of a Multilayer Perceptron for Actor-Critic Algorithm with Energy-based Policy Naoto Yoshida School of Biomedical Engineering Tohoku University Sendai, Aramaki Aza Aoba 6-6-01 Email: [email protected] Abstract—Learning and acting in a high dimensional state- when the actions are represented by binary vector actions action space are one of the central problems in the reinforcement [4][5][6][7][8]. Energy-based RL algorithms represent a policy learning (RL) communities. The recent development of model- based on energy-based models [9]. In this approach the prob- free reinforcement learning algorithms based on an energy- based model have been shown to be effective in such domains. ability of the state-action pair is represented by the Boltzmann However, since the previous algorithms used neural networks distribution and the energy function, and the policy is a with stochastic hidden units, these algorithms required Monte conditional probability given the current state of the agent.
    [Show full text]
  • Performance Analysis of Multilayer Perceptron in Profiling Side
    Performance Analysis of Multilayer Perceptron in Profiling Side-channel Analysis L´eoWeissbart1;2 1 Delft University of Technology, The Netherlands 2 Digital Security Group, Radboud University, The Netherlands Abstract. In profiling side-channel analysis, machine learning-based analysis nowadays offers the most powerful performance. This holds espe- cially for techniques stemming from the neural network family: multilayer perceptron and convolutional neural networks. Convolutional neural net- works are often favored as results suggest better performance, especially in scenarios where targets are protected with countermeasures. Mul- tilayer perceptron receives significantly less attention, and researchers seem less interested in this method, narrowing the results in the literature to comparisons with convolutional neural networks. On the other hand, a multilayer perceptron has a much simpler structure, enabling easier hyperparameter tuning and, hopefully, contributing to the explainability of this neural network inner working. We investigate the behavior of a multilayer perceptron in the context of the side-channel analysis of AES. By exploring the sensitivity of mul- tilayer perceptron hyperparameters over the attack's performance, we aim to provide a better understanding of successful hyperparameters tuning and, ultimately, this algorithm's performance. Our results show that MLP (with a proper hyperparameter tuning) can easily break im- plementations with a random delay or masking countermeasures. This work aims to reiterate the power of simpler neural network techniques in the profiled SCA. 1 Introduction Side-channel analysis (SCA) exploits weaknesses in cryptographic algorithms' physical implementations rather than the mathematical properties of the algo- rithms [16]. There, SCA correlates secret information with unintentional leakages like timing [13], power dissipation [14], and electromagnetic (EM) radiation [25].
    [Show full text]
  • Perceptron 1 History of Artificial Neural Networks
    Introduction to Machine Learning (Lecture Notes) Perceptron Lecturer: Barnabas Poczos Disclaimer: These notes have not been subjected to the usual scrutiny reserved for formal publications. They may be distributed outside this class only with the permission of the Instructor. 1 History of Artificial Neural Networks The history of artificial neural networks is like a roller-coaster ride. There were times when it was popular(up), and there were times when it wasn't. We are now in one of its very big time. • Progression (1943-1960) { First Mathematical model of neurons ∗ Pitts & McCulloch (1943) [MP43] { Beginning of artificial neural networks { Perceptron, Rosenblatt (1958) [R58] ∗ A single neuron for classification ∗ Perceptron learning rule ∗ Perceptron convergence theorem [N62] • Degression (1960-1980) { Perceptron can't even learn the XOR function [MP69] { We don't know how to train MLP { 1963 Backpropagation (Bryson et al.) ∗ But not much attention • Progression (1980-) { 1986 Backpropagation reinvented: ∗ Learning representations by back-propagation errors. Rumilhart et al. Nature [RHW88] { Successful applications in ∗ Character recognition, autonomous cars, ..., etc. { But there were still some open questions in ∗ Overfitting? Network structure? Neuron number? Layer number? Bad local minimum points? When to stop training? { Hopfield nets (1982) [H82], Boltzmann machines [AHS85], ..., etc. • Degression (1993-) 1 2 Perceptron: Barnabas Poczos { SVM: Support Vector Machine is developed by Vapnik et al.. [CV95] However, SVM is a shallow architecture. { Graphical models are becoming more and more popular { Great success of SVM and graphical models almost kills the ANN (Artificial Neural Network) research. { Training deeper networks consistently yields poor results. { However, Yann LeCun (1998) developed deep convolutional neural networks (a discriminative model).
    [Show full text]
  • TF-IDF Vs Word Embeddings for Morbidity Identification in Clinical Notes: an Initial Study
    TF-IDF vs Word Embeddings for Morbidity Identification in Clinical Notes: An Initial Study 1 2 Danilo Dess`ı [0000−0003−3843−3285], Rim Helaoui [0000−0001−6915−8920], Vivek 1 1 Kumar [0000−0003−3958−4704], Diego Reforgiato Recupero [0000−0001−8646−6183], and 1 Daniele Riboni [0000−0002−0695−2040] 1 University of Cagliari, Cagliari, Italy {danilo dessi, vivek.kumar, diego.reforgiato, riboni}@unica.it 2 Philips Research, Eindhoven, Netherlands [email protected] Abstract. Today, we are seeing an ever-increasing number of clinical notes that contain clinical results, images, and textual descriptions of pa-tient’s health state. All these data can be analyzed and employed to cater novel services that can help people and domain experts with their com-mon healthcare tasks. However, many technologies such as Deep Learn-ing and tools like Word Embeddings have started to be investigated only recently, and many challenges remain open when it comes to healthcare domain applications. To address these challenges, we propose the use of Deep Learning and Word Embeddings for identifying sixteen morbidity types within textual descriptions of clinical records. For this purpose, we have used a Deep Learning model based on Bidirectional Long-Short Term Memory (LSTM) layers which can exploit state-of-the-art vector representations of data such as Word Embeddings. We have employed pre-trained Word Embeddings namely GloVe and Word2Vec, and our own Word Embeddings trained on the target domain. Furthermore, we have compared the performances of the deep learning approaches against the traditional tf-idf using Support Vector Machine and Multilayer per-ceptron (our baselines).
    [Show full text]
  • Multilayer Perceptron
    Advanced Introduction to Machine Learning, CMU-10715 Perceptron, Multilayer Perceptron Barnabás Póczos, Sept 17 Contents History of Artificial Neural Networks Definitions: Perceptron, MLP Representation questions Perceptron algorithm Backpropagation algorithm 2 Short History Progression (1943-1960) • First mathematical model of neurons . Pitts & McCulloch (1943) • Beginning of artificial neural networks • Perceptron, Rosenblatt (1958) . A single layer neuron for classification . Perceptron learning rule . Perceptron convergence theorem Degression (1960-1980) • Perceptron can’t even learn the XOR function • We don’t know how to train MLP • 1969 Backpropagation… but not much attention… 3 Short History Progression (1980-) • 1986 Backpropagation reinvented: . Rumelhart, Hinton, Williams: Learning representations by back-propagating errors. Nature, 323, 533—536, 1986 • Successful applications: . Character recognition, autonomous cars,… • Open questions: Overfitting? Network structure? Neuron number? Layer number? Bad local minimum points? When to stop training? • Hopfield nets (1982), Boltzmann machines,… 4 Short History Degression (1993-) • SVM: Vapnik and his co-workers developed the Support Vector Machine (1993). It is a shallow architecture. • SVM almost kills the ANN research. • Training deeper networks consistently yields poor results. • Exception: deep convolutional neural networks, Yann LeCun 1998. (discriminative model) 5 Short History Progression (2006-) Deep Belief Networks (DBN) • Hinton, G. E, Osindero, S., and Teh, Y.
    [Show full text]
  • Imputation and Generation of Multidimensional Market Data
    IMPUTATION AND GENERATION OF MULTIDIMENSIONAL MARKET DATA Master Thesis Tobias Wall & Jacob Titus Master thesis, 30 credits Department of mathematics and Mathematical Statistics Spring Term 2021 Imputation and Generation of Multidimensional Market Data Tobias Wall†, [email protected] Jacob Titus†, [email protected] Copyright © by Tobias Wall and Jacob Titus, 2021. All rights reserved. Supervisors: Jonas Nylén Nasdaq Inc. Armin Eftekhari Umeå University Examiner: Jianfeng Wang Umeå University Master of Science Thesis in Industrial Engineering and Management, 30 ECTS Department of Mathematics and Mathematical Statistics Umeå University SE-901 87 Umeå, Sweden †Equal contribution. The order of the contributors names were chosen based on a bootstrapping procedure where the names was drawn 100 times. i Abstract Market risk is one of the most prevailing risks to which financial institutions are exposed. The most popular approach in quantifying market risk is through Value at Risk. Organisations and regulators often require a long historical horizon of the affecting financial variables to estimate the risk exposures. A long horizon stresses the completeness of the available data; something risk applications need to handle. The goal of this thesis is to evaluate and propose methods to impute finan- cial time series. The performance of the methods will be measured with respect to both price-, and risk metric replication. Two different use cases are evaluated; missing values randomly place in the time series and consecutively missing values at the end-point of a time series. In total, there are five models applied to each use case, respectively. For the first use case, the results show that all models perform better than the naive approach.
    [Show full text]
  • Lecture 7. Multilayer Perceptron. Backpropagation
    Lecture 7. Multilayer Perceptron. Backpropagation COMP90051 Statistical Machine Learning Semester 2, 2017 Lecturer: Andrey Kan Copyright: University of Melbourne Statistical Machine Learning (S2 2017) Deck 7 This lecture • Multilayer perceptron ∗ Model structure ∗ Universal approximation ∗ Training preliminaries • Backpropagation ∗ Step-by-step derivation ∗ Notes on regularisation 2 Statistical Machine Learning (S2 2017) Deck 7 Animals in the zoo Artificial Neural Recurrent neural Networks (ANNs) networks Feed-forward Multilayer perceptrons networks art: OpenClipartVectors at pixabay.com (CC0) Perceptrons Convolutional neural networks • Recurrent neural networks are not covered in this subject • If time permits, we will cover autoencoders. An autoencoder is an ANN trained in a specific way. ∗ E.g., a multilayer perceptron can be trained as an autoencoder, or a recurrent neural network can be trained as an autoencoder. 3 Statistical Machine Learning (S2 2016) Deck 7 Multilayer Perceptron Modelling non-linearity via function composition 4 Statistical Machine Learning (S2 2017) Deck 7 Limitations of linear models Some function are linearly separable, but many are not AND OR XOR Possible solution: composition XOR = OR AND not AND 1 2 1 2 1 2 We are going to combine perceptrons … 5 Statistical Machine Learning (S2 2017) Deck 7 Simplified graphical representation Sputnik – first artificial Earth satellite 6 Statistical Machine Learning (S2 2017) Deck 7 Perceptorn is sort of a building block for ANN • ANNs are not restricted to binary classification
    [Show full text]
  • A Multilayer Perceptron Solution to the Match
    290 lEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 4, NO. 3, JUNE 1992 Concise Papers A Multilayer Perceptron Solution to the Match Phase description of the Rete Match Algorithm, the conventional solution Problem in Rule-Based Artificial Intelligence Systems to the match phase problem. A rule-based expert system uses rules, sometimes referred to as Michael A. Sartori, Kevin M. Passino, and Panos J. Antsaklis, productions or production rules, to represent knowledge and uses an inference engine to perform the actions of the expert system. In general, a rule is of the form Abstruct- In rule-based artificial intelligence (AI) planning, expert, and learning systems, it is often the case that the left-hand-sides of the IF (antecedent) THEN (consequence) (1) rules must be repeatedly compared to the contents of some “working memory.” Normally, the intent is to determine which rules are relevant Customarily, the antecedent is referred to as the left-hand-side, and to the current situation (i.e., to find the “conflict set”). The traditional approach to solve such a “match phase problem” for production systems the consequence is referred to as the right-hand-side. The working is to use the Rete Match Algorithm. Here, a new technique using a memory (data memory) contains dynamic data that is compared to multilayer perceptron, a particular artificial neural network model, is the left-hand-side of the rules. The individual elements of the working presented to solve the match phase problem for rule-based AI systems. memory are referred to as the working memory elements. The A syntax for premise formulas (i.e., the left-hand-sides of the rules) is inference engine performs the comparison of the working memory defined, and working memory is specified.
    [Show full text]