Michael R. Smith, Mark Clement, Tony Martinez, and Quinn Snell

Slides:



Advertisements
Similar presentations
TWO STEP EQUATIONS 1. SOLVE FOR X 2. DO THE ADDITION STEP FIRST
Advertisements

Artificial Neural Networks
Substitution.
1 Copyright © 2010, Elsevier Inc. All rights Reserved Fig 2.1 Chapter 2.
1 Chapter 40 - Physiology and Pathophysiology of Diuretic Action Copyright © 2013 Elsevier Inc. All rights reserved.
By D. Fisher Geometric Transformations. Reflection, Rotation, or Translation 1.
For APNOMS Managing Pervasive Computing and Ubiquitous Communications Challenges Ahead Graham Chen.
Business Transaction Management Software for Application Coordination 1 Business Processes and Coordination.
Energy-Efficient Distributed Algorithms for Ad hoc Wireless Networks Gopal Pandurangan Department of Computer Science Purdue University.
and 6.855J Cycle Canceling Algorithm. 2 A minimum cost flow problem , $4 20, $1 20, $2 25, $2 25, $5 20, $6 30, $
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
0 - 0.
ALGEBRAIC EXPRESSIONS
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
MULTIPLYING MONOMIALS TIMES POLYNOMIALS (DISTRIBUTIVE PROPERTY)
ADDING INTEGERS 1. POS. + POS. = POS. 2. NEG. + NEG. = NEG. 3. POS. + NEG. OR NEG. + POS. SUBTRACT TAKE SIGN OF BIGGER ABSOLUTE VALUE.
MULTIPLICATION EQUATIONS 1. SOLVE FOR X 3. WHAT EVER YOU DO TO ONE SIDE YOU HAVE TO DO TO THE OTHER 2. DIVIDE BY THE NUMBER IN FRONT OF THE VARIABLE.
SUBTRACTING INTEGERS 1. CHANGE THE SUBTRACTION SIGN TO ADDITION
MULT. INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
Addition Facts
Artificial Intelligence 12. Two Layer ANNs
1 A gender and helping study with a different outcome.
ZMQS ZMQS
Copyright © 2010 Pearson Education, Inc. Systems of Linear Equations in Three Variables Learn basic concepts about systems in three variables Learn basic.
BT Wholesale October Creating your own telephone network WHOLESALE CALLS LINE ASSOCIATED.
1 The tiling algorithm Learning in feedforward layered networks: the tiling algorithm writed by Marc M é zard and Jean-Pierre Nadal.
Randomized Algorithms Randomized Algorithms CS648 1.
ABC Technology Project
3 Logic The Study of What’s True or False or Somewhere in Between.
Static CMOS Circuits.
1 Computer Programming Boolean Logic Copyright © Texas Education Agency, 2013.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 2 – Combinational Logic Circuits Part 3.
O X Click on Number next to person for a question.
© S Haughton more than 3?
25 July, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 1 Martijn v/d Horst
25 July, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 1 Martijn v/d Horst
5 August, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 1 Martijn v/d Horst
1 Directed Depth First Search Adjacency Lists A: F G B: A H C: A D D: C F E: C D G F: E: G: : H: B: I: H: F A B C G D E H I.
Twenty Questions Subject: Twenty Questions
Linking Verb? Action Verb or. Question 1 Define the term: action verb.
Absolute-Value Equations and Inequalities
Past Tense Probe. Past Tense Probe Past Tense Probe – Practice 1.
Properties of Exponents
Chapter 5 Test Review Sections 5-1 through 5-4.
1 First EMRAS II Technical Meeting IAEA Headquarters, Vienna, 19–23 January 2009.
Addition 1’s to 20.
25 seconds left…...
Princess Nora University Artificial Intelligence Artificial Neural Network (ANN) 1.
Test B, 100 Subtraction Facts
11 = This is the fact family. You say: 8+3=11 and 3+8=11
An Adaptive System for User Information needs based on the observed meta- Knowledge AKERELE Olubunmi Doctorate student, University of Ibadan, Ibadan, Nigeria;
Week 1.
We will resume in: 25 Minutes.
Figure Essential Cell Biology (© Garland Science 2010)
Dantzig-Wolfe Decomposition
1 Unit 1 Kinematics Chapter 1 Day
O X Click on Number next to person for a question.
How Cells Obtain Energy from Food
1 ECE 776 Project Information-theoretic Approaches for Sensor Selection and Placement in Sensor Networks for Target Localization and Tracking Renita Machado.
EE-M /7: IS L7&8 1/24, v3.0 Lectures 7&8: Non-linear Classification and Regression using Layered Perceptrons Dr Martin Brown Room: E1k
Inferring Gene Regulatory Networks from Asynchronous Microarray Data David Oviatt, Dr. Mark Clement, Dr. Quinn Snell, Kenneth Sundberg Department of Computer.
Reverse Engineering of Regulatory Networks Ka-Lok Ng Department of Bioinformatics Asia University.
Artificial Neural Networks
Computer Science and Engineering
Artificial Intelligence Lecture No. 29 Dr. Asad Ali Safi ​ Assistant Professor, Department of Computer Science, COMSATS Institute of Information Technology.
Abstract ODE System Model of GRNs Summary Evolving Small GRNs with a Top-Down Approach Javier Garcia-Bernardo* and Margaret J. Eppstein Department of Computer.
Multi-Layer Perceptron
Artificial Neural Networks (ANN). Artificial Neural Networks First proposed in 1940s as an attempt to simulate the human brain’s cognitive learning processes.
Learning Combinational Logic
Presentation transcript:

Time Series Gene Expression Prediction using Neural Networks with Hidden Layers Michael R. Smith, Mark Clement, Tony Martinez, and Quinn Snell Brigham Young University Department of Computer Science October 2010

Modeling Problem

Modeling Problem

Previous Modeling Work DNA microarray technology allows for effective and efficient way to measure gene expression Model the gene regulatory network Boolean networks Bayesian networks (dynamic BN) Electrical circuit analysis Differential equations Neural networks Constraint to be interpretable

Common NN Implementation Each node represents a gene Weights represent the effect of one gene on another Positive (activation) Negative (inhibition) Zero (no influence) Perceptron model

NN Model Changes Training recurrent neural network is difficult Backpropagation through time Genetic algorithms Modified the node's function Fuzzy logic Still a perceptron model

Challenges with Modeling a GRN Fundamental Issues Data scarce, noisy and high dimensional No definitive truth Models are constrained to be interpretable Perceptron Issues Chosen because it is interpretable Does not take into higher order correlations Exclusive OR (XOR) problem

Revised Problem-Prediction

Significance of Prediction Determine the goodness of the model With a “good” model Use the model to infer the genetic regulatory network Generate additional data points for use in a simpler model Do experiments in silico rather then in vitro.

Solution Data scarcity Create more data by combining data points Examine using multi-layer perceptron (MLPs—NN with hidden layers) for predicting gene expression levels. MLPs are capable of modeling higher order correlations

Data Combination

Neural Network Models Perceptron— NN without hidden layer Multi-Layer Perceptron— NN with a hidden layer Recurrent Neural Network

DREAM Results

DREAM Results

DREAM Results

SOS Results

SOS Results

Conclusions MLPs (NNs with hidden layers) are better able to model GRNs than NNs without hidden layers Shows that higher order correlations DO exist in modeling GRNs Could be beneficial in generating synthetic data Data combination for training produces smoother gene expression predictions Noise filtering Similar to Elman nets and BPTT

QUESTIONS?