de
en
Schliessen
Detailsuche
Bibliotheken
Projekt
Impressum
Datenschutz
zum Inhalt
Detailsuche
Schnellsuche:
OK
Ergebnisliste
Titel
Titel
Inhalt
Inhalt
Seite
Seite
Im Dokument suchen
Artelt, André: Introduction to Machine Learning - Supplementary notes. 2019
Inhalt
Notation
Basic concepts
Regression
Classification
The classification problem
Hypothesis
Risk minimization
Risk minimization and maximum likelihood
Bayesian model averaging
Outlook
Exercises
Bayes classifier
The optimum Bayes classifier
Outlook
Naive Bayes classifier
Gaussian naive Bayes classifier
Generative vs. discriminative models
Exercises
K-nearest neighbors model
K-nearest neighbors classifier
K-nearest neighbors regression model
Parametric vs. non-parametric models
Outlook
Exercises
Linear regression
Modeling
Hidden bias
Cost function
Convexity
Optimization
Closed form solution
Iterative solution
Feature transformation
Regularization
Closed form solution
Iterative solution
Probabilistic interpretation
Noisy outputs
Maximum likelihood
Maximum a posteriori
Robust regression
Huber regression
Least absolute deviations
Sparsity regularization
Details on LASSO
Elastic net
Optimization
Bayesian linear regression
Conjugate priors
Kernel regression
Dual form of ridge regression
Kernels
Outlook
Exercises
Logistic regression
Modeling
Cross entropy and information theory
Convexity
Optimization
2. Order methods
Separating hyperplane
Feature transformation, regularization & kernelization
Outlook
Exercises
Tree based models
Decision trees
Model
Fitting
Regression trees
Fitting
Random forest
Feature relevance
Outlook
Exercises
Evaluation
Metrics
Regression
Classification
How to estimate scores
Train - Test split
Cross validation
Overfitting & Underfitting
Model selection
Feature selection
Wrapper methods
Filter methods
Embedded methods
Exercises
Dimensionality reduction
PCA
Derivation - Reconstruction error
Derivation - Diagonal covariance matrix
Kernelized PCA
Outlook
Exercises
Clustering
K-means
K-means++
Voronoi tessellation
Agglomerative Clustering
DBSCAN
Spectral clustering
Gaussian mixture model
Details on the EM-algorithm
Outlook
Exercises
Appendices
Convex optimization
Convex set
Convex functions
Local vs. global optimum
Convexity preserving operations
Examples
Subdifferential
Convex optimization
Closed form solution
Gradient descent
Intuition behind gradient descent
Newton's method
Quasi-Newton methods
Choosing the step length
Coordinate descent
Linear programming
Example
Quadratic programming
Eample
Lagrangian duality
Optimality conditions
Example
Outlook
Exercises
Probability theory & Statistical inference
Basic probability
Conditional probabilities
Independence
Random variable
Algebraic operations
Cumulative distribution function
Probability distributions
Discrete distributions
Continuous distributions
Expectation
Expected value
Variance
Covariance
Transformation
Conditional expectation
Independence
Moments
Moment-generating function
Upper bounds
Jensen's inequality
Chebyshev's inequality
Markov's inequality
Chernoff bound
Hoeffding's inequality
Cauchy–Schwarz inequality
Union bound
Law of large numbers
Central limit theorem
Information theory
Entropy
Kullback-Leibler divergence
Mutual information
Cross entropy
Inference
Estimator
Bootstrapping
Constructing estimators
Method of moments
Maximum likelihood
Bayesian inference - Maximum a posteriori
Outlook
Exercises