본문으로 바로가기

강의

Unsupervised Learning in R

중급기술 수준

업데이트됨 2024. 7.

This course provides an intro to clustering and dimensionality reduction in R from a machine learning perspective.

무료로 강의 시작

RMachine Learning

4시간

16 동영상

49 연습 문제

3,600 XP

54,822

성취 증명서

무료 계정을 만드세요

또는

계속 진행하시면 당사의 이용약관, 개인정보처리방침 및 귀하의 데이터가 미국에 저장되는 것에 동의하시는 것입니다.

수천 개 기업의 학습자들이 사랑하는

Training a Team?

Try for Business

강의 설명

Many times in machine learning, the goal is to find patterns in data without trying to make predictions. This is called unsupervised learning. One common use case of unsupervised learning is grouping consumers based on demographics and purchasing history to deploy targeted marketing campaigns. Another example is wanting to describe the unmeasured factors that most influence crime differences between cities. This course provides a basic introduction to clustering and dimensionality reduction in R from a machine learning perspective, so that you can get from data to insights as quickly as possible.

선수 조건

Introduction to R

1

Unsupervised learning in R

The k-means algorithm is one common approach to clustering. Learn how the algorithm works under the hood, implement k-means clustering in R, visualize and interpret the results, and select the number of clusters when it's not known ahead of time. By the end of the chapter, you'll have applied k-means clustering to a fun "real-world" dataset!

Welcome to the course!

Identify clustering problems

Introduction to k-means clustering

k-means clustering

Results of kmeans()

Visualizing and interpreting results of kmeans()

How k-means works and practical matters

Handling random algorithms

Selecting number of clusters

Introduction to the Pokemon data

Practical matters: working with real data

Review of k-means clustering

2

Hierarchical clustering

Hierarchical clustering is another popular method for clustering. The goal of this chapter is to go over how it works, how to use it, and how it compares to k-means clustering.

Introduction to hierarchical clustering

Hierarchical clustering with results

Selecting number of clusters

Interpreting dendrogram

Cutting the tree

Clustering linkage and practical matters

Linkage methods

Comparing linkage methods

Practical matters: scaling

Comparing kmeans() and hclust()

Review of hierarchical clustering

3

Dimensionality reduction with PCA

Principal component analysis, or PCA, is a common approach to dimensionality reduction. Learn exactly what PCA does, visualize the results of PCA with biplots and scree plots, and deal with practical issues such as centering and scaling the data before performing PCA.

Introduction to PCA

PCA using prcomp()

Results of PCA

Additional results of PCA

Visualizing and interpreting PCA results

Interpreting biplots (1)

Interpreting biplots (2)

Variance explained

Visualize variance explained

Practical issues with PCA

Practical issues: scaling

Additional uses of PCA and wrap-up

4

Putting it all together with a case study

The goal of this chapter is to guide you through a complete analysis using the unsupervised learning techniques covered in the first three chapters. You'll extend what you've learned by combining PCA as a preprocessing step to clustering using data that consist of measurements of cell nuclei of human breast masses.

Introduction to the case study

Preparing the data

Exploratory data analysis

Performing PCA

Interpreting PCA results

Variance explained

PCA review and next steps

Communicating PCA results

Hierarchical clustering of case data

Results of hierarchical clustering

Selecting number of clusters

k-means clustering and comparing results

Clustering on PCA results

Wrap-up and review

Unsupervised Learning in R

강의
완료

수료증 획득

LinkedIn 프로필, 이력서 또는 CV에 이 자격증을 추가하세요
소셜 미디어와 성과 평가에서 공유하세요지금 등록

19백만 명 이상의 학습자와 함께 Unsupervised Learning in R을(를) 시작하세요!

무료 계정을 만드세요

또는

계속 진행하시면 당사의 이용약관, 개인정보처리방침 및 귀하의 데이터가 미국에 저장되는 것에 동의하시는 것입니다.

DataCamp for Mobile을 통해 데이터 분석 능력을 향상시키세요.

모바일 강좌와 매일 5분 코딩 챌린지를 통해 이동 중에도 학습 효과를 높이세요.