CS534 Machine Learning


 Cuthbert Mills
 8 months ago
 Views:
Transcription
1 CS534 Machine Learning Spring 2013 Lecture 1: Introduction to ML Course logistics Reading: The discipline of Machine learning by Tom Mitchell
2 Course Information Instructor: Dr. Xiaoli Fern Kec 3073, TA: Travis Moore Office hour (tentative) Instructor: MW before class or by appointment TA: TBA (see class webpage for update) Class Web Page classes.engr.oregonstate.edu/eecs/spring2013/cs534/ Class list cs534
3 Course materials Text book: Pattern recognition and machine learning by Chris Bishop (Bishop) Slides and reading materials will be provided on course webpage Other good references Machine learning by Tom Mitchell (TM) Pattern Classification by Duda, Hart and Stork (DHS) 2 nd edition A lot of online resources on machine learning Check class website for a few links 3
4 Prerequisites Color Green means important Basic probability theory and statistics concepts: Distributions, Densities, Expectation, Variance, parameter estimation A brief review is provided on class website Multivariable Calculus and linear algebra Basic review slides, and links to useful video lectures provided on class webpage Knowledge of basic CS concepts such as data structure, search strategies, complexity Please spend some time review these! It will be tremendously helpful!
5 Homework Policies Homework is generally due at the beginning of the class on the due day Each student has one allowance of handing in late homework (no more than 48 hours late) Collaboration policy Discussions are allowed, but copying of solution or code is not See the Student Conduct page on OSU website for information regarding academic dishonesty ( ex.php#acdis)
6 Grading policy Grading policy: Written homework will not be graded based on correctness. We will record the number of problems that were "completed" (either correctly or incorrectly). Completing a problems requires a non trivial attempt at solving the problem. The judgment of whether a problem was "completed" is left to the instructor and the TA. Final grades breakdown: Midterm 25%; Final 25%; Final project 25%; Implementation assignments 25%. The resulting letter grade will be decreased by one if a student fails to complete at least 80% of the written homework problems.
7 What is Machine learning Task T Performance P Learning Algorithm Experience E Machine learning studies algorithms that Improve performance P at some task T based on experience E
8 Machine learning in Computer Science Machine learning is already the preferred approach to Speech recognition, Natural language processing Computer vision Medical outcomes analysis Robot control This trend is growing Improved machine learning algorithms Increase data capture, and new sensors Increasing demand for self customization to user and environment
9 Fields of Study Machine Learning Supervised Learning Semi supervised learning Unsupervised Learning Reinforcement Learning
10 Supervised Learning Learn to predict output from input. Output can be continuous: regression problems $ x x x x x x x x x x x x x Example: Predicting the price of a house based on its square footage x feet
11 Supervised Learning Learn to predict output from input. Output can be continuous: regression problems Discrete: classification problems Example: classify a loan applicant as either high risk or low risk based on income and saving amount.
12 Unsupervised Learning Given a collection of examples (objects), discover self similar groups within the data clustering Example: clustering artwork
13 Unsupervised learning Given a collection of examples (objects), discover self similar groups within the data clustering Image Segmentation 13
14 Unsupervised Learning Given a collection of examples (objects), discover self similar groups within the data clustering Learn the underlying distribution that generates the data we observe density estimation Represent high dimensional data using a lowdimensional representation for compression or visualization dimension reduction
15 Reinforcement Learning Learn to act An agent Observes the environment Takes action With each action, receives rewards/punishments Goal: learn a policy that optimizes rewards No examples of optimal outputs are given Not covered in this class. Take 533 if you want to learn about this.
16 When do we need computer to learn?
17 Appropriate Applications for Supervised Learning Situations where there is no human expert x: bond graph of a new molecule, f(x): predicted binding strength to AIDS protease molecule x: nano modification structure to a Fuel cell, f(x): predicted power output strength by the fuel cell Situations where humans can perform the task but can t describe how they do it x: picture of a hand written character, f(x): ascii code of the character x: recording of a bird song, f(x): species of the bird Situations where the desired function is changing frequently x: description of stock prices and trades for last 10 days, f(x): recommended stock transactions Situations where each user needs a customized function f x: incoming message, f(x): importance score for presenting to the user (or deleting without presenting) 17
18 Supervised learning Given: a set of training examples,, : the input of the th example ( i.e., a vector) is its corresponding output (continuous or discrete) We assume there is some underlying function that maps from to our target function Goal: find a good approximation of so that accurate prediction can be made for previously unseen
19 The underline function:
20 Polynomial curve fitting There are infinite functions that will fit the training data perfectly. In order to learn, we have to focus on a limited set of possible functions We call this our hypothesis space E.g., all M th order polynomial functions 2 y( x, w) w w x w x M w M x w = (w 0, w 1,, w M ) represents the unknown parameters that we wish to learn from the training data Learning here means to find a good set of parameters w to minimize some loss function 2 This optimization problem can be solved easily. We will not focus on solving this at this point, will revisit this later.
21 Important Issue: Model Selection The red line shows the function learned with different M values Which M should we choose this is a model selection problem Can we use E(w) that we define in previous slides as a criterion to choose M?
22 Over fitting As M increases, loss on the training data decreases monotonically However, the loss on test data starts to increase after a while Why? Is this a fluke or generally true? It turns out this is generally the case caused by over fitting
23 Over fitting Over fitting refers to the phenomenon when the learner adjusts to very specific random features of the training data, which differs from the target function Real example: In Bug ID project, x: image of a robotically maneuvered bug, f(x): the species of the bug Initial attempt yields close to perfect accuracy Reason: the different species were imaged in different batches, one species when imaging, has a peculiar air bubble in the image.
24 Overfitting Over fitting happens when There is too little data (or some systematic bias in the data ) There are too many parameters
25 Key Issues in Machine Learning What are good hypothesis spaces? Linear functions? Polynomials? which spaces have been useful in practical applications? How to select among different hypothesis spaces? The Model selection problem Trade off between over fitting and under fitting How can we optimize accuracy on future data points? This is often called the Generalization Error error on unseen data pts Related to the issue of overfitting, i.e., the model fitting to the peculiarities rather than the generalities of the data What level of confidence should we have in the results? (A statistical question) How much training data is required to find an accurate hypotheses with high probability? This is the topic of learning theory Are some learning problems computationally intractable? (A computational question) Some learning problems are provably hard Heuristic / greedy approaches are often used when this is the case How can we formulate application problems as machine learning problems? (the engineering question) 25
26 Terminology Training example an example of the form <x,y> x: feature vector y continuous value for regression problems class label, in [1, 2,, K], for classification problems Training Set a set of training examples drawn randomly from P(x,y) Target function the true mapping from x to y Hypothesis: a proposed function h considered by the learning algorithm to be similar to the target function. Test Set a set of training examples used to evaluate a proposed hypothesis h. Hypothesis space The space of all hypotheses that can, in principle, be output by a particular learning algorithm 26
Machine Learning Tom M. Mitchell Machine Learning Department Carnegie Mellon University. January 11, 2011
Machine Learning 10701 Tom M. Mitchell Machine Learning Department Carnegie Mellon University January 11, 2011 Today: What is machine learning? Decision tree learning Course logistics Readings: The Discipline
More informationCSE 546 Machine Learning
CSE 546 Machine Learning Instructor: Luke Zettlemoyer TA: Lydia Chilton Slides adapted from Pedro Domingos and Carlos Guestrin Logistics Instructor: Luke Zettlemoyer Email: lsz@cs Office: CSE 658 Office
More informationINTRODUCTION TO DATA SCIENCE
DATA11001 INTRODUCTION TO DATA SCIENCE EPISODE 6: MACHINE LEARNING TODAY S MENU 1. WHAT IS ML? 2. CLASSIFICATION AND REGRESSSION 3. EVALUATING PERFORMANCE & OVERFITTING WHAT IS MACHINE LEARNING? Definition:
More information18 LEARNING FROM EXAMPLES
18 LEARNING FROM EXAMPLES An intelligent agent may have to learn, for instance, the following components: A direct mapping from conditions on the current state to actions A means to infer relevant properties
More informationCS540 Machine learning Lecture 1 Introduction
CS540 Machine learning Lecture 1 Introduction Administrivia Overview Supervised learning Unsupervised learning Other kinds of learning Outline Administrivia Class web page www.cs.ubc.ca/~murphyk/teaching/cs540fall08
More informationCS545 Machine Learning
Machine learning and related fields CS545 Machine Learning Course Introduction Machine learning: the construction and study of systems that learn from data. Pattern recognition: the same field, different
More informationM. R. Ahmadzadeh Isfahan University of Technology. M. R. Ahmadzadeh Isfahan University of Technology
1 2 M. R. Ahmadzadeh Isfahan University of Technology Ahmadzadeh@cc.iut.ac.ir M. R. Ahmadzadeh Isfahan University of Technology Textbooks 3 Introduction to Machine Learning  Ethem Alpaydin Pattern Recognition
More informationSession 1: Gesture Recognition & Machine Learning Fundamentals
IAP Gesture Recognition Workshop Session 1: Gesture Recognition & Machine Learning Fundamentals Nicholas Gillian Responsive Environments, MIT Media Lab Tuesday 8th January, 2013 My Research My Research
More informationMachine Learning Tom M. Mitchell Machine Learning Department Carnegie Mellon University. January 12, 2015
Machine Learning 10601 Tom M. Mitchell Machine Learning Department Carnegie Mellon University January 12, 2015 Today: What is machine learning? Decision tree learning Course logistics Readings: The Discipline
More informationECE271A Statistical Learning I
ECE271A Statistical Learning I Nuno Vasconcelos ECE Department, UCSD The course the course is an introductory level course in statistical learning by introductory I mean that you will not need any previous
More informationPattern Classification and Clustering Spring 2006
Pattern Classification and Clustering Time: Spring 2006 Room: Instructor: Yingen Xiong Office: 621 McBryde Office Hours: Phone: 2314212 Email: yxiong@cs.vt.edu URL: http://www.cs.vt.edu/~yxiong/pcc/ Detailed
More informationP(A, B) = P(A B) = P(A) + P(B)  P(A B)
AND Probability P(A, B) = P(A B) = P(A) + P(B)  P(A B) P(A B) = P(A) + P(B)  P(A B) Area = Probability of Event AND Probability P(A, B) = P(A B) = P(A) + P(B)  P(A B) If, and only if, A and B are independent,
More informationSupervised learning can be done by choosing the hypothesis that is most probable given the data: = arg max ) = arg max
The learning problem is called realizable if the hypothesis space contains the true function; otherwise it is unrealizable On the other hand, in the name of better generalization ability it may be sensible
More informationLinear Regression. Chapter Introduction
Chapter 9 Linear Regression 9.1 Introduction In this class, we have looked at a variety of di erent models and learning methods, such as finite state machines, sequence models, and classification methods.
More informationCOMP 551 Applied Machine Learning Lecture 6: Performance evaluation. Model assessment and selection.
COMP 551 Applied Machine Learning Lecture 6: Performance evaluation. Model assessment and selection. Instructor: Herke van Hoof (herke.vanhoof@mail.mcgill.ca) Slides mostly by: Class web page: www.cs.mcgill.ca/~hvanho2/comp551
More informationIndepth: Deep learning (one lecture) Applied to both SL and RL above Code examples
Introduction to machine learning (two lectures) Supervised learning Reinforcement learning (lab) Indepth: Deep learning (one lecture) Applied to both SL and RL above Code examples 20170930 2 1 To enable
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 informationInductive Learning and Decision Trees
Inductive Learning and Decision Trees Doug Downey EECS 349 Spring 2017 with slides from Pedro Domingos, Bryan Pardo Outline Announcements Homework #1 was assigned on Monday (due in five days!) Inductive
More informationMachine Learning 2nd Edition
INTRODUCTION TO Lecture Slides for Machine Learning 2nd Edition ETHEM ALPAYDIN, modified by Leonardo Bobadilla and some parts from http://www.cs.tau.ac.il/~apartzin/machinelearning/ The MIT Press, 2010
More informationIntroduction to Pattern Recognition
Introduction to Pattern Recognition Selim Aksoy Department of Computer Engineering Bilkent University saksoy@cs.bilkent.edu.tr CS 551, Fall 2017 CS 551, Fall 2017 c 2017, Selim Aksoy (Bilkent University)
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 information10702: Statistical Machine Learning
10702: Statistical Machine Learning Syllabus, Spring 2010 http://www.cs.cmu.edu/~10702 Statistical Machine Learning is a second graduate level course in machine learning, assuming students have taken
More information36350: Data Mining. Fall Lectures: Monday, Wednesday and Friday, 10:30 11:20, Porter Hall 226B
36350: Data Mining Fall 2009 Instructor: Cosma Shalizi, Statistics Dept., Baker Hall 229C, cshalizi@stat.cmu.edu Teaching Assistant: Joseph Richards, jwrichar@stat.cmu.edu Lectures: Monday, Wednesday
More informationLecture 1: Introduc4on
CSC2515 Spring 2014 Introduc4on to Machine Learning Lecture 1: Introduc4on All lecture slides will be available as.pdf on the course website: http://www.cs.toronto.edu/~urtasun/courses/csc2515/csc2515_winter15.html
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 informationLinear Regression: Predicting House Prices
Linear Regression: Predicting House Prices I am big fan of Kalid Azad writings. He has a knack of explaining hard mathematical concepts like Calculus in simple words and helps the readers to get the intuition
More informationCOMP 551 Applied Machine Learning Lecture 6: Performance evaluation. Model assessment and selection.
COMP 551 Applied Machine Learning Lecture 6: Performance evaluation. Model assessment and selection. Instructor: (jpineau@cs.mcgill.ca) Class web page: www.cs.mcgill.ca/~jpineau/comp551 Unless otherwise
More informationCS 445/545 Machine Learning Winter, 2017
CS 445/545 Machine Learning Winter, 2017 See syllabus at http://web.cecs.pdx.edu/~mm/machinelearningwinter2017/ Lecture slides will be posted on this website before each class. What is machine learning?
More informationLecture 1. Introduction Bastian Leibe Visual Computing Institute RWTH Aachen University
Advanced Machine Learning Lecture 1 Introduction 20.10.2015 Bastian Leibe Visual Computing Institute RWTH Aachen University http://www.vision.rwthaachen.de/ leibe@vision.rwthaachen.de Organization Lecturer
More informationLearning Agents: Introduction
Learning Agents: Introduction S Luz luzs@cs.tcd.ie October 28, 2014 Learning in agent architectures Agent Learning in agent architectures Agent Learning in agent architectures Agent perception Learning
More informationCPSC 340: Machine Learning and Data Mining. Course Review/Preview Fall 2015
CPSC 340: Machine Learning and Data Mining Course Review/Preview Fall 2015 Admin Assignment 6 due now. We will have office hours as usual next week. Final exam details: December 15: 8:3011 (WESB 100).
More informationMachine Learning. Outline. Reinforcement learning 2. Defining an RL problem. Solving an RL problem. Miscellaneous. Eric Xing /15
Machine Learning 10701/15 701/15781, 781, Spring 2008 Reinforcement learning 2 Eric Xing Lecture 28, April 30, 2008 Reading: Chap. 13, T.M. book Eric Xing 1 Outline Defining an RL problem Markov Decision
More informationLinear Models Continued: Perceptron & Logistic Regression
Linear Models Continued: Perceptron & Logistic Regression CMSC 723 / LING 723 / INST 725 Marine Carpuat Slides credit: Graham Neubig, Jacob Eisenstein Linear Models for Classification Feature function
More informationMachine Learning. Basic Concepts. Joakim Nivre. Machine Learning 1(24)
Machine Learning Basic Concepts Joakim Nivre Uppsala University and Växjö University, Sweden Email: nivre@msi.vxu.se Machine Learning 1(24) Machine Learning Idea: Synthesize computer programs by learning
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 302 Lecture Timings Monday 9.5510.45am
More informationCS Machine Learning
CS 478  Machine Learning Projects Data Representation Basic testing and evaluation schemes CS 478 Data and Testing 1 Programming Issues l Program in any platform you want l Realize that you will be doing
More informationApplied Mathematics. Dr. Carlos Marques, Chair Mathematics Dept School of Arts & Sciences
Applied Mathematics Dr. Carlos Marques, Chair Mathematics Dept. Carlos.Marques@farmingdale.edu 6314202182 School of Arts & Sciences Bachelor of Science Degree The Applied Mathematics Bachelor of Science
More informationInductive Learning and Decision Trees
Inductive Learning and Decision Trees Doug Downey EECS 349 Winter 2014 with slides from Pedro Domingos, Bryan Pardo Outline Announcements Homework #1 assigned Have you completed it? Inductive learning
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 informationDudon Wai Georgia Institute of Technology CS 7641: Machine Learning Atlanta, GA
Adult Income and Letter Recognition  Supervised Learning Report An objective look at classifier performance for predicting adult income and Letter Recognition Dudon Wai Georgia Institute of Technology
More informationApplied Machine Learning Lecture 1: Introduction
Applied Machine Learning Lecture 1: Introduction Richard Johansson January 16, 2018 welcome to the course! machine learning is getting increasingly popular among students our courses are full! many thesis
More informationThe Health Economics and Outcomes Research Applications and Valuation of Digital Health Technologies and Machine Learning
The Health Economics and Outcomes Research Applications and Valuation of Digital Health Technologies and Machine Learning Workshop W29  Session V 3:00 4:00pm May 25, 2016 ISPOR 21 st Annual International
More informationMachine Learning B, Fall 2016
Machine Learning 10601 B, Fall 2016 Decision Trees (Summary) Lecture 2, 08/31/ 2016 MariaFlorina (Nina) Balcan Learning Decision Trees. Supervised Classification. Useful Readings: Mitchell, Chapter 3
More informationCSC 411 MACHINE LEARNING and DATA MINING
CSC 411 MACHINE LEARNING and DATA MINING Lectures: Monday, Wednesday 121 (section 1), 34 (section 2) Lecture Room: MP 134 (section 1); Bahen 1200 (section 2) Instructor (section 1): Richard Zemel Instructor
More informationUnsupervised Learning
17s1: COMP9417 Machine Learning and Data Mining Unsupervised Learning May 2, 2017 Acknowledgement: Material derived from slides for the book Machine Learning, Tom M. Mitchell, McGrawHill, 1997 http://www2.cs.cmu.edu/~tom/mlbook.html
More informationComputer Vision for Card Games
Computer Vision for Card Games Matias Castillo matiasct@stanford.edu Benjamin Goeing bgoeing@stanford.edu Jesper Westell jesperw@stanford.edu Abstract For this project, we designed a computer vision program
More informationBig Data Analytics Clustering and Classification
E6893 Big Data Analytics Lecture 4: Big Data Analytics Clustering and Classification ChingYung Lin, Ph.D. Adjunct Professor, Dept. of Electrical Engineering and Computer Science September 28th, 2017 1
More informationMachine Learning in Patent Analytics:: Binary Classification for Prioritizing Search Results
Machine Learning in Patent Analytics:: Binary Classification for Prioritizing Search Results Anthony Trippe Managing Director, Patinformatics, LLC Patent Information Fair & Conference November 10, 2017
More informationOverview COEN 296 Topics in Computer Engineering Introduction to Pattern Recognition and Data Mining Course Goals Syllabus
Overview COEN 296 Topics in Computer Engineering to Pattern Recognition and Data Mining Instructor: Dr. Giovanni Seni G.Seni@ieee.org Department of Computer Engineering Santa Clara University Course Goals
More informationIntroduction to Machine Learning for NLP I
Introduction to Machine Learning for NLP I Benjamin Roth CIS LMU München Benjamin Roth (CIS LMU München) Introduction to Machine Learning for NLP I 1 / 49 Outline 1 This Course 2 Overview 3 Machine Learning
More informationCS519: Deep Learning. Winter Fuxin Li
CS519: Deep Learning Winter 2017 Fuxin Li Course Information Instructor: Dr. Fuxin Li KEC 2077, lif@eecs.oregonstate.edu TA: Mingbo Ma: mam@oregonstate.edu Xu Xu: xux@oregonstate.edu My office hour: TBD
More informationDecision Tree for Playing Tennis
Decision Tree Decision Tree for Playing Tennis (outlook=sunny, wind=strong, humidity=normal,? ) DT for prediction Csection risks Characteristics of Decision Trees Decision trees have many appealing properties
More informationA Few Useful Things to Know about Machine Learning. Pedro Domingos Department of Computer Science and Engineering University of Washington" 2012"
A Few Useful Things to Know about Machine Learning Pedro Domingos Department of Computer Science and Engineering University of Washington 2012 A Few Useful Things to Know about Machine Learning Machine
More informationProblems to think about
1 Course Contents This course is the part of the mathematics and computer science disciplines, devoted to the study of discrete (as opposed to continuous) objects. Calculus deals with continuous objects
More informationIntroduction to Ensemble Learning Featuring Successes in the Netflix Prize Competition
Introduction to Ensemble Learning Featuring Successes in the Netflix Prize Competition Todd Holloway Two Lecture Series for B551 November 20 & 27, 2007 Indiana University Outline Introduction Bias and
More informationReinforcement Learning with Deep Architectures
000 001 002 003 004 005 006 007 008 009 010 011 012 013 014 015 016 017 018 019 020 021 022 023 024 025 026 027 028 029 030 031 032 033 034 035 036 037 038 039 040 041 042 043 044 045 046 047 048 049 050
More informationAbout This Specialization
About This Specialization The 5 courses in this University of Michigan specialization introduce learners to data science through the python programming language. This skillsbased specialization is intended
More informationBird Species Identification from an Image
Bird Species Identification from an Image Aditya Bhandari, 1 Ameya Joshi, 2 Rohit Patki 3 1 Department of Computer Science, Stanford University 2 Department of Electrical Engineering, Stanford University
More informationCOLLEGE OF SCIENCE. School of Mathematical Sciences. NEW (or REVISED) COURSE: COSSTAT747 Principles of Statistical Data Mining.
ROCHESTER INSTITUTE OF TECHNOLOGY COURSE OUTLINE FORM COLLEGE OF SCIENCE School of Mathematical Sciences NEW (or REVISED) COURSE: COSSTAT747 Principles of Statistical Data Mining 1.0 Course Designations
More informationCSC 411: Lecture 01: Introduction
CSC 411: Lecture 01: Introduction Richard Zemel, Raquel Urtasun and Sanja Fidler University of Toronto Zemel, Urtasun, Fidler (UofT) CSC 411: 01Introduction 1 / 44 Today Administration details Why is
More informationCourse 395: Machine Learning  Lectures
Course 395: Machine Learning  Lectures Lecture 12: Concept Learning (M. Pantic) Lecture 34: Decision Trees & CBC Intro (M. Pantic & S. Petridis) Lecture 56: Evaluating Hypotheses (S. Petridis) Lecture
More information10701/15781 Machine Learning, Spring 2005: Homework 1
10701/15781 Machine Learning, Spring 2005: Homework 1 Due: Monday, February 6, beginning of the class 1 [15 Points] Probability and Regression [Stano] 1 1.1 [10 Points] The Matrix Strikes Back The Matrix
More informationPredictive Analysis of Text: Concepts, Features, and Instances
of Text: Concepts, Features, and Instances Jaime Arguello jarguell@email.unc.edu August 26, 2015 of Text Objective: developing and evaluating computer programs that automatically detect a particular concept
More informationMachine Learning and Applications in Finance
Machine Learning and Applications in Finance Christian Hesse 1,2,* 1 Autobahn Equity Europe, Global Markets Equity, Deutsche Bank AG, London, UK christiana.hesse@db.com 2 Department of Computer Science,
More informationExploration vs. Exploitation. CS 473: Artificial Intelligence Reinforcement Learning II. How to Explore? Exploration Functions
CS 473: Artificial Intelligence Reinforcement Learning II Exploration vs. Exploitation Dieter Fox / University of Washington [Most slides were taken from Dan Klein and Pieter Abbeel / CS188 Intro to AI
More informationUnsupervised Learning and Dimensionality Reduction A Continued Study on Letter Recognition and Adult Income
Unsupervised Learning and Dimensionality Reduction A Continued Study on Letter Recognition and Adult Income Dudon Wai, dwai3 Georgia Institute of Technology CS 7641: Machine Learning Abstract: This paper
More informationClassification with Deep Belief Networks. HussamHebbo Jae Won Kim
Classification with Deep Belief Networks HussamHebbo Jae Won Kim Table of Contents Introduction... 3 Neural Networks... 3 Perceptron... 3 Backpropagation... 4 Deep Belief Networks (RBM, Sigmoid Belief
More informationMachine Learning for NLP
Natural Language Processing SoSe 2014 Machine Learning for NLP Dr. Mariana Neves April 30th, 2014 (based on the slides of Dr. Saeedeh Momtazi) Introduction Field of study that gives computers the ability
More informationEASTERN OREGON UNIVERSITY Mathematics
EASTERN OREGON UNIVERSITY Mathematics PROGRAM OBJECTIVES The program in mathematics has three primary objectives: To provide a major in mathematics that develops the attitude of mind and analytical skills
More informationUnit title: Analysis of Scientific Data and Information
Unit title: Analysis of Scientific Data and Information Unit code: F/601/0220 QCF level: 4 Credit value: 15 Aim This unit develops skills in mathematical and statistical techniques used in the analysis
More informationDS 502/MA 543 STATISTICAL METHODS FOR DATA SCIENCE
DS 502/MA 543 STATISTICAL METHODS FOR DATA SCIENCE This course surveys the statistical methods most useful in data science applications. Topics covered include predictive modeling methods, including multiple
More informationCrossDomain Video Concept Detection Using Adaptive SVMs
CrossDomain Video Concept Detection Using Adaptive SVMs AUTHORS: JUN YANG, RONG YAN, ALEXANDER G. HAUPTMANN PRESENTATION: JESSE DAVIS CS 3710 VISUAL RECOGNITION ProblemIdeaChallenges Address accuracy
More informationMachine Learning with Weka
Machine Learning with Weka SLIDES BY (TOTAL 5 Session of 1.5 Hours Each) ANJALI GOYAL & ASHISH SUREKA (www.ashishsureka.in) CS 309 INFORMATION RETRIEVAL COURSE ASHOKA UNIVERSITY NOTE: Slides created and
More informationMAT 119 STATISTICS AND ELEMENTARY ALGEBRA 5 Lecture Hours, 2 Lab Hours, 3 Credits Office Hours: PreRequisite: MAT 095 or placement in MAT 096
LAGUARDIA COMMUNITY COLLEGE CITY UNIVERSITY OF NEW YORK DEPARTMENT OF MATHEMATICS, ENGINEERING, AND COMPUTER SCIENCE MAT 119 STATISTICS AND ELEMENTARY ALGEBRA Instructor Name: 5 Lecture Hours, 2 Lab Hours,
More informationMachine Learning and Pattern Recognition Introduction
Machine Learning and Pattern Recognition Introduction Giovanni Maria Farinella gfarinella@dmi.unict.it www.dmi.unict.it/farinella What is ML & PR? Interdisciplinary field focusing on both the mathematical
More informationCS 1301 Homework 6 Stoplight Due: Friday, October 24th, before 11:55pm PM EST. Out of 130 points Files to submit: hw6.py
CS 1301 Homework 6 Stoplight Due: Friday, October 24th, before 11:55pm PM EST. Out of 130 points Files to submit: hw6.py For Help:  TA Helpdesk Schedule posted on class website.  Email TAs Notes: PAIR
More informationStat 215 Syllabus Spring 2016
Stat 215 Syllabus Spring 2016 Instructor: Prof. Robert Mnatsakanov Email: Robert.Mnatsakanov@mail.wvu.edu Lecture Time: 10:00 11:00 am T R Class Location: 259 Hodges Hall Lab Location: G33 Eisland Hall
More informationA Practical Tour of Ensemble (Machine) Learning
A Practical Tour of Ensemble (Machine) Learning Nima Hejazi Evan Muzzall Division of Biostatistics, University of California, Berkeley DLab, University of California, Berkeley slides: https://googl/wwaqc
More informationMachine Learning for SAS Programmers
Machine Learning for SAS Programmers The Agenda Introduction of Machine Learning Supervised and Unsupervised Machine Learning Deep Neural Network Machine Learning implementation Questions and Discussion
More informationCS 4510/9010 Applied Machine Learning. Evaluation. Paula Matuszek Fall, copyright Paula Matuszek 2016
CS 4510/9010 Applied Machine Learning 1 Evaluation Paula Matuszek Fall, 2016 Evaluating Classifiers 2 With a decision tree, or with any classifier, we need to know how well our trained model performs on
More informationCOURSE SYLLABUS MATH 2311
COURSE SYLLABUS MATH 2311 ****************************************************************************** YEAR COURSE OFFERED: 2017 SEMESTER COURSE OFFERED: Spring Session DEPARTMENT: MATH COURSE NUMBER:
More informationAzure Machine Learning. Designing Iris MultiClass Classifier
Media Partners Azure Machine Learning Designing Iris MultiClass Classifier Marcin Szeliga 20 years of experience with SQL Server Trainer & data platform architect Books & articles writer Speaker at numerous
More informationDEPARTMENT OF FINANCE MCCOMBS SCHOOL OF BUSINESS UNIVERSITY OF TEXAS AT AUSTIN. Finance 367: Investment Management. Spring 2008
DEPARTMENT OF FINANCE MCCOMBS SCHOOL OF BUSINESS UNIVERSITY OF TEXAS AT AUSTIN Finance 367: Investment Management Spring 2008 Monday & Wednesday 08:0009:30, UTC 1.104, unique #02945 Monday & Wednesday
More information36217: Probability Theory and Random Processes Fall 1997 MWF 3:30 4:20 DH 2210 Course Policies and Syllabus
Vital Information 36217: Probability Theory and Random Processes Fall 1997 MWF 3:30 4:20 DH 2210 Course Policies and Syllabus Instructor: Pantelis Vlachos, Statistics 232K Baker Hall 2681883 vlachos@stat.cmu.edu
More informationNeural Network Ensembles, Cross Validation, and Active Learning
Neural Network Ensembles, Cross Validation, and Active Learning Anders Krogh" Nordita Blegdamsvej 17 2100 Copenhagen, Denmark Jesper Vedelsby Electronics Institute, Building 349 Technical University of
More informationAdaptive Cluster Ensemble Selection
Adaptive Cluster Ensemble Selection Javad Azimi, Xiaoli Fern Department of Electrical Engineering and Computer Science Oregon State University {Azimi, xfern}@eecs.oregonstate.edu Abstract Cluster ensembles
More informationMathematical Sciences
Mathematical Sciences Associate Professors McKenzie R. Lamb (Chair), David W. Scott, Andrea N. Young Visiting Professors Mark A. Krines, William S. Retert Communicating Plus  Mathematical Sciences: Students
More informationLahore University of Management Sciences. DISC 420 Business Analytics Fall Semester 2017
DISC 420 Business Analytics Fall Semester 2017 Instructors Zainab Riaz Room No. SDSB 4 38 Office Hours TBA Email zainab.riaz@lums.edu.pk Telephone 5130 Secretary/TA Sec: Muhammad Umer Manzoor, TA: TBA
More informationLECTURE #1 SEPTEMBER 25, 2015
RATIONALITY, HEURISTICS, AND THE COST OF COMPUTATION CSML Talks LECTURE #1 SEPTEMBER 25, 2015 LECTURER: TOM GRIFFITHS (PSYCHOLOGY DEPT., U.C. BERKELEY) SCRIBE: KIRAN VODRAHALLI Contents 1 Introduction
More informationIntroduction to Machine Learning
1, DATA11002 Introduction to Machine Learning Lecturer: Teemu Roos TAs: Ville Hyvönen and Janne Leppäaho Department of Computer Science University of Helsinki (based in part on material by Patrik Hoyer
More informationScheduling Tasks under Constraints CS229 Final Project
Scheduling Tasks under Constraints CS229 Final Project Mike Yu myu3@stanford.edu Dennis Xu dennisx@stanford.edu Kevin Moody kmoody@stanford.edu Abstract The project is based on the principle of unconventional
More informationActive Learning. Yingyu Liang Computer Sciences 760 Fall
Active Learning Yingyu Liang Computer Sciences 760 Fall 2017 http://pages.cs.wisc.edu/~yliang/cs760/ Some of the slides in these lectures have been adapted/borrowed from materials developed by Mark Craven,
More informationIntroduction to Data Science I
Introduction to Data Science I From Introduction to Data Science Contents 1 Course outline for COMPSCI 4414A/9637A/9114A 1.1 Objective 1.2 Prerequisites 1.3 Logistics 1.4 Important Dates 1.5 Materials
More informationAlgebra 1, Quarter 3, Unit 3.1. Line of Best Fit. Overview
Algebra 1, Quarter 3, Unit 3.1 Line of Best Fit Overview Number of instructional days 6 (1 day assessment) (1 day = 45 minutes) Content to be learned Analyze scatter plots and construct the line of best
More informationReinforcement Learning
Reinforcement Learning LU 1  Introduction Dr. Joschka Bödecker AG Maschinelles Lernen und Natürlichsprachliche Systeme AlbertLudwigsUniversität Freiburg jboedeck@informatik.unifreiburg.de Acknowledgement
More informationGradual Forgetting for Adaptation to Concept Drift
Gradual Forgetting for Adaptation to Concept Drift Ivan Koychev GMD FIT.MMK D53754 Sankt Augustin, Germany phone: +49 2241 14 2194, fax: +49 2241 14 2146 Ivan.Koychev@gmd.de Abstract The paper presents
More informationHAMLET JERRY ZHU UNIVERSITY OF WISCONSIN
HAMLET JERRY ZHU UNIVERSITY OF WISCONSIN Collaborators: Rui Castro, Michael Coen, Ricki Colman, Charles Kalish, Joseph Kemnitz, Robert Nowak, Ruichen Qian, Shelley Prudom, Timothy Rogers Somewhere, something
More informationRefine Decision Boundaries of a Statistical Ensemble by Active Learning
Refine Decision Boundaries of a Statistical Ensemble by Active Learning a b * Dingsheng Luo and Ke Chen a National Laboratory on Machine Perception and Center for Information Science, Peking University,
More informationDetection of Insults in Social Commentary
Detection of Insults in Social Commentary CS 229: Machine Learning Kevin Heh December 13, 2013 1. Introduction The abundance of public discussion spaces on the Internet has in many ways changed how we
More information