CHAPTER 1: Introduction. 2 Why “Learn”? Machine learning is programming computers to optimize a performance criterion using example data or past experience.

Slides:

Advertisements

Similar presentations

Pseudo-Relevance Feedback For Multimedia Retrieval By Rong Yan, Alexander G. and Rong Jin Mwangi S. Kariuki

Advertisements

CHAPTER 1: Introduction

CMPUT 615 Applications of Machine Learning in Image Analysis

Feature Selection as Relevant Information Encoding Naftali Tishby School of Computer Science and Engineering The Hebrew University, Jerusalem, Israel NIPS.

INTRODUCTION TO MACHINE LEARNING David Kauchak CS 451 – Fall 2013.

Unsupervised learning

Clustering & image segmentation Goal::Identify groups of pixels that go together Segmentation.

Machine Learning and Data Mining Clustering

Clustering CMPUT 466/551 Nilanjan Ray. What is Clustering? Attach label to each observation or data points in a set You can say this “unsupervised classification”

Unsupervised learning: Clustering Ata Kaban The University of Birmingham

ETHEM ALPAYDIN © The MIT Press, Lecture Slides for.

MACHINE LEARNING 1. Introduction. What is Machine Learning? Based on E Alpaydın 2004 Introduction to Machine Learning © The MIT Press (V1.1) 2  Need.

ETHEM ALPAYDIN © The MIT Press, Lecture Slides for.

Introduction to Machine Learning Anjeli Singh Computer Science and Software Engineering April 28 th 2008.

CIS 678 Artificial Intelligence problems deduction, reasoning knowledge representation planning learning natural language processing motion and manipulation.

Machine Vision and Dig. Image Analysis 1 Prof. Heikki Kälviäinen C50A6100 Lectures 12: Object Recognition Professor Heikki Kälviäinen Machine Vision and.

Clustering. 2 Outline  Introduction  K-means clustering  Hierarchical clustering: COBWEB.

INTRODUCTION TO Machine Learning ETHEM ALPAYDIN © The MIT Press, Lecture Slides for.

INTRODUCTION TO Machine Learning ETHEM ALPAYDIN © The MIT Press, Lecture Slides for.

INTRODUCTION TO Machine Learning 3rd Edition

Introduction to Data Mining Data mining is a rapidly growing field of business analytics focused on better understanding of characteristics and.

CS Machine Learning. What is Machine Learning? Adapt to / learn from data  To optimize a performance function Can be used to:  Extract knowledge.

CSC 4510 – Machine Learning Dr. Mary-Angela Papalaskari Department of Computing Sciences Villanova University Course website:

~5,617,000 population in each state

CSE 185 Introduction to Computer Vision Pattern Recognition.

Data Mining Joyeeta Dutta-Moscato July 10, Wherever we have large amounts of data, we have the need for building systems capable of learning information.

MACHINE LEARNING 張銘軒譚恆力 1. OUTLINE OVERVIEW HOW DOSE THE MACHINE “ LEARN ” ? ADVANTAGE OF MACHINE LEARNING ALGORITHM TYPES  SUPERVISED.

Mining Discriminative Components With Low-Rank and Sparsity Constraints for Face Recognition Qiang Zhang, Baoxin Li Computer Science and Engineering Arizona.

COMMON EVALUATION FINAL PROJECT Vira Oleksyuk ECE 8110: Introduction to machine Learning and Pattern Recognition.

CSE 185 Introduction to Computer Vision Pattern Recognition 2.

Yazd University, Electrical and Computer Engineering Department Course Title: Advanced Software Engineering By: Mohammad Ali Zare Chahooki 1 Introduction.

1 Motivation Web query is usually two or three words long. –Prone to ambiguity –Example “keyboard” –Input device of computer –Musical instruments How can.

INTRODUCTION TO Machine Learning Adapted from: ETHEM ALPAYDIN Lecture Slides for.

Classification Heejune Ahn SeoulTech Last updated May. 03.

Machine Learning Tutorial Amit Gruber The Hebrew University of Jerusalem.

MACHINE LEARNING 8. Clustering. Motivation Based on E ALPAYDIN 2004 Introduction to Machine Learning © The MIT Press (V1.1) 2  Classification problem:

Chapter 11 Statistical Techniques. Data Warehouse and Data Mining Chapter 11 2 Chapter Objectives  Understand when linear regression is an appropriate.

Prepared by: Mahmoud Rafeek Al-Farra

Machine Learning Overview Tamara Berg CS 560 Artificial Intelligence Many slides throughout the course adapted from Svetlana Lazebnik, Dan Klein, Stuart.

INTRODUCTION TO MACHINE LEARNING 3RD EDITION ETHEM ALPAYDIN © The MIT Press, Lecture.

