Syllabus for the course «Stochastic Modelling»
|
|
- Justin Henry
- 5 years ago
- Views:
Transcription
1 Government of Russian Federation Federal State Autonomous Educational Institution of High Professional Education National Research University High School of Economics Faculty of Computer Science Syllabus for the course «Stochastic Modelling» «Applied Mathematics and Informatics» «Data Sciences», Master Program Approved by: Moscow, 2016
2 1. Scope of Use The present program establishes minimum demands of students knowledge and skills, and determines content of the course. The present syllabus is aimed at department teaching the course, their teaching assistants, and students of the Master of Science program «Applied Mathematics and Informatics». This syllabus meets the standards required by: Educational standards of ; Educational program «Data Sciences» of Federal Master s Degree Program , 2014; University curriculum of the Master s program in «Data Science» (010402) for Summary The first part of the course deals with unsupervised learning techniques for independent observations (including clustering and probabilistic principal component analysis), before moving on to models for sequential data (including the Poisson process and Kalman filtering). Finally, we introduce basic sampling techniques. The second part of the course is devoted to the study of stochastic modeling and simulation of random processes. It covers Markov chains with discrete and continuous time, methods of finding stationary states and processes described by Markov chains. The course proceeds with practical algorithms based on Markov chains: the hidden Markov model (HMM), Markov random field (MRF), Monte Carlo Methods in Markov chains (MCMC). 2. Learning Objectives The main objective of the course is to learn the fundamental principles used in random systems modeling, as well as advanced algorithms based on them. These algorithms are widely used in modern technologies of information retrieval, processing and recognition of speech and language, bioinformatics, and many others. Understanding of the basic algorithms required for the training of professionals in the field of mathematical modeling. The learning objective of the course «Stochastic Modeling» is to provide students with essential tools including Clustering (K-means and Gaussian Mixture Models); EM algorithm; Principal Component Analysis (PCA), Probabilistic PCA, Kernel PCA; Kalman filtering; Basing sampling methods; Random processes and Markov chains; Hidden Markov chains; Monte Carlo methods. 3. Learning outcomes After completing the study of the discipline «Stochastic Models» the student should: Know essential techniques for clustering; Know principal component analysis, and its generalisations;
3 Know basic sampling methods; Know basic notions in a theory of random processes and Markov chains; Apply the EM algorithm in a wide variety of applications; Forecast time series using Kalman filtering; Apply Markov chains to simulate various random processes in real-world problems (speech recognition, a text author problem, etc.) Understand the capabilities and limitations of existing algorithms. 4. Place of the discipline in the Master s program structure The course «Stochastic Models» is an elective course taught in the second year of the Master s program «Data Science». Prerequisites Students are assumed to have a good level in probability theory and statistics, discrete mathematics, advanced mathematics. The following knowledge and competence are needed to study the discipline: A good command of the English language, both orally and written. A good knowledge in probability theory and statistics. After completing the study of the discipline «Stochastic Modeling» the student should have the following competences: Competence Code Code (UC) The ability to reflect developed methods of activity. The ability to propose a model to invent and test methods and tools of professional activity Descriptors (indicators of achievement of the result) SSC-М1 The student is able to C-1 reflect developed methods in stochastic modeling. C-2 SC-М2 The student is able to model randomness using probabilistic models and perform statistical inference to estimate the model parameters. Educative forms and methods aimed at generation and development of the competence Lectures and tutorials. Examples covered during the lectures and tutorials. Assignments. Capability of development of new research methods, change of scientific and industrial profile of self-activities C-3 SC-М3 Students obtain necessary knowledge in stochastic and probabilistic models, sufficient to apply them and develop new methods in other disciplines. Assignments, additional material/reading provided.
4 5. Schedule Two pairs consist of 2 academic hour for lecture followed by 2 academic hour for tutorial after lecture. Topic Total Contact hours hours Lectures Seminars Self-study 1. Clustering Principal Component Analysis and its extensions Kalman filtering Sampling Methods Introduction to Markov process Discrete time Markov Chains Continuous time Markov chains Hidden Markov models (HMM) Markov chain Monte Carlo methods (MCMC) Total: Requirements and Grading Type of work Module # Homework1 1 1 One written homework. Type of Cumulative of written and coding works during grading Homework2 2 4 the 2nd module MidTerm Exam 1 1 Written exam. Preparation time 180 min. Final Exam 2 1 Written exam. Preparation time 80 min. 9. Assessment The assessment consists of one homework, handed out to the students during the first module, and average value of homeworks from the second module. MidTerm Exam covers the course material from the first module. Final assessment is the final exam. Students have to demonstrate knowledge of all the topics covered in the course. The grade formula: The exam is worth 30% of the final mark. Final course mark is obtained from the following formula: Final=0.15*(Homework1)+0.25*(MidTerm)+0.3*(Homework2)+0.3*(Exam).
5 The grades are rounded in favour of examiner/lecturer with respect to regularity of class and home works. All grades, having a fractional part greater than 0.5, are rounded up. Table of Grade Accordance 1 - very bad 2 bad 3 no pass Ten-point Grading Scale Five-point Grading Scale Unsatisfactory pass 5 highly pass Satisfactory 3 6 good 7 very good Good 4 8 almost excellent 9 excellent 10 perfect Excellent 5 FAIL PASS 10. Course Description The following list describes main mathematical definitions which will be considered in the course in correspondence with lecture order. Topic 1. Clustering. K-means algorithm, initialization of the K-means algorithm using k++ procedure, Gaussian mixtures model, general form of the EM algorithm, EM akgorithm applied to gaussian mixtures, link between K-means and the Gaussian mixture model. 1. Christopher Bishop. Pattern Recognition and Machine Learning, Springer, D. Arthur. and S. Vassilvitskii (2007). k-means++: the advantages of careful seeding. In ACM-SIAM Symposium on Discrete Algorithms. Topic 2. PCA Review of Principal Component Analysis, probabilistic PCA (ppca) and factor analysis, learning ppca using the EM algorithm and direct maximization of the likelihood, kernel PCA. 1. Christopher Bishop. Pattern Recognition and Machine Learning, Springer, M.E. Tipping and C.M. Bishop. Probabilistic principal component analysis. J. R. statist. Soc. B (1999) 2. B. Scholkopf, A. Smola and K-R. Muller. Kernel Principal Component Analysis. Artificial Neural Networks ICANN (1997). Vol 127 pp
6 Topic 3. Kalman filtering Derivation of Kalman filtering equations, definition of Kalman gain, learning the model using the EM algorithm. 1. Christopher Bishop. Pattern Recognition and Machine Learning, Springer, R.E. Kalman (1960). A new approach to linear filtering and prediction problems. Transactions of the ASME-Journal of Basic Engineering. Vol 82, pp Topic 4. Sampling methods Rejection sampling, important sampling. 1. Christopher Bishop. Pattern Recognition and Machine Learning, Springer, Topic 5. Introduction to Markov process Stochastic process. Markov process. Discrete and continues time processes. Probabilities. 1. Sheldon M. Ross. Introduction to Probability Models, Tenth Edition. Academic Press, Olive Ibe. Markov Processes for Stochastic Modeling. Academic Press, Howard M. Taylor, Samuel Karlin, An introduction to Stochastic Modeling, Academic 1998 Topic 6. Discrete time Markov Chains Discrete time Markov chains (DTMC). Applications of DTMC. Stationary DTMC. Transition matrix. N-step transition matrix. The Chapman-Kolmogorov equations. Classification of states. Reachable and communicating states. Equivalence classes. Communicating classes. Irreducibility. Periodicity. Recurrence and transience. First passage time. Positive recurrence. Recurrence time. Ergodic states. Fundamental theorem of Markov chains. Steady state. Steady states equations. Absorbing states. Finite absorbing chains. Transition matrix structure. Absorption probabilities. Limiting distributions. 1. Sheldon M. Ross. Introduction to Probability Models, Tenth Edition. Academic Press, Olive Ibe. Markov Processes for Stochastic Modeling. Academic Press, Howard M. Taylor, Samuel Karlin, An introduction to Stochastic Modeling, Academic J. R. Norris. Markov Chains. Cambridge University Press, Topic 7. Continuous time Markov chains Continuous time stochastic process (CTMC). Examples of CTMC. Transition probability functions. Holding time and exponential distribution. Embedded DTMC. Transition rates. Absorbing states. Transition probability diagram. Classification of states. Long run behavior of
7 CTMC. Positive recurrence. Fundamental theorem for CTMC. Steady state equations. Example of birth and death processes. 1. Sheldon M. Ross. Introduction to Probability Models, Tenth Edition. Academic Press, Olive Ibe. Markov Processes for Stochastic Modeling. Academic Press, 2009 Howard M. Taylor, Samuel Karlin, An introduction to Stochastic Modeling, Academic 1998 J. R. Norris. Markov Chains. Cambridge University Press, Topic 8. Hidden Markov models (HMM) Introduction to Hidden Markov Model. Prediction of states. Evaluation of model parameters. Transition and signal matrices. Three main problems of HMM. Evaluation of signal sequence. Forward-backward procedure. Finding the most probable sequence. Decoding. Viterbi Algorithm. Fining model parameters- training HMMs. Baum-Welch Algorithm. HMM applications in speech recognition. 1. Olive Ibe. Markov Processes for Stochastic Modeling. Academic Press, Pierre Bremaud. Markov Chains, Givvs Fields, Monte Carlo Simulation, and Queues. Springer, A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition. Lawrence R. Rabiner. Proc of IEEE, Vol 77, N 2, 1989, pp Hidden Markov Models for Speech Recognition. B. H. Juang; L. R. Rabiner, Technometrics, Vol. 33, No. 3. (Aug., 1991), pp Topic 9. Markov chain Monte Carlo (MCMC) Random walks. Sampling from a distribution. Monte Carlo integrations. Construction of Markov chains. Metropolis-Hastings algorithm Olive Ibe. Markov Processes for Stochastic Modeling. Academic Press, 2009 Pierre Bremaud. Markov Chains, Givvs Fields, Monte Carlo Simulation, and Queues. Springer, 1998 Monte Carlo sampling methods using Markov chains and their applications. W. K. Hastings, Biometrika, 57,1, 1970, p. 97. Equation of State Calculations by Fast Computing Machines. Metropolis, N.,Rosenbluth, A. W.. Rosenbluth, M. N., Teller. A. H.. and Teller, E, Journal of Chemichal Physics, 21, 1953, p
8 11. Term Educational Technology The following educational technologies are used in the study process: discussion and analysis of the results during the tutorials; solutions of exercises are posted on the subject website for the student to practice; assignments to test the progress of the students; consultation time on Monday mornings (1st module). 12. Recommendations for course lecturer Course lecturer is advised to use interactive learning methods, which allow participation of the majority of students, such as slide presentations, combined with writing materials on board, and usage of interdisciplinary papers to present connections between probability theory and statistics. The course is intended to be adaptive, but it is normal to differentiate tasks in a group if necessary, and direct fast learners to solve more complicated tasks. 13. Recommendations for students and Final exam questions The course is interactive. Lectures are combined with classes. Students are invited to ask questions and actively participate in group discussions. There will be special office hours for students, which would like to get more precise understanding of each topic. The lecturer is ready to answer your questions online by official s that you can find in the contacts section. Additional references found in section 15.1 are suggested to help students in their understanding of the material. This course is taught in English, and students can ask teaching assistants to help them with the language. Example of control questions for Module Given Markov chain with two states {0, 1} and transition matrix P = [1/3, 2/3; 3/4,1/4]. If at n = 0 chain is in the state 0, compute the probability of it being in state 1 after n = 3 steps. What is the probability of being in state 1 after long time? 2. A player has a $1 at the beginning of the game and at every step of the game can win a $1 with the probability p and lose a $1 with probability 1 p. The game stops when the player either ruined or won $3. Draw a Markov chain representing this game. Compute probabilities of win and loss. Compute their numerical values of a fair game with p = 1/2. 3. Formulate the fundamental theorem of continues time Markov chains. What conditional are equivalent to the stationary state equations? Example of exam questions (not complete, only FYI) 1. Describe the fundamental Markov chain theorem and its necessary conditions. Give an example when these conditions are not satisfied. 2. Find all communication classes of a Markov chain with 7 states S = {A, B, C, D, E, F, G} and given transition matrix. Draw the chain diagram. Find communication classes and identify which states are recurrent and transient and find state periods 3. Consider Markov chain consisting of two states S = {1, 2} and known transition matrix. What is the probability for this system to be in the second state after a long time? 4. Find the value of the P (2, 3) element of the Markov chain transition matrix based on the sequence of observable states:
9 5. Compute the probability of generating sequence of states «BAB» by a hidden Markov model with two states {s,t}. Initial states have probabilities p(s) = 0.85 and p(t) = and signal emission probabilities are Ps(A) = 0.4, Ps(B) = 0.6, Pt(A) = 0.5, Pt(B) = 0.5. Transition matrix is given. 6. Apply the EM algorithm to the gaussian mixture model. 7. Describe how probabilistic PCA (ppca) is related to conventional PCA. What are the advantages of considering ppca over PCA? 8. Derive the Kalman filtering equations. Pool of questions to control quality of studying the course (2nd module) Give a definition of Markov process. Give an example of a Markov process. What is a period of a state? What is a fundamental theorem of Markov chains? Give a definition of continues time Markov process. What is transition intensity? Describe an example of hidden Markov model. What are the three main problems related to HMM? Describe the construction of Markov chain in MCMC. Describe how probability distribution is generated from MCMC. The final exam will test the students' understanding on each topic discussed during the lectures. 14. Reading and Materials 14.1 Recommended Reading Christopher Bishop. Pattern Recognition and Machine Learning, Springer, Sheldon M. Ross. Introduction to Probability Models, 10th Edition. Academic Press, Olive Ibe. Markov Processes for Stochastic Modeling. Academic Press, 2009 Pierre Bremaud. Markov Chains, Gives Fields, Monte Carlo Simulation, and Queues. Springer, Supplementary reading 1. William J. Stewart. Introduction to the Numerical Solution of Markov Chains. Princeton University Press, Howard M. Taylor, Samuel Karlin, An introduction to Stochastic Modeling, Academic J. R. Norris. Markov Chains. Cambridge University Press, A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition. Lawrence R. Rabiner. Proc of IEEE, Vol 77, N 2, 1989, pp Hidden Markov Models for Speech Recognition. B. H. Juang; L. R. Rabiner, Technometrics, Vol. 33, No. 3. (Aug., 1991), pp Understanding the Metropolis-Hastings Algorithm. S. Chib, E. Greenberg, The American Statistician, Vol. 49, No. 4.,1995, pp A guided walk Metropolis algorithm. Paul Gustafson, Statistics and computing (1998) 8,
10 8. Monte Carlo sampling methods using Markov chains and their applications. W. K. Hastings, Biometrika, 57,1, 1970, p Equation of State Calculations by Fast Computing Machines. Metropolis, N.,Rosenbluth, A. W.. Rosenbluth, M. N., Teller. A. H.. and Teller, E, Journal of Chemichal Physics, 21, 1953, p Explaining the Gibbs Sampler. G. Casella, E.I. Georrge. The American Statistician, V 46, N3, 1992, pp Optimization by Simulated Annealing. S. Kirkpatrick et al. Science, Vol. 220, No. 4598, 1983, pp D. Arthur. and S. Vassilvitskii (2007). k-means++: the advantages of careful seeding. In ACM-SIAM Symposium on Discrete Algorithms. 13. M.E. Tipping and C.M. Bishop. Probabilistic principal component analysis. J. R. statist. Soc. B (1999) 14. B. Scholkopf, A. Smola and K-R. Muller. Kernel Principal Component Analysis. Artificial Neural Networks ICANN (1997). Vol 127 pp R.E. Kalman (1960). A new approach to linear filtering and prediction problems. Transactions of the ASME-Journal of Basic Engineering. Vol 82, pp Course webpage All material of the discipline will be posted at Material from the previous years is placed here: Students are provided with links to the lecture notes, problem sheets and their solutions, assignments and their solutions, and additional readings. 16 Equipment The course requires a laptop and projector. The following Software products could be used for practical classes: Matlab, Octave, R, Python.
ACTL5103 Stochastic Modelling For Actuaries. Course Outline Semester 2, 2014
UNSW Australia Business School School of Risk and Actuarial Studies ACTL5103 Stochastic Modelling For Actuaries Course Outline Semester 2, 2014 Part A: Course-Specific Information Please consult Part B
More informationModule 12. Machine Learning. Version 2 CSE IIT, Kharagpur
Module 12 Machine Learning 12.1 Instructional Objective The students should understand the concept of learning systems Students should learn about different aspects of a learning system Students should
More informationPerformance Modeling and Design of Computer Systems
Performance Modeling and Design of Computer Systems Computer systems design is full of conundrums: Given a choice between a single machine with speed s, orn machines each with speed s/n, which should we
More informationBAUM-WELCH TRAINING FOR SEGMENT-BASED SPEECH RECOGNITION. Han Shu, I. Lee Hetherington, and James Glass
BAUM-WELCH TRAINING FOR SEGMENT-BASED SPEECH RECOGNITION Han Shu, I. Lee Hetherington, and James Glass Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology Cambridge,
More informationEvolutive Neural Net Fuzzy Filtering: Basic Description
Journal of Intelligent Learning Systems and Applications, 2010, 2: 12-18 doi:10.4236/jilsa.2010.21002 Published Online February 2010 (http://www.scirp.org/journal/jilsa) Evolutive Neural Net Fuzzy Filtering:
More informationProbabilistic Latent Semantic Analysis
Probabilistic Latent Semantic Analysis Thomas Hofmann Presentation by Ioannis Pavlopoulos & Andreas Damianou for the course of Data Mining & Exploration 1 Outline Latent Semantic Analysis o Need o Overview
More informationCS/SE 3341 Spring 2012
CS/SE 3341 Spring 2012 Probability and Statistics in Computer Science & Software Engineering (Section 001) Instructor: Dr. Pankaj Choudhary Meetings: TuTh 11 30-12 45 p.m. in ECSS 2.412 Office: FO 2.408-B
More informationIntroduction to Simulation
Introduction to Simulation Spring 2010 Dr. Louis Luangkesorn University of Pittsburgh January 19, 2010 Dr. Louis Luangkesorn ( University of Pittsburgh ) Introduction to Simulation January 19, 2010 1 /
More informationCSL465/603 - Machine Learning
CSL465/603 - Machine Learning Fall 2016 Narayanan C Krishnan ckn@iitrpr.ac.in Introduction CSL465/603 - Machine Learning 1 Administrative Trivia Course Structure 3-0-2 Lecture Timings Monday 9.55-10.45am
More informationHuman Emotion Recognition From Speech
RESEARCH ARTICLE OPEN ACCESS Human Emotion Recognition From Speech Miss. Aparna P. Wanare*, Prof. Shankar N. Dandare *(Department of Electronics & Telecommunication Engineering, Sant Gadge Baba Amravati
More informationPython Machine Learning
Python Machine Learning Unlock deeper insights into machine learning with this vital guide to cuttingedge predictive analytics Sebastian Raschka [ PUBLISHING 1 open source I community experience distilled
More informationLecture 1: Machine Learning Basics
1/69 Lecture 1: Machine Learning Basics Ali Harakeh University of Waterloo WAVE Lab ali.harakeh@uwaterloo.ca May 1, 2017 2/69 Overview 1 Learning Algorithms 2 Capacity, Overfitting, and Underfitting 3
More informationGenerative models and adversarial training
Day 4 Lecture 1 Generative models and adversarial training Kevin McGuinness kevin.mcguinness@dcu.ie Research Fellow Insight Centre for Data Analytics Dublin City University What is a generative model?
More informationSpeech Emotion Recognition Using Support Vector Machine
Speech Emotion Recognition Using Support Vector Machine Yixiong Pan, Peipei Shen and Liping Shen Department of Computer Technology Shanghai JiaoTong University, Shanghai, China panyixiong@sjtu.edu.cn,
More informationAUTOMATIC DETECTION OF PROLONGED FRICATIVE PHONEMES WITH THE HIDDEN MARKOV MODELS APPROACH 1. INTRODUCTION
JOURNAL OF MEDICAL INFORMATICS & TECHNOLOGIES Vol. 11/2007, ISSN 1642-6037 Marek WIŚNIEWSKI *, Wiesława KUNISZYK-JÓŹKOWIAK *, Elżbieta SMOŁKA *, Waldemar SUSZYŃSKI * HMM, recognition, speech, disorders
More informationMASTER OF PHILOSOPHY IN STATISTICS
MASTER OF PHILOSOPHY IN STATISTICS SYLLABUS - 2007-09 ST. JOSEPH S COLLEGE (AUTONOMOUS) (Nationally Reaccredited with A+ Grade / College with Potential for Excellence) TIRUCHIRAPPALLI - 620 002 TAMIL NADU,
More informationPenn State University - University Park MATH 140 Instructor Syllabus, Calculus with Analytic Geometry I Fall 2010
Penn State University - University Park MATH 140 Instructor Syllabus, Calculus with Analytic Geometry I Fall 2010 There are two ways to live: you can live as if nothing is a miracle; you can live as if
More informationISFA2008U_120 A SCHEDULING REINFORCEMENT LEARNING ALGORITHM
Proceedings of 28 ISFA 28 International Symposium on Flexible Automation Atlanta, GA, USA June 23-26, 28 ISFA28U_12 A SCHEDULING REINFORCEMENT LEARNING ALGORITHM Amit Gil, Helman Stern, Yael Edan, and
More informationWHEN THERE IS A mismatch between the acoustic
808 IEEE TRANSACTIONS ON AUDIO, SPEECH, AND LANGUAGE PROCESSING, VOL. 14, NO. 3, MAY 2006 Optimization of Temporal Filters for Constructing Robust Features in Speech Recognition Jeih-Weih Hung, Member,
More informationSemi-Supervised GMM and DNN Acoustic Model Training with Multi-system Combination and Confidence Re-calibration
INTERSPEECH 2013 Semi-Supervised GMM and DNN Acoustic Model Training with Multi-system Combination and Confidence Re-calibration Yan Huang, Dong Yu, Yifan Gong, and Chaojun Liu Microsoft Corporation, One
More informationLecture 10: Reinforcement Learning
Lecture 1: Reinforcement Learning Cognitive Systems II - Machine Learning SS 25 Part III: Learning Programs and Strategies Q Learning, Dynamic Programming Lecture 1: Reinforcement Learning p. Motivation
More informationIEEE TRANSACTIONS ON AUDIO, SPEECH, AND LANGUAGE PROCESSING, VOL. 17, NO. 3, MARCH
IEEE TRANSACTIONS ON AUDIO, SPEECH, AND LANGUAGE PROCESSING, VOL. 17, NO. 3, MARCH 2009 423 Adaptive Multimodal Fusion by Uncertainty Compensation With Application to Audiovisual Speech Recognition George
More informationTD(λ) and Q-Learning Based Ludo Players
TD(λ) and Q-Learning Based Ludo Players Majed Alhajry, Faisal Alvi, Member, IEEE and Moataz Ahmed Abstract Reinforcement learning is a popular machine learning technique whose inherent self-learning ability
More informationA Comparison of DHMM and DTW for Isolated Digits Recognition System of Arabic Language
A Comparison of DHMM and DTW for Isolated Digits Recognition System of Arabic Language Z.HACHKAR 1,3, A. FARCHI 2, B.MOUNIR 1, J. EL ABBADI 3 1 Ecole Supérieure de Technologie, Safi, Morocco. zhachkar2000@yahoo.fr.
More informationA Reinforcement Learning Variant for Control Scheduling
A Reinforcement Learning Variant for Control Scheduling Aloke Guha Honeywell Sensor and System Development Center 3660 Technology Drive Minneapolis MN 55417 Abstract We present an algorithm based on reinforcement
More informationUnsupervised Acoustic Model Training for Simultaneous Lecture Translation in Incremental and Batch Mode
Unsupervised Acoustic Model Training for Simultaneous Lecture Translation in Incremental and Batch Mode Diploma Thesis of Michael Heck At the Department of Informatics Karlsruhe Institute of Technology
More information4 th year course description
ESIEA 2014-2015 4 th year course description 1 st semester Susan Loubet Director of International Relations and Language Teaching 1 TABLE OF CONTENTS The 4 th year in ESIEA... 3 Program table... 5 Core
More informationAnalysis of Emotion Recognition System through Speech Signal Using KNN & GMM Classifier
IOSR Journal of Electronics and Communication Engineering (IOSR-JECE) e-issn: 2278-2834,p- ISSN: 2278-8735.Volume 10, Issue 2, Ver.1 (Mar - Apr.2015), PP 55-61 www.iosrjournals.org Analysis of Emotion
More informationProbabilistic Model Checking of DTMC Models of User Activity Patterns
Probabilistic Model Checking of DTMC Models of User Activity Patterns Oana Andrei 1, Muffy Calder 1, Matthew Higgs 1, and Mark Girolami 2 1 School of Computing Science, University of Glasgow, G12 8RZ,
More informationADVANCES IN DEEP NEURAL NETWORK APPROACHES TO SPEAKER RECOGNITION
ADVANCES IN DEEP NEURAL NETWORK APPROACHES TO SPEAKER RECOGNITION Mitchell McLaren 1, Yun Lei 1, Luciana Ferrer 2 1 Speech Technology and Research Laboratory, SRI International, California, USA 2 Departamento
More informationModeling function word errors in DNN-HMM based LVCSR systems
Modeling function word errors in DNN-HMM based LVCSR systems Melvin Jose Johnson Premkumar, Ankur Bapna and Sree Avinash Parchuri Department of Computer Science Department of Electrical Engineering Stanford
More informationAn Introduction to Simulation Optimization
An Introduction to Simulation Optimization Nanjing Jian Shane G. Henderson Introductory Tutorials Winter Simulation Conference December 7, 2015 Thanks: NSF CMMI1200315 1 Contents 1. Introduction 2. Common
More informationGeorgetown University at TREC 2017 Dynamic Domain Track
Georgetown University at TREC 2017 Dynamic Domain Track Zhiwen Tang Georgetown University zt79@georgetown.edu Grace Hui Yang Georgetown University huiyang@cs.georgetown.edu Abstract TREC Dynamic Domain
More informationCS 1103 Computer Science I Honors. Fall Instructor Muller. Syllabus
CS 1103 Computer Science I Honors Fall 2016 Instructor Muller Syllabus Welcome to CS1103. This course is an introduction to the art and science of computer programming and to some of the fundamental concepts
More informationThe 9 th International Scientific Conference elearning and software for Education Bucharest, April 25-26, / X
The 9 th International Scientific Conference elearning and software for Education Bucharest, April 25-26, 2013 10.12753/2066-026X-13-154 DATA MINING SOLUTIONS FOR DETERMINING STUDENT'S PROFILE Adela BÂRA,
More informationStochastic Calculus for Finance I (46-944) Spring 2008 Syllabus
Stochastic Calculus for Finance I (46-944) Spring 2008 Syllabus Introduction. This is a first course in stochastic calculus for finance. It assumes students are familiar with the material in Introduction
More informationA study of speaker adaptation for DNN-based speech synthesis
A study of speaker adaptation for DNN-based speech synthesis Zhizheng Wu, Pawel Swietojanski, Christophe Veaux, Steve Renals, Simon King The Centre for Speech Technology Research (CSTR) University of Edinburgh,
More informationLearning Methods in Multilingual Speech Recognition
Learning Methods in Multilingual Speech Recognition Hui Lin Department of Electrical Engineering University of Washington Seattle, WA 98125 linhui@u.washington.edu Li Deng, Jasha Droppo, Dong Yu, and Alex
More informationSpeech Segmentation Using Probabilistic Phonetic Feature Hierarchy and Support Vector Machines
Speech Segmentation Using Probabilistic Phonetic Feature Hierarchy and Support Vector Machines Amit Juneja and Carol Espy-Wilson Department of Electrical and Computer Engineering University of Maryland,
More information1.11 I Know What Do You Know?
50 SECONDARY MATH 1 // MODULE 1 1.11 I Know What Do You Know? A Practice Understanding Task CC BY Jim Larrison https://flic.kr/p/9mp2c9 In each of the problems below I share some of the information that
More informationMath 96: Intermediate Algebra in Context
: Intermediate Algebra in Context Syllabus Spring Quarter 2016 Daily, 9:20 10:30am Instructor: Lauri Lindberg Office Hours@ tutoring: Tutoring Center (CAS-504) 8 9am & 1 2pm daily STEM (Math) Center (RAI-338)
More informationA New Perspective on Combining GMM and DNN Frameworks for Speaker Adaptation
A New Perspective on Combining GMM and DNN Frameworks for Speaker Adaptation SLSP-2016 October 11-12 Natalia Tomashenko 1,2,3 natalia.tomashenko@univ-lemans.fr Yuri Khokhlov 3 khokhlov@speechpro.com Yannick
More informationChapter 10 APPLYING TOPIC MODELING TO FORENSIC DATA. 1. Introduction. Alta de Waal, Jacobus Venter and Etienne Barnard
Chapter 10 APPLYING TOPIC MODELING TO FORENSIC DATA Alta de Waal, Jacobus Venter and Etienne Barnard Abstract Most actionable evidence is identified during the analysis phase of digital forensic investigations.
More informationAxiom 2013 Team Description Paper
Axiom 2013 Team Description Paper Mohammad Ghazanfari, S Omid Shirkhorshidi, Farbod Samsamipour, Hossein Rahmatizadeh Zagheli, Mohammad Mahdavi, Payam Mohajeri, S Abbas Alamolhoda Robotics Scientific Association
More informationCourse Syllabus for Math
Course Syllabus for Math 1090-003 Instructor: Stefano Filipazzi Class Time: Mondays, Wednesdays and Fridays, 9.40 a.m. - 10.30 a.m. Class Place: LCB 225 Office hours: Wednesdays, 2.00 p.m. - 3.00 p.m.,
More informationBMBF Project ROBUKOM: Robust Communication Networks
BMBF Project ROBUKOM: Robust Communication Networks Arie M.C.A. Koster Christoph Helmberg Andreas Bley Martin Grötschel Thomas Bauschert supported by BMBF grant 03MS616A: ROBUKOM Robust Communication Networks,
More informationSpring 2014 SYLLABUS Michigan State University STT 430: Probability and Statistics for Engineering
Spring 2014 SYLLABUS Michigan State University STT 430: Probability and Statistics for Engineering Time and Place: MW 3:00-4:20pm, A126 Wells Hall Instructor: Dr. Marianne Huebner Office: A-432 Wells Hall
More informationCS4491/CS 7265 BIG DATA ANALYTICS INTRODUCTION TO THE COURSE. Mingon Kang, PhD Computer Science, Kennesaw State University
CS4491/CS 7265 BIG DATA ANALYTICS INTRODUCTION TO THE COURSE Mingon Kang, PhD Computer Science, Kennesaw State University Self Introduction Mingon Kang, PhD Homepage: http://ksuweb.kennesaw.edu/~mkang9
More informationLahore University of Management Sciences. FINN 321 Econometrics Fall Semester 2017
Instructor Syed Zahid Ali Room No. 247 Economics Wing First Floor Office Hours Email szahid@lums.edu.pk Telephone Ext. 8074 Secretary/TA TA Office Hours Course URL (if any) Suraj.lums.edu.pk FINN 321 Econometrics
More informationMassachusetts Institute of Technology Tel: Massachusetts Avenue Room 32-D558 MA 02139
Hariharan Narayanan Massachusetts Institute of Technology Tel: 773.428.3115 LIDS har@mit.edu 77 Massachusetts Avenue http://www.mit.edu/~har Room 32-D558 MA 02139 EMPLOYMENT Massachusetts Institute of
More informationAustralian Journal of Basic and Applied Sciences
AENSI Journals Australian Journal of Basic and Applied Sciences ISSN:1991-8178 Journal home page: www.ajbasweb.com Feature Selection Technique Using Principal Component Analysis For Improving Fuzzy C-Mean
More informationWelcome to. ECML/PKDD 2004 Community meeting
Welcome to ECML/PKDD 2004 Community meeting A brief report from the program chairs Jean-Francois Boulicaut, INSA-Lyon, France Floriana Esposito, University of Bari, Italy Fosca Giannotti, ISTI-CNR, Pisa,
More informationMAT 122 Intermediate Algebra Syllabus Summer 2016
Instructor: Gary Adams Office: None (I am adjunct faculty) Phone: None Email: gary.adams@scottsdalecc.edu Office Hours: None CLASS TIME and LOCATION: Title Section Days Time Location Campus MAT122 12562
More informationarxiv: v1 [cs.se] 20 Mar 2014
Probabilistic Model Checking of DTMC Models of User Activity Patterns Oana Andrei 1, Muffy Calder 1, Matthew Higgs 1, and Mark Girolami 2 1 School of Computing Science, University of Glasgow, G12 8RZ,
More informationModeling function word errors in DNN-HMM based LVCSR systems
Modeling function word errors in DNN-HMM based LVCSR systems Melvin Jose Johnson Premkumar, Ankur Bapna and Sree Avinash Parchuri Department of Computer Science Department of Electrical Engineering Stanford
More informationUnsupervised Learning of Word Semantic Embedding using the Deep Structured Semantic Model
Unsupervised Learning of Word Semantic Embedding using the Deep Structured Semantic Model Xinying Song, Xiaodong He, Jianfeng Gao, Li Deng Microsoft Research, One Microsoft Way, Redmond, WA 98052, U.S.A.
More informationMath 181, Calculus I
Math 181, Calculus I [Semester] [Class meeting days/times] [Location] INSTRUCTOR INFORMATION: Name: Office location: Office hours: Mailbox: Phone: Email: Required Material and Access: Textbook: Stewart,
More informationFoothill College Summer 2016
Foothill College Summer 2016 Intermediate Algebra Math 105.04W CRN# 10135 5.0 units Instructor: Yvette Butterworth Text: None; Beoga.net material used Hours: Online Except Final Thurs, 8/4 3:30pm Phone:
More informationstateorvalue to each variable in a given set. We use p(x = xjy = y) (or p(xjy) as a shorthand) to denote the probability that X = x given Y = y. We al
Dependency Networks for Collaborative Filtering and Data Visualization David Heckerman, David Maxwell Chickering, Christopher Meek, Robert Rounthwaite, Carl Kadie Microsoft Research Redmond WA 98052-6399
More informationXinyu Tang. Education. Research Interests. Honors and Awards. Professional Experience
Xinyu Tang Parasol Laboratory Department of Computer Science Texas A&M University, TAMU 3112 College Station, TX 77843-3112 phone:(979)847-8835 fax: (979)458-0425 email: xinyut@tamu.edu url: http://parasol.tamu.edu/people/xinyut
More informationStrategic Management (MBA 800-AE) Fall 2010
Strategic Management (MBA 800-AE) Fall 2010 Time: Tuesday evenings 4:30PM - 7:10PM in Sawyer 929 Instructor: Prof. Mark Lehrer, PhD, Dept. of Strategy and International Business Office: S666 Office hours:
More informationAn Online Handwriting Recognition System For Turkish
An Online Handwriting Recognition System For Turkish Esra Vural, Hakan Erdogan, Kemal Oflazer, Berrin Yanikoglu Sabanci University, Tuzla, Istanbul, Turkey 34956 ABSTRACT Despite recent developments in
More informationFINN FINANCIAL MANAGEMENT Spring 2014
FINN 3120-004 FINANCIAL MANAGEMENT Spring 2014 Instructor: Sailu Li Time and Location: 08:00-09:15AM, Tuesday and Thursday, FRIDAY 142 Contact: Friday 272A, 704-687-5447 Email: sli20@uncc.edu Office Hours:
More informationAutoregressive product of multi-frame predictions can improve the accuracy of hybrid models
Autoregressive product of multi-frame predictions can improve the accuracy of hybrid models Navdeep Jaitly 1, Vincent Vanhoucke 2, Geoffrey Hinton 1,2 1 University of Toronto 2 Google Inc. ndjaitly@cs.toronto.edu,
More informationRadius STEM Readiness TM
Curriculum Guide Radius STEM Readiness TM While today s teens are surrounded by technology, we face a stark and imminent shortage of graduates pursuing careers in Science, Technology, Engineering, and
More informationArtificial Neural Networks written examination
1 (8) Institutionen för informationsteknologi Olle Gällmo Universitetsadjunkt Adress: Lägerhyddsvägen 2 Box 337 751 05 Uppsala Artificial Neural Networks written examination Monday, May 15, 2006 9 00-14
More informationBUILDING CONTEXT-DEPENDENT DNN ACOUSTIC MODELS USING KULLBACK-LEIBLER DIVERGENCE-BASED STATE TYING
BUILDING CONTEXT-DEPENDENT DNN ACOUSTIC MODELS USING KULLBACK-LEIBLER DIVERGENCE-BASED STATE TYING Gábor Gosztolya 1, Tamás Grósz 1, László Tóth 1, David Imseng 2 1 MTA-SZTE Research Group on Artificial
More information(Sub)Gradient Descent
(Sub)Gradient Descent CMSC 422 MARINE CARPUAT marine@cs.umd.edu Figures credit: Piyush Rai Logistics Midterm is on Thursday 3/24 during class time closed book/internet/etc, one page of notes. will include
More informationProbability and Statistics Curriculum Pacing Guide
Unit 1 Terms PS.SPMJ.3 PS.SPMJ.5 Plan and conduct a survey to answer a statistical question. Recognize how the plan addresses sampling technique, randomization, measurement of experimental error and methods
More informationRover Races Grades: 3-5 Prep Time: ~45 Minutes Lesson Time: ~105 minutes
Rover Races Grades: 3-5 Prep Time: ~45 Minutes Lesson Time: ~105 minutes WHAT STUDENTS DO: Establishing Communication Procedures Following Curiosity on Mars often means roving to places with interesting
More informationLearning Methods for Fuzzy Systems
Learning Methods for Fuzzy Systems Rudolf Kruse and Andreas Nürnberger Department of Computer Science, University of Magdeburg Universitätsplatz, D-396 Magdeburg, Germany Phone : +49.39.67.876, Fax : +49.39.67.8
More informationProbability and Game Theory Course Syllabus
Probability and Game Theory Course Syllabus DATE ACTIVITY CONCEPT Sunday Learn names; introduction to course, introduce the Battle of the Bismarck Sea as a 2-person zero-sum game. Monday Day 1 Pre-test
More informationEDEXCEL FUNCTIONAL SKILLS PILOT. Maths Level 2. Chapter 7. Working with probability
Working with probability 7 EDEXCEL FUNCTIONAL SKILLS PILOT Maths Level 2 Chapter 7 Working with probability SECTION K 1 Measuring probability 109 2 Experimental probability 111 3 Using tables to find the
More informationControl Tutorials for MATLAB and Simulink
Control Tutorials for MATLAB and Simulink Last updated: 07/24/2014 Author Information Prof. Bill Messner Carnegie Mellon University Prof. Dawn Tilbury University of Michigan Asst. Prof. Rick Hill, PhD
More informationEECS 700: Computer Modeling, Simulation, and Visualization Fall 2014
EECS 700: Computer Modeling, Simulation, and Visualization Fall 2014 Course Description The goals of this course are to: (1) formulate a mathematical model describing a physical phenomenon; (2) to discretize
More informationLecture 1: Basic Concepts of Machine Learning
Lecture 1: Basic Concepts of Machine Learning Cognitive Systems - Machine Learning Ute Schmid (lecture) Johannes Rabold (practice) Based on slides prepared March 2005 by Maximilian Röglinger, updated 2010
More informationThe Use of Statistical, Computational and Modelling Tools in Higher Learning Institutions: A Case Study of the University of Dodoma
International Journal of Computer Applications (975 8887) The Use of Statistical, Computational and Modelling Tools in Higher Learning Institutions: A Case Study of the University of Dodoma Gilbert M.
More informationCS 101 Computer Science I Fall Instructor Muller. Syllabus
CS 101 Computer Science I Fall 2013 Instructor Muller Syllabus Welcome to CS101. This course is an introduction to the art and science of computer programming and to some of the fundamental concepts of
More informationLearning Probabilistic Behavior Models in Real-Time Strategy Games
Proceedings of the Seventh AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment Learning Probabilistic Behavior Models in Real-Time Strategy Games Ethan Dereszynski and Jesse
More informationCourse Outline. Course Grading. Where to go for help. Academic Integrity. EE-589 Introduction to Neural Networks NN 1 EE
EE-589 Introduction to Neural Assistant Prof. Dr. Turgay IBRIKCI Room # 305 (322) 338 6868 / 139 Wensdays 9:00-12:00 Course Outline The course is divided in two parts: theory and practice. 1. Theory covers
More informationCorrective Feedback and Persistent Learning for Information Extraction
Corrective Feedback and Persistent Learning for Information Extraction Aron Culotta a, Trausti Kristjansson b, Andrew McCallum a, Paul Viola c a Dept. of Computer Science, University of Massachusetts,
More informationReinforcement Learning by Comparing Immediate Reward
Reinforcement Learning by Comparing Immediate Reward Punit Pandey DeepshikhaPandey Dr. Shishir Kumar Abstract This paper introduces an approach to Reinforcement Learning Algorithm by comparing their immediate
More informationENME 605 Advanced Control Systems, Fall 2015 Department of Mechanical Engineering
ENME 605 Advanced Control Systems, Fall 2015 Department of Mechanical Engineering Lecture Details Instructor Course Objectives Tuesday and Thursday, 4:00 pm to 5:15 pm Information Technology and Engineering
More informationDecision Analysis. Decision-Making Problem. Decision Analysis. Part 1 Decision Analysis and Decision Tables. Decision Analysis, Part 1
Decision Support: Decision Analysis Jožef Stefan International Postgraduate School, Ljubljana Programme: Information and Communication Technologies [ICT3] Course Web Page: http://kt.ijs.si/markobohanec/ds/ds.html
More informationMachine Learning from Garden Path Sentences: The Application of Computational Linguistics
Machine Learning from Garden Path Sentences: The Application of Computational Linguistics http://dx.doi.org/10.3991/ijet.v9i6.4109 J.L. Du 1, P.F. Yu 1 and M.L. Li 2 1 Guangdong University of Foreign Studies,
More informationStacks Teacher notes. Activity description. Suitability. Time. AMP resources. Equipment. Key mathematical language. Key processes
Stacks Teacher notes Activity description (Interactive not shown on this sheet.) Pupils start by exploring the patterns generated by moving counters between two stacks according to a fixed rule, doubling
More informationReducing Features to Improve Bug Prediction
Reducing Features to Improve Bug Prediction Shivkumar Shivaji, E. James Whitehead, Jr., Ram Akella University of California Santa Cruz {shiv,ejw,ram}@soe.ucsc.edu Sunghun Kim Hong Kong University of Science
More informationA student diagnosing and evaluation system for laboratory-based academic exercises
A student diagnosing and evaluation system for laboratory-based academic exercises Maria Samarakou, Emmanouil Fylladitakis and Pantelis Prentakis Technological Educational Institute (T.E.I.) of Athens
More informationNavigating the PhD Options in CMS
Navigating the PhD Options in CMS This document gives an overview of the typical student path through the four Ph.D. programs in the CMS department ACM, CDS, CS, and CMS. Note that it is not a replacement
More informationSpeech Recognition at ICSI: Broadcast News and beyond
Speech Recognition at ICSI: Broadcast News and beyond Dan Ellis International Computer Science Institute, Berkeley CA Outline 1 2 3 The DARPA Broadcast News task Aspects of ICSI
More informationDesign Of An Automatic Speaker Recognition System Using MFCC, Vector Quantization And LBG Algorithm
Design Of An Automatic Speaker Recognition System Using MFCC, Vector Quantization And LBG Algorithm Prof. Ch.Srinivasa Kumar Prof. and Head of department. Electronics and communication Nalanda Institute
More informationLaboratorio di Intelligenza Artificiale e Robotica
Laboratorio di Intelligenza Artificiale e Robotica A.A. 2008-2009 Outline 2 Machine Learning Unsupervised Learning Supervised Learning Reinforcement Learning Genetic Algorithms Genetics-Based Machine Learning
More informationHigh-level Reinforcement Learning in Strategy Games
High-level Reinforcement Learning in Strategy Games Christopher Amato Department of Computer Science University of Massachusetts Amherst, MA 01003 USA camato@cs.umass.edu Guy Shani Department of Computer
More informationMGMT 5303 Corporate and Business Strategy Spring 2016
Instructor: Dr. Scott Johnson Associate Professor William S. Spears Chair in Business Management Department MGMT 5303 Corporate and Business Strategy Spring 2016 Contact Information: Office: 320 Business
More informationSTA 225: Introductory Statistics (CT)
Marshall University College of Science Mathematics Department STA 225: Introductory Statistics (CT) Course catalog description A critical thinking course in applied statistical reasoning covering basic
More informationAutomatic Speaker Recognition: Modelling, Feature Extraction and Effects of Clinical Environment
Automatic Speaker Recognition: Modelling, Feature Extraction and Effects of Clinical Environment A thesis submitted in fulfillment of the requirements for the degree of Doctor of Philosophy Sheeraz Memon
More informationLearning Optimal Dialogue Strategies: A Case Study of a Spoken Dialogue Agent for
Learning Optimal Dialogue Strategies: A Case Study of a Spoken Dialogue Agent for Email Marilyn A. Walker Jeanne C. Fromer Shrikanth Narayanan walker@research.att.com jeannie@ai.mit.edu shri@research.att.com
More informationSyllabus Foundations of Finance Summer 2014 FINC-UB
Syllabus Foundations of Finance Summer 2014 FINC-UB.0002.01 Instructor Matteo Crosignani Office: KMEC 9-193F Phone: 212-998-0716 Email: mcrosign@stern.nyu.edu Office Hours: Thursdays 4-6pm in Altman Room
More informationAnswer Key Applied Calculus 4
Answer Key Applied Calculus 4 Free PDF ebook Download: Answer Key 4 Download or Read Online ebook answer key applied calculus 4 in PDF Format From The Best User Guide Database CALCULUS. FOR THE for the
More informationInternational Journal of Advanced Networking Applications (IJANA) ISSN No. :
International Journal of Advanced Networking Applications (IJANA) ISSN No. : 0975-0290 34 A Review on Dysarthric Speech Recognition Megha Rughani Department of Electronics and Communication, Marwadi Educational
More information