Multi-variable Optimization K-means clustering K-means clustering - PowerPoint PPT Presentation

Mar 27, 2024 •276 likes •383 views

Multi-variable Optimization K-means clustering K-means clustering on points is finding K central locations that reduce the distance of each point to the nearest central location (summed over all points) K=3 K-means clustering For

Multi-variable Optimization
K-means clustering K-means clustering on points is finding K “central locations” that reduce the distance of each point to the nearest “central location” (summed over all points) K=3
K-means clustering For examples like the previous one, it is easy to find which points should be “grouped together” Once you have a group of points, you can mathematically find the best “central location” (“center of mass” with equally massive points)
K-means clustering Suppose you wanted to find the best spot to put 5 “central locations” here:
K-means clustering Suppose you wanted to find the best spot to put 5 “central locations” here: far from any center? dense? dense dense?? dense dense
K-means clustering Turns out you can do this the other way around as well... If you have the “central locations” (x,y) coordinates, you can find which location all points should go to (minimum distance)
Other random topics We have a problem: 1. If we knew point groupings, we could find the best central locations 2. If we knew central locations positions, we could find point groupings
Other random topics One common way to solve this issue when you have multiple unknowns that depend on each other is to simply guess, then try to optimize So, initially just make random groupings Then find the best central locations base off of the groupings Then find the best groupings... and repeat
Other random topics If you set up the problem correctly (and have a “well behaved” metric), this will converge In fact, you can do this even if you have more than two unknowns Just make one variable while fixing all others and optimize that one ... then pick a new variable to “optimize”
Other random topics This technique actually works in a large range of settings: K-means clustering (this) Bayesian networks (probabilistic reasoning) Markov Decision Processes (policy selection) Expectation–Maximization (parameter optimization)

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

1 K-means clustering The K-means clustering algorithm can be seen as applying the EM algorithm to

Statistical Modeling and Analysis of Neural Data (NEU 560) Princeton University, Spring 2018 Jonathan Pillow Lecture 18 notes: K-means and Factor Analysis Tues, 4.17 1 K-means clustering The K-means clustering algorithm can be seen as

547 views • 3 slides

Clustering: Hierarchical Clustering and K- Means Clustering Machine

Clustering: Hierarchical Clustering and K- Means Clustering Machine Learning 10-601B Seyoung Kim Many of these slides are derived from William Cohen,

660 views • 46 slides

Clustering and Dimensionality Reduction Preview Clustering K -means clustering

Clustering and Dimensionality Reduction Preview Clustering K -means clustering Mixture models Hierarchical clustering Dimensionality reduction Principal component analysis Multidimensional scaling Isomap

1.61k views • 17 slides

k -means clustering Method to automatically separate data sets into distinct groups. Clustering

k -means clustering Method to automatically separate data sets into distinct groups. Clustering example Clustering example k -means clustering algorithm 1. Start with k randomly chosen means 2. Color data points by the shortest distance to any

1.56k views • 19 slides

Data Clustering: Data Clustering: 50 Years Beyond K means 50 Years Beyond K means 50 Years

Data Clustering: Data Clustering: 50 Years Beyond K means 50 Years Beyond K means 50 Years Beyond K-means 50 Years Beyond K-means Anil K. Jain Department of Computer Science Michigan State University King-Sun Fu King-Sun Fu King-Sun

1.03k views • 39 slides

Basics of k-means clustering CLUS TERIN G METH ODS W ITH S CIP Y Shaumik Daityari Business

Basics of k-means clustering CLUS TERIN G METH ODS W ITH S CIP Y Shaumik Daityari Business Analyst Why k-means clustering? A critical drawback of hierarchical clustering: runtime K means runs signicantly faster on large datasets

691 views • 25 slides

Contents Clustering K-means Mixture of Gaussians Expectation Maximization

Contents Clustering K-means Mixture of Gaussians Expectation Maximization Variational Methods 1 Introduction to Machine Learning CMU-10701 Clustering and EM Barnabs Pczos & Aarti Singh Clustering 3 K- means

1.04k views • 67 slides

Introduction to Machine Learning, Clustering and EM Barnab s P czos Contents Clustering

Introduction to Machine Learning, Clustering and EM Barnab s P czos Contents Clustering K-means Mixture of Gaussians Expectation Maximization Variational Methods 2 Clustering 3 K- means clustering What is clustering?

1.32k views • 66 slides

LECTURE 7 Clustering The k-means algorithm Hierarchical Clustering The DBSCAN algorithm

