U.E.F 5.2

Apprentissage automatique et Fouille de données

Département
Second cycle
Année d étude
2éme Année IASD
Semestre
3
Crédit
4
Coefficient
5
Enseignants du module
DIF Nassima

Pré requis :

  • Analyse 1,2,3,4

  • Algèbre 1,2,3

  • Probabilité 1,2

  • Recherche opérationnelle

OBJECTIFS :

Machine learning refers to a broad set of algorithms and related concerns for discovering patterns

in data, making new inferences based on data, and generally improving the performance of a

software system without direct programming. These methods are critical for data science. Data

scientists should understand the algorithms they apply, be able to implement them, if necessary,

and make principled decisions about their use.

Scope:

  • Broad categories of machine learning approaches (e.g.,supervised and unsupervised)

  • Algorithms and tools (i.e.,implementations of those algorithms) in each of the broad learning categories.

  • Problems related to model expressivity as well as availability of data, and techniques

  • Express formally the representational power of models learned by an algorithm, and relate that to issues such as expressiveness and overfitting.

  • Exhibit knowledge of methods to mitigate the effects of overfitting and curse of dimensionality in the context of machine learning algorithms.

  • Provide an appropriate performance metric for evaluating machine learning algorithms/tools for a given problem.

  • Differences in interpretability of learned models.

  • Solve the problem of overfitting, and unbalanced datasets.

CONTENU DU MODULE :

  • Introduction to ML

 

  1.    What is Machine Learning
  2.    ML Block diagram
  3.    Examples of Machine Learning applications
  • Regression
  1.  Linear Regression
  2.  Multiple Linear Regression
  • Assessing performances
  1. Training/Test Error, ect
  2. Positive and Negative Class
  3. Overfitting and regularization
  4. Cross-validation
  • Classification
  1. Logistic Regression
  2. Naïve Bayes Classifier
  3. K-Nearest Neighbors
  4. Support Vector Machines
  5. Decision Trees
  • Clustering
  1. K-Means Clustering
  2. Hierarchical clustering
  3. DBSCAN & HAC Algorithm
  • Feature Reduction/Dimensionality reduction
  1. Principal Component Analysis
  2. Kernel Principal Component Analysis
  3. Non-Negative Matrix Factorization 
  4. Singular Value Decomposition 
  • Ensembles methods
  1. Bagging & boosting and its impact on bias and variance
  2. boosting
  3. Random forest
  4. Gradient Boosting Machines and XGBoost
course

Consultez les ressources disponibles concernant ce module sur le moteur de recherche de la bibliothèque, ou accédez directement au cours de vos enseignants via la plateforme de téléenseignement de l’école « e-learn ».