stat 339 probabilistic modeling and machine learning
play

STAT 339 Probabilistic Modeling and Machine Learning 30 January - PowerPoint PPT Presentation

STAT 339 Probabilistic Modeling and Machine Learning 30 January 2017 Colin Reimer Dawson Outline Data Science and Machine Learning Types of Learning Supervised Learning Unsupervised Learning Discovering Model Complexity Course Outline


  1. STAT 339 Probabilistic Modeling and Machine Learning 30 January 2017 Colin Reimer Dawson

  2. Outline Data Science and Machine Learning Types of Learning Supervised Learning Unsupervised Learning Discovering Model Complexity Course Outline

  3. Some Cool Things you can do with data Thanks to David Shuman at Macalester College for this slide

  4. What is Machine Learning? "A computer program is said to learn from experience E with respect to some class of tasks T and performance measure P if its performance at tasks in T , as measured by P , improves with experience E ." — Tom Mitchell

  5. What is Machine Learning? "[Machine Learning is a] field of study that gives computers the ability to learn without being explicitly programmed." — Arthur Samuel

  6. Statistics, Computer Science, and Machine Learning Machine Learning

  7. Types of Learning ◮ Supervised Learning: Learning to make predictions when you have many examples of “correct answers” ◮ Classification: answer is a category / label ◮ Regression: answer is a number ◮ Unsupervised Learning: Finding structure in unlabeled data ◮ Reinforcement Learning: Finding actions that maximize long-run reward (not part of this course)

  8. Supervised Learning

  9. Supervised Learning with a Probabilistic Model ◮ Training data: { ( t i , x i ) } n i =1 ; t i = label, x i = features. ◮ Fit a model of all of the features: P ( x , t ) , or P ( t | x ) ◮ Testing: Assign P ( t new | x new , Model )

  10. Data in Higher Dimensions

  11. Data in Very High Dimensions

  12. Aside: Feature Extraction (“Eigenfaces”)

  13. Finding Clusters ◮ Clustering: Grouping data into categories without any “ground truth” information ◮ Example Application: Modeling people’s taste in movies

  14. Model-Free Clustering Model-free example: Given a distance metric, maximize distances among cluster centers; then assign points to closest center.

  15. Clustering with a Probabilistic Model 1 (a) 0.5 0.2 0.3 0.5 0 0 0.5 1 Output: A set of cluster weights and a probability distribution for each cluster

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend