CS 412MidtermMachine Learning

1999 TL
7 sa 5 dk konu anlatımı
40 soru çözümü
4.6 puan

Eğitmen

Nursena Köprücü Aslan

Nursena Köprücü Aslan

PhD in Computer Science

Koç Üniversitesi’nde Bilgisayar Mühendisliği okudum ve aynı zamanda Matematik alanında çift anadal yaptım. Ardından Imperial College London’da Machine Learning and Artificial Intelligence alanında yüksek lisansımı tamamladım. Şu anda University of Cambridge'te doktora çalışmalarımı sürdürüyorum.

Konular

Ders Tanıtımı

Introduction to Machine Learning

Machine Learning Notation Explained

Machine Learning Preliminaries

Why Supervised?

Hypothesis Space & Occam's Razor

Loss Functions: Measuring Mistakes

Example: Least-Squares Linear Regression

Ücretsiz

Nearest Neighbor Approach

Ücretsiz

Value of k

Geometric View: Voronoi Intuition

Distance Measure

Distances for Real Vectors

Example: Computing Distance Between Two Points

Distance for Non-Numeric Data

Scaling and Normalization

Voting Mechanism

k-NN Regression

What is a Decision Tree?

Splitting in Classification Trees

Pruning Trees

From Trees to Rules

Ücretsiz

Multivariate/Oblique Trees

What Is Regression?

Linear Regression

Multiple Linear Regression

Polynomial Regression

Summary: Linear, Multiple & Polynomial Regression

Ücretsiz

Feature Transformations & Feature Engineering

Feature Selection vs Feature Extraction

Feature Embedding & Factor Analysis (FA)

Motivation

Probabilistic Interpretation

Binary Cross Entropy / Log-loss

Optimization with Gradient Descent

Classification with Logistic Regression

Summary & Multi-Class Logistic Regression

Perceptron

Training a Perceptron

Limitation: XOR

MLP Architecture & Representation View

Backpropagation

Regression

Discrimination

Introduction to Deep Learning & Activation Functions

Training Deep Networks

Regularization Techniques

Tuning Network Structure

Learning Time

Time-Delay Neural Networks (TDNN)

RNN / LSTM / GRU

Generative Adversarial Networks (GANs)

Counting and Probability

Conditional Probability and Independence

Bayes' Rule

Discrete Random Variables

Continuous Random Variables

Expected Value and Variance

Bernoulli and Binomial Distributions

Continuous Uniform Distribution

Exponential Distribution

Normal Distribution

Laplace and Logistic Distributions

Maximum Likelihood Estimation(MLE)

Bernoulli Likelihood

Multinomial Likelihood and Smoothing

Bayes' Theorem

Parametric Classification

Unequal Variances → Quadratic Boundary

Gaussian Classification Boundary

Parametric & Polynomial Regression

Naive Bayes Approach

Curse of Dimensionality

Ücretsiz

Bayes Classifier vs. Naive Bayes

Independence & Conditional Independence

Naive Bayes Classification

How Naive Bayes Simplifies Parameter Estimation

Model Selection Using Validation Performance and Test MSE

k-NN Decision Boundaries and the Effect of k

Pass Rates & Majors (Bayes; Law of Total Probability)

Ücretsiz

Weighted Least Squares (Closed-Form Solution, Matrix View & Interpretation)

MLE for α (positive support, exponential tail)

MLP with Hard-Threshold Units

Should we initialize all MLP weights to zero?

One Shared Network vs. Three Separate Networks

Naive Histogram Estimator vs. Parzen Windows (Kernel)

Comparing Two Splits (Gini vs. Misclassification)

Prepruning vs. Postpruning (Which and Why?)

Why Not Regression for Classification?

From Binary to Multiclass: One-vs-All / One-vs-One with a Binary Classifier

Max-shift for SoftMax

Why Initialize Weights Near Zero?

Adaptive Learning Rates in Gradient Descent

Ücretsiz

When Do Direct Input Output Links Help in an MLP?

Mahalanobis vs. Euclidean: Why and When?

Discrete Attribute in Decision Trees

Regularized Least Squares

Gaussian Generative Model → Logistic Posterior

Naive Bayes Text Classification with Binary Features

Derivative of Softmax

Choosing Between Two Splits: Gini vs. Misclassification

Ücretsiz

Mean Square Error for Linear Regression

Gradient Descent Update

k-NN Regression Prediction

Ücretsiz

Decision Boundary and Building a Network for Binary Classification

Derivative of Squared Error

Computing Input and Output of a Convolution Node

True/False Reasoning on Activation, Linear Networks, and Gradient Descent

Ücretsiz

Computing Total Probability

True/False on Scaling, k-NN, Intrinsic Error and Model Complexity

Output Size of a Conv Layer

Değerlendirmeler

4.6

4 öğrenci değerlendirmesi

Değerlendirme yapmak için bu derse sahip olman gerekiyor.

Sena Yolcu

Mühendislik ve Doğa Bilimleri Programları

3 ay önce

Eralp Kızıloğlu

Bilgisayar Bilimi ve Mühendisliği

4 ay önce

Cem Sarp Takım

Bilgisayar Bilimi ve Mühendisliği

6 ay önce

Eren Batu Cansever

Mühendislik ve Doğa Bilimleri Programları

6 ay önce

Paketi Tamamla

🎓 Sabancı Üniversitesi öğrencilerinin %92'si tüm paketi alarak çalışıyor.

Machine Learning

CS 412 • Final

Machine Learning

5.0(2)
1699 TL1999 TL%15
Machine Learning

CS 412 • Midterm

Machine Learning

4.6(4)
1699 TL1999 TL%15
599 TL indirim
Toplam:3998 TL3399 TL

Sıkça Sorulan Sorular

1999 TL