Data Mining Practical Machine Learning Tools and Techniques By I. H. Witten, E. Frank and M. A. Hall 6.8: Clustering Rodney Nielsen Many / most of these.

Radial Basis Function ANN, an alternative to back propagation, uses clustering of examples in the training set.

Machine Learning and Data Mining Clustering (adapted from) Prof. Alexander Ihler TexPoint fonts used in EMF. Read the TexPoint manual before you delete.

Compiled By: Raj Gaurang Tiwari Assistant Professor SRMGPC, Lucknow Unsupervised Learning.

Basic Machine Learning: Clustering CS 315 – Web Search and Data Mining 1.

Using decision trees to build an a framework for multivariate time- series classification 1 Present By Xiayi Kuang.

1 Pattern Recognition: Statistical and Neural Lonnie C. Ludeman Lecture 2 Nanjing University of Science & Technology.

Copyright © 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 28 Data Mining Concepts.

Clustering Machine Learning Unsupervised Learning K-means Optimization objective Random initialization Determining Number of Clusters Hierarchical Clustering.

Rodney Nielsen Many of these slides were adapted from: I. H. Witten, E. Frank and M. A. Hall Data Science Algorithms: The Basic Methods Clustering WFH:

Data Science Practical Machine Learning Tools and Techniques 6.8: Clustering Rodney Nielsen Many / most of these slides were adapted from: I. H. Witten,

Data Mining: Confluence of Multiple Disciplines Data Mining Database Systems Statistics Other Disciplines Algorithm Machine Learning Visualization.

Clustering Anna Reithmeir Data Mining Proseminar 2017

Unsupervised Learning: Clustering

Unsupervised Learning: Clustering

Machine Learning for the Quantified Self

Semi-Supervised Clustering

Machine Learning Clustering: K-means Supervised Learning

IMAGE PROCESSING RECOGNITION AND CLASSIFICATION

CH. 1: Introduction 1.1 What is Machine Learning Example:

What is Pattern Recognition?

Data Mining 資料探勘分群分析 (Cluster Analysis) Min-Yuh Day 戴敏育

Pattern Classification All materials in these slides were taken from Pattern Classification (2nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John.

Machine Learning” Lecture 1

Text Categorization Berlin Chen 2003 Reference:

Clustering Techniques

Machine learning: What is it?

Machine Learning and Data Mining Clustering

Presentation transcript:

CHAPTER 1: Introduction

2 Why “Learn”? Machine learning is programming computers to optimize a performance criterion using example data or past experience.

3 Applications Association Analysis Supervised Learning Unsupervised Learning

Learning Associations Basket analysis: P (Y | X ) probability that somebody who buys X also buys Y where X and Y are products/services. Example: P ( chips | beer ) = 0.7 Market-Basket transactions

5 Classification: Applications Aka Pattern recognition Face recognition: Pose, lighting, occlusion (glasses, beard), make-up, hair style Character recognition: Different handwriting styles. Speech recognition: Temporal dependency.  Use of a dictionary or the syntax of the language.  Sensor fusion: Combine multiple modalities; eg, visual (lip image) and acoustic for speech Medical diagnosis: From symptoms to illnesses Web Advertizing: Predict if a user clicks on an ad on the Internet.

6 Face Recognition Training examples of a person Test images AT&T Laboratories, Cambridge UK

7 Unsupervised Learning Learning “what normally happens” No output Clustering: Grouping similar instances Other applications: Summarization, Association Analysis Example applications  Customer segmentation in CRM  Image compression: Color quantization  Bioinformatics: Learning motifs

K-means Overview An unsupervised clustering algorithm “K” stands for number of clusters, it is typically a user input to the algorithm; some criteria can be used to automatically estimate K It is an approximation to an NP-hard combinatorial optimization problem K-means algorithm is iterative in nature It converges, however only a local minimum is obtained Works only for numerical data Easy to implement

K-means clustering example

K-means: summary Algorithmically, very simple to implement K-means converges, but it finds a local minimum of the cost function Works only for numerical observations K is a user input; alternatively BIC (Bayesian information criterion) or MDL (minimum description length) can be used to estimate K Outliers can considerable trouble to K-means

Hierarchical Clustering Two types: (1) agglomerative (bottom up), (2) divisive (top down) Agglomerative: two groups are merged if distance between them is less than a threshold Divisive: one group is split into two if intergroup distance more than a threshold Can be expressed by an excellent graphical representation called “dendogram”, when the process is monotonic: dissimilarity between merged clusters is increasing. Agglomerative clustering possesses this property. Not all divisive methods possess this monotonicity. Heights of nodes in a dendogram are proportional to the threshold value that produced them.

Hierarchical Clustering