DATA MINING LECTURE 7 Clustering The k-means algorithm Hierarchical Clustering The DBSCAN algorithm Clustering Evaluation What is a Clustering? In general a grouping of objects such that the objects in a group (cluster) are similar (or

1.39k views • 110 slides

Clustering kMeans, Expectation Maximization, Self-Organizing Maps Outline K-means

Clustering kMeans, Expectation Maximization, Self-Organizing Maps Outline K-means clustering Hierarchical clustering Incremental clustering Probability-based clustering Self-Organising Maps Classification vs. Clustering

1k views • 67 slides

Lecture 23: Spectral clustering Hierarchical clustering What is a good clustering?

Lecture 23: Spectral clustering Hierarchical clustering What is a good clustering? Aykut Erdem May 2016 Hacettepe University Last time K-Means An iterative clustering algorithm - Initialize: Pick K random points as cluster

932 views • 64 slides

K-MEANS++ OPTIMAL INITIALIZATION ALGORITHM An Improved K-means Clustering Method OVERVIEW

K-MEANS++ OPTIMAL INITIALIZATION ALGORITHM An Improved K-means Clustering Method OVERVIEW K-means Clustering Algorithm K-means++ Initialization Algorithm Experiment Datasets Conclusion K-MEANS CLUSTERING ALGORITHM A

313 views • 14 slides

Graph Clustering Graph Clustering What is clustering? What is clustering? Finding patterns

Graph Clustering Graph Clustering What is clustering? What is clustering? Finding patterns in data, or grouping similar groups of data-points together into clusters . Clustering algorithms for numeric data: Lloyds K-means, EM

688 views • 19 slides

K -means Clustering Ke Chen Reading: [7.3, EA], [9.1, CMB] COMP24111 Machine Learning Outline

K -means Clustering Ke Chen Reading: [7.3, EA], [9.1, CMB] COMP24111 Machine Learning Outline Introduction K -means Algorithm Example How K -means partitions? K -means Demo Relevant Issues Application:

416 views • 22 slides

EM, K-Means, GNG 4-6-16 Reading Quiz Which of the following can be considered an instance of the

EM, K-Means, GNG 4-6-16 Reading Quiz Which of the following can be considered an instance of the EM algorithm? a) Agglomerative clustering b) Divisive clustering c) K-means clustering d) Growing neural gas EM algorithm E step:

445 views • 17 slides

Clustering Reference:http://www.elet.polimi.it/upload/matteucc/Clustering/tutorial_html/ Dr Ahmed

Clustering Reference:http://www.elet.polimi.it/upload/matteucc/Clustering/tutorial_html/ Dr Ahmed Rafea Outline Introduction Clustering Algorithms K-means Fuzzy C-means Hierarchical clustering Introduction(1)

394 views • 23 slides

United States Court of Appeals for the Federal Circuit 2008-1448 (Opposition No. 91/157,315) IN

United States Court of Appeals for the Federal Circuit 2008-1448 (Opposition No. 91/157,315) IN RE BOSE CORPORATION, Appellant. Charles Hieken, Fish & Richardson P.C., of Boston, Massachusetts, argued for appellant. With him on the brief

319 views • 12 slides

2010 Full Year Results 2010 Full Year Results - Vasco CIS abstract Presentation to Analysts and

2010 Full Year Results 2010 Full Year Results - Vasco CIS abstract Presentation to Analysts and Investors 21 March 2011 Full year results ended 31 December 2010 - 1 Update on business initiatives Bob Kunze-Concewitz, CEO Full year results ended

574 views • 3 slides

Chocolate is our business, finest chocolate We are never satisfied! We continue to that can be

Chocolate Lake Company for Chocolate & Sweet CHOCOLAKE Manufacturing Chocolate is our business, finest chocolate We are never satisfied! We continue to that can be relied on. Having the customer improve in every area of our business, at

326 views • 3 slides

A Centralized Monitoring Infrastructure For Improving DNS Security Manos Antonakakis David Dagon

Challenges in DNS poisoning detection The attack vector Methodology Poisoning Detection Conclusions A Centralized Monitoring Infrastructure For Improving DNS Security Manos Antonakakis David Dagon Luo Daniel Xiapu Roberto Perdisci

691 views • 41 slides

CINEMATEK 25 YEARS OF EU CO-FUNDED PROJECTS CINEMATEK A Foundation of public interest

CINEMATEK 25 YEARS OF EU CO-FUNDED PROJECTS CINEMATEK A Foundation of public interest (founded in 1938) Preserve & share film & non-film collections Naturally linked to different kinds of partners Key role in the network of

276 views • 6 slides

BOARD MEETING Marketing & PR Update May 11, 2020 CCCTA 05/11/20 Agenda Item #13C Marketing

BOARD MEETING Marketing & PR Update May 11, 2020 CCCTA 05/11/20 Agenda Item #13C Marketing & PR Presentation Page 1 of 12 THE EVOLUTION OF OUR MARKETING EFFORTS SINCE COVID-19 CCCTA 05/11/20 Agenda Item #13C Marketing & PR

233 views • 12 slides

The role of EERI in NEHRP post-earthquake investigations Heidi Tremayne , EERI Executive Director

The role of EERI in NEHRP post-earthquake investigations Heidi Tremayne , EERI Executive Director Maggie Ortiz-Millan, EERI Program Manager ACEHR Meeting March 26, 2020 Earthquake Engineering Research Institute engineers, About EERI

452 views • 24 slides

Intro(vert) to Networking: A Guide for Both Extroverts and Introverts Hosted By: Alvin

8/29/2019 1 Intro(vert) to Networking: A Guide for Both Extroverts and Introverts Hosted By: Alvin Pilobello and Elyse Rester 2 1 8/29/2019 How to Participate Today Audio Modes Listen using Mic & S peakers Or,

404 views • 9 slides