DOC PREVIEW
Princeton COS 424 - Clustering and the k-means Algorithm

This preview shows page 1-2-3-4-5-6-7-8-9-60-61-62-63-64-65-66-67-120-121-122-123-124-125-126-127-128 out of 128 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 128 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 128 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 128 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 128 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 128 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 128 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 128 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 128 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 128 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 128 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 128 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 128 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 128 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 128 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 128 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 128 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 128 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 128 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 128 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 128 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 128 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 128 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 128 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 128 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 128 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 128 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 128 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Clustering and the k-means AlgorithmDavid M. BleiCOS424Princeton UniversityMarch 11, 2007D. Blei Clustering 01 1 / 32Clustering•Goal: Automatically segment data into groups of similar points•Question: When and why would we want to do this?•Useful for:•Automatically organizing data•Understanding hidden structure in some data•Representing high-dimensional data in a low-dimensional space•Examples:•Customers according to purchase histories•Genes according to expression profile•Search results according to topic•MySpace users according to interests•A museum catalog according to image similarityD. Blei Clustering 01 2 / 32Clustering•Goal: Automatically segment data into groups of similar points•Question: When and why would we want to do this?•Useful for:•Automatically organizing data•Understanding hidden structure in some data•Representing high-dimensional data in a low-dimensional space•Examples:•Customers according to purchase histories•Genes according to expression profile•Search results according to topic•MySpace users according to interests•A museum catalog according to image similarityD. Blei Clustering 01 2 / 32Clustering•Goal: Automatically segment data into groups of similar points•Question: When and why would we want to do this?•Useful for:•Automatically organizing data•Understanding hidden structure in some data•Representing high-dimensional data in a low-dimensional space•Examples:•Customers according to purchase histories•Genes according to expression profile•Search results according to topic•MySpace users according to interests•A museum catalog according to image similarityD. Blei Clustering 01 2 / 32Clustering•Goal: Automatically segment data into groups of similar points•Question: When and why would we want to do this?•Useful for:•Automatically organizing data•Understanding hidden structure in some data•Representing high-dimensional data in a low-dimensional space•Examples:•Customers according to purchase histories•Genes according to expression profile•Search results according to topic•MySpace users according to interests•A museum catalog according to image similarityD. Blei Clustering 01 2 / 32Clustering•Goal: Automatically segment data into groups of similar points•Question: When and why would we want to do this?•Useful for:•Automatically organizing data•Understanding hidden structure in some data•Representing high-dimensional data in a low-dimensional space•Examples:•Customers according to purchase histories•Genes according to expression profile•Search results according to topic•MySpace users according to interests•A museum catalog according to image similarityD. Blei Clustering 01 2 / 32Clustering•Goal: Automatically segment data into groups of similar points•Question: When and why would we want to do this?•Useful for:•Automatically organizing data•Understanding hidden structure in some data•Representing high-dimensional data in a low-dimensional space•Examples:•Customers according to purchase histories•Genes according to expression profile•Search results according to topic•MySpace users according to interests•A museum catalog according to image similarityD. Blei Clustering 01 2 / 32Clustering•Goal: Automatically segment data into groups of similar points•Question: When and why would we want to do this?•Useful for:•Automatically organizing data•Understanding hidden structure in some data•Representing high-dimensional data in a low-dimensional space•Examples:•Customers according to purchase histories•Genes according to expression profile•Search results according to topic•MySpace users according to interests•A museum catalog according to image similarityD. Blei Clustering 01 2 / 32Clustering•Goal: Automatically segment data into groups of similar points•Question: When and why would we want to do this?•Useful for:•Automatically organizing data•Understanding hidden structure in some data•Representing high-dimensional data in a low-dimensional space•Examples:•Customers according to purchase histories•Genes according to expression profile•Search results according to topic•MySpace users according to interests•A museum catalog according to image similarityD. Blei Clustering 01 2 / 32Clustering•Goal: Automatically segment data into groups of similar points•Question: When and why would we want to do this?•Useful for:•Automatically organizing data•Understanding hidden structure in some data•Representing high-dimensional data in a low-dimensional space•Examples:•Customers according to purchase histories•Genes according to expression profile•Search results according to topic•MySpace users according to interests•A museum catalog according to image similarityD. Blei Clustering 01 2 / 32Clustering•Goal: Automatically segment data into groups of similar points•Question: When and why would we want to do this?•Useful for:•Automatically organizing data•Understanding hidden structure in some data•Representing high-dimensional data in a low-dimensional space•Examples:•Customers according to purchase histories•Genes according to expression profile•Search results according to topic•MySpace users according to interests•A museum catalog according to image similarityD. Blei Clustering 01 2 / 32Clustering•Goal: Automatically segment data into groups of similar points•Question: When and why would we want to do this?•Useful for:•Automatically organizing data•Understanding hidden structure in some data•Representing high-dimensional data in a low-dimensional space•Examples:•Customers according to purchase histories•Genes according to expression profile•Search results according to topic•MySpace users according to interests•A museum catalog according to image similarityD. Blei Clustering 01 2 / 32Clustering•Goal: Automatically segment data into groups of similar points•Question: When and why would we want to do this?•Useful for:•Automatically organizing data•Understanding hidden structure in some data•Representing high-dimensional data in a low-dimensional space•Examples:•Customers according to purchase histories•Genes according to expression profile•Search results according to topic•MySpace users according to interests•A museum catalog according to image similarityD. Blei Clustering 01 2 / 32Clustering set-up•Our


View Full Document

Princeton COS 424 - Clustering and the k-means Algorithm

Download Clustering and the k-means Algorithm
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Clustering and the k-means Algorithm and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Clustering and the k-means Algorithm 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?