CS 412FinalMachine Learning

1999 TL
5 sa 36 dk konu anlatımı
55 soru çözümü
5.0 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ı

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

Naive Bayes Approach

Curse of Dimensionality

Ücretsiz

Bayes Classifier vs. Naive Bayes

Independence & Conditional Independence

Naive Bayes Classification

How Naive Bayes Simplifies Parameter Estimation

Example with categorical variables

Naive Bayes Subtleties

Modeling Multivariate Data: Estimation, Normal Distributions, and Naive Bayes

Discrete Features & Multivariate Regression

Sample Mean and Covariance Matrix

Mahalanobis Distance

Ücretsiz

Naive Bayes Classification (Discrete Features)

Maximum Likelihood Estimation(MLE)

Bernoulli Likelihood

Multinomial Likelihood and Smoothing

Parametric Classification

Unequal Variances → Quadratic Boundary

Ücretsiz

Gaussian Classification Boundary

Multivariate Classification: Linear, Quadratic, and Model Selection

LDA vs QDA Classification

Text Classification with Naïve Bayes

Text Classification Tasks

Bag-of-Words (BoW)

Naive Bayes scoring with BoW

Bernoulli Naive Bayes

Multinomial Naive Bayes

Multinomial Naive Bayes - 2

Laplace smoothing

Practical Notes

Why raw term counts aren’t enough

Transforming TF

IDF

TF-IDF

Text Preprocessing

Ücretsiz

Tokenization and Token normalization

Stop words + Stemming vs Lemmatization

Why text is harder than “normal” ML inputs

Bag of Words / TF-IDF

One-Hot Encoding & Distributional Hypothesis

Word Embeddings

Word2Vec idea & CBOW vs Skip-gram

Training objective & Negative Sampling

Scoring function

What embeddings capture

Limitations of Word2Vec embeddings

Language Models

Word2Vec Training Data

Semi/Self-Supervised Learning

Pretext & Pseudo-labeling

Consistency Regularization

Representation Learning & Contrastive Learning

Semi-Supervised Learning & Entropy Minimization

Early Work in SSL

Introduction and Mixture Densities

K-Means Clustering

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

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

MLE for α (positive support, exponential tail)

Linear Discriminant with Equal Variance

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)

Kernel Smoother

Naive Density Estimator (Bandwidth effect & validity)

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

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

Single-Neuron Sigmoid + MSE

Decision Trees: Gini Impurity Split Comparison

Decision Trees: Entropy & Information Gain Split Comparison

MLE for a Discrete PMF

Ücretsiz

1-NN LOOCV on Patient Dataset

Ücretsiz

Linear Regression + MSE: Gradient Descent Step Size Effects

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

Regression: Test-Set MSE

Generalization & Overfitting: True/False

Baseline Error: ZeroR vs Random Guessing

Entropy: Fair Die & Bias Effect

Decision Trees: ID3 Optimality + Key Advantage

Decision Tree Split: Remaining Entropy

Değerlendirmeler

5

2 öğrenci değerlendirmesi

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

Eralp Kızıloğlu

Bilgisayar Bilimi ve Mühendisliği

5 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