CS 445/545 Machine Learning Winter, 2014 See syllabus at

Slides:



Advertisements
Similar presentations
CPSC 502, Lecture 15Slide 1 Introduction to Artificial Intelligence (AI) Computer Science cpsc502, Lecture 15 Nov, 1, 2011 Slide credit: C. Conati, S.
Advertisements

INTRODUCTION TO MACHINE LEARNING David Kauchak CS 451 – Fall 2013.
CS6501: Text Mining Course Policy
Machine Learning: Connectionist McCulloch-Pitts Neuron Perceptrons Multilayer Networks Support Vector Machines Feedback Networks Hopfield Networks.
Introduction to CS170. CS170 has multiple sections Each section has its own class websites URLs for different sections: Section 000:
CIS 678 Artificial Intelligence problems deduction, reasoning knowledge representation planning learning natural language processing motion and manipulation.
CS150 Introduction to Computer Science 1 Professor: Chadd Williams.
Logistics: –My office hours: T, Th 4-5pm or by appointment –Class Web page:
Machine Learning Bob Durrant School of Computer Science
CS 331 / CMPE 334 – Intro to AI CS 531 / CMPE AI Course Outline.
EECS 349 Machine Learning Instructor: Doug Downey Note: slides adapted from Pedro Domingos, University of Washington, CSE
CS : Artificial Intelligence: Representation and Problem Solving Fall 2002 Prof. Tuomas Sandholm Computer Science Department Carnegie Mellon University.
1 Introduction LING 575 Week 1: 1/08/08. Plan for today General information Course plan HMM and n-gram tagger (recap) EM and forward-backward algorithm.
Part I: Classification and Bayesian Learning
Introduction to machine learning
CS Machine Learning. What is Machine Learning? Adapt to / learn from data  To optimize a performance function Can be used to:  Extract knowledge.
Math 97 – Beginning Algebra Resources Spring 2010.
Please CLOSE YOUR LAPTOPS, and turn off and put away your cell phones, and get out your note-taking materials. Today’s daily quiz will be given at the.
CS 478 – Introduction1 Introduction to Machine Learning CS 478 Professor Tony Martinez.
CSCI 1301 Principles of Computer Science I
CSCI 347 – Data Mining Lecture 01 – Course Overview.
Please open Daily Quiz 34. A scientific calculator may be used on this quiz. You can keep your yellow formula sheets out when you take the quiz. Remember.
CS223 Algorithms D-Term 2013 Instructor: Mohamed Eltabakh WPI, CS Introduction Slide 1.
COMP 111 Programming Languages 1 First Day. Course COMP111 Dr. Abdul-Hameed Assawadi Office: Room AS15 – No. 2 Tel: Ext. ??
CSE 501N Fall ‘09 00: Introduction 27 August 2009 Nick Leidenfrost.
COMP Introduction to Programming Yi Hong May 13, 2015.
CS 103 Discrete Structures Lecture 01 Introduction to the Course
General Physics1 Welcome to Phys 130! Blackboard blackboard.siena.edu.
Engaged with you. SAM Getting Started with your Course in Desire2Learn Fact: 81% of students identify SAM as a key factor in preparing to use the Office.
Mehdi Ghayoumi MSB rm 132 Ofc hr: Thur, a Machine Learning.
CNS 4450 Syllabus. Context Language is a tool of thought. We rarely think without words. In solving problems by computer, we eventually get to the point.
Math Open Lab: A computer lab where Developmental Math students work on lab activities in the presence of Lab Instructors.
CS 6961: Structured Prediction Fall 2014 Course Information.
CS 445/545 Machine Learning Winter, 2012 Course overview: –Instructor Melanie Mitchell –Textbook Machine Learning: An Algorithmic Approach by Stephen Marsland.
Programming In Perl CSCI-2230 Thursday, 2pm-3:50pm Paul Lalli - Instructor.
CS 445/545 Machine Learning Spring, 2013 See syllabus at
CS 456 Advanced Algorithms Where: Engineering Bldg When: Monday & Wednesday 12:00 – 1:15 p.m. Texts: Algorithm Design, Jon Kleinberg & Eva Tardos.
Learning from observations
Matter and Interactions 1 Fall 2006 Matter & Interactions I Physics Professor & Lecturer: Dr. Reinhard Schumacher Teaching Assistants: Ms. Elisa.
Machine Learning, Decision Trees, Overfitting Machine Learning Tom M. Mitchell Machine Learning Department Carnegie Mellon University January 14,
1 How Do I Do Well In 8.02? A >= 95 = 90 = 85 B = 80 = 76 =72 C = 69 = 66 = 63 D = 59 F < 59 THIS COURSE IS NOT CURVED We want you to help your.
ICS202 Data Structures King Fahd University of Petroleum & Minerals College of Computer Science & Engineering Information & Computer Science Department.
SE-2030 Software Engineering Tools and Practices SE-2030 Dr. Mark L. Hornick 1.
Please CLOSE YOUR LAPTOPS, and turn off and put away your cell phones, and get out your note- taking materials.
1 CS 101 Today’s class will begin about 5 minutes late We will discuss the lab scheduling problems once class starts.
1 BUS 3500 MANAGEMENT INFORMATION SYSTEMS Abdou Illia, Ph.D. (Monday 8/24/2015)
Fall 2012 Professor C. Van Loan Introduction to CSE Using Matlab GUIs CS 1115.
Mohammad Alauthman 1/22/20162 This 3-credit first course for computer science & IT majors, which provides students the basic understanding.
Data Mining and Decision Support
Dr. Jeff Cummings MIS323 Business Telecommunications.
Introduction: What is AI? CMSC Introduction to Artificial Intelligence January 3, 2002.
Machine Learning Lecture 1: Intro + Decision Trees Moshe Koppel Slides adapted from Tom Mitchell and from Dan Roth.
Introduction: What is AI? CMSC Introduction to Artificial Intelligence January 7, 2003.
Teachers: If you hand back Test 4 today, tell your class you will review it with them in class on Thursday when you do the review lecture on Chapters 6,
Please CLOSE YOUR LAPTOPS, and turn off and put away your cell phones, and get out your note-taking materials.
REMINDER: If you haven’t yet passed the Gateway Quiz, make sure you take it this week! (You can find more practice quizzes online in the Gateway Info menu.
Physics 2048: Meet the Professors Tue/Thu lectures: Prof. Wiedenhöver
Lecture 00: Introduction
Who am I? Work in Probabilistic Machine Learning Like to teach 
CS6501 Advanced Topics in Information Retrieval Course Policy
CS 445/545 Machine Learning Winter, 2017
Machine Learning & Deep Learning
CS 445/545 Machine Learning Spring, 2017
Machine Learning I & II.
September 27 – Course introductions; Adts; Stacks and Queues
Artificial Intelligence (CS 461D)
Lecturer: Geoff Hulten TAs: Kousuke Ariga & Angli Liu
Lecture 00: Introduction
AI and Machine Learning
Lecturer: Geoff Hulten TAs: Alon Milchgrub, Andrew Wei
Presentation transcript:

CS 445/545 Machine Learning Winter, 2014 See syllabus at Lecture slides will be posted on this website before each class.

What is machine learning? Textbook definitions of “machine learning”: –Detecting patterns and regularities with a good and generalizable approximation (“model” or “hypothesis”) –Execution of a computer program to optimize the parameters of the model using training data or past experience.

Training Examples: Class 1Training Examples: Class 2 Test example: Class = ?

Training Examples: Class 1Training Examples: Class 2 Test example: Class = ?

Training Examples: Class 1Training Examples: Class 2 Test example: Class = ?

Training Examples: Class 1Training Examples: Class 2 Test example: Class = ?

Training Examples: Class 1Training Examples: Class 2 Test example: Class = ?

Training Examples: Class 1Training Examples: Class 2 Test example: Class = ?

Types of machine learning tasks Classification –Output is one of a number of classes (e.g., ‘A’) Regression –Output is a real value (e.g., ‘$35/share”)

Types of Machine Learning Methods Supervised –provide explicit training examples with correct answers e.g. neural networks with back-propagation Unsupervised –no feedback information is provided e.g., unsupervised clustering based on similarity

“Semi-supervised” –some feedback information is provided but it is not detailed e.g., only a fraction of examples are labeled e.g., reinforcement learning: reinforcement single is single-valued assessment of current state

Relation between “artificial intelligence” and “machine learning”?

Key Ingredients for Any Machine Learning Method Features (or “attributes”)

From: "TopShop" To: Subject: Dear mm get 77% off List-Unsubscribe: MIME-Version: 1.0 Content-Type: text/plain; charset=ISO ; format=flowed Content-Transfer-Encoding: 7bit Wassup mm, how are you?! Hurry up, last day huge discount... Our shop have more than 3085 pisl online. Buy more, pay less! Today TopSellers: ** Proepcia $ ** Levitra $ ** Ciails $ ** Vaigra $ Purchase here

Data: Instances and Features Instance: Individual example of a particular category or class 56 instances of the class “A” 6 instances of the class “B”

Data: Instances and Features Features: Collection of attributes of a single instance Feature Vector: N-dimensional vector describing a single instance

Another example of computing features f1f1 f2f2 f3f3 f4f4 f5f5 f6f6 f7f7 f8f8 f9f9 x = (f 1, f 2,..., f 64 ) = (0, 2, 13, 16, 16, 16, 2, 0, 0,...) Etc...

Notation for Instances and Features Instance: x (boldface  vector) Set of M instances: {x 1, x 2,..., x M } Instance as feature vector, with N features: x = (x 1, x 2,..., x N ) Instance as a point in an N-dimensional space: x x1x1 x2x2 x3x3

Key Ingredients for Any Machine Learning Method Features (or “attributes”) Underlying Representation for “hypothesis”, “model”, or “target function” Hypothesis space

Learning method Data: –Training data Used to train the model –Validation (or Development) data Used to select model complexity, to determine when to stop training, or to alter training method –Test data Used to evaluate trained model Evaluation method

Assumption of all ML methods: Inductive learning hypothesis: Any hypothesis that approximates target concept well over sufficiently large set of training examples will also approximate the concept well over other examples outside of the training set. Difference between “induction” and “deduction”?

Goals of this course Broad survey of modern ML methods Learn by hands-on experience Good preparation to go further in the field, with more advanced courses or self-learning

Class Syllabus

Class Logistics My office hours: M, W 2-3pm or by appt. Class Website: Mailing list: Readings / Slides: On class website Homework: Programming / lab/ problem-solving assignments –You may use any programming language –You will turn in code and lab report –Lab report will be graded Late HW policy: Students must request and be granted an extension on any homework assigment before the assignment is due. Otherwise, 5% of the assignment grade will be subtracted for each day the homework is late. Weekly Quizzes: –30 minutes, on Thursdays –1 double-sided page of notes allowed Final Exam: –Monday, March 14, 10:15am - 12:05pm –4 double-sided pages of notes allowed Grading: –Homework 50% –Quizzes 20% –Final exam 30%