BME-310-davidlin-2026-08-15-07-06-00
Title of Course: Introduction to Machine Learning for Biomedical Engineering
Prefix and Number: BME 310
Semester and Year: tbd
Number of Credit Hours: 3
Prerequisites: BME 210 or ChE 211 (or alternative Python programming course, subject to instructor approval) with C or better
Course Details
Day and Time: tbd
Meeting Location: tbd
Instructor Contact Information
Instructor Name: tbd
Instructor Contact Information: tbd
Instructor Office Hours: tbd
TA Name: tbd
TA Contact Information: tbd
TA Office Hours: tbd
Course Description
Introduction and application of the concepts of machine learning for Biomedical Engineering applications.
Course Materials
Books: none
Other Materials: none
Fees: none
|
Course Learning Outcomes (students will be able to:) |
Activities Supporting the Learning Outcomes | Assessment of the Learning Outcomes |
|---|---|---|
| Understand basic machine learning (ML) terminology and concepts, such as features, labels (or targets), ML models, training, training set, inference, test set, and validation set. | Lectures, homework | Homework, quizzes, exams |
|
Understand the probabilistic nature of machine learning models. |
Lectures, homework | Homework, quizzes, exams |
|
Understand common supervised learning algorithms, linear regression, logistic regression, support vector machines (SVM), and decision trees. |
Lectures, homework |
Homework, quizzes, exams |
|
Understand basics of artificial neural networks (ANNs), neurons, activation functions, and the role of backpropagation. |
Lectures, homework |
Homework, quizzes, exams |
|
Understand basics of unsupervised learning techniques, k-means clustering, Gaussian mixture model, dimensionality reduction methods. |
Lectures, homework |
Homework, quizzes, exams |
|
Perform model performance evaluation, determine accuracy, precision, recall, F1 score, and the Receiver Operating Characteristic (ROC) curve. |
Lectures, homework |
Homework, quizzes, exams |
| Dates | Lesson Topic | Assignment | Assessment |
|---|---|---|---|
|
Week 1 |
Course introduction and syllabus overview; basic ML terminology. Supervised, unsupervised, and reinforcement learning (HW1: Python scripting basics using AI tools.) Python and IDE installation; first steps; variables, data types, algebraic expressions; modules (installation/import); control structures; functions |
Lecture, in-class activities |
Quizzes |
|
Week 2 |
Creating Python scripts; structured programming; procedural vs. object-oriented programming; responsible use of AI for scripting; verification & validation (V&V) of scripts. |
Lecture, in-class activities |
Quizzes |
|
Week 3 |
Supervised ML: regression - linear regression, cost function, gradient descent; train/validation/test splits, cross-validation, bias–variance, overfitting; Ridge/Lasso regularization. Intro to feature engineering. Model evaluation— MAE/RMSE/ (HW2: Applying regression to data.) |
Lecture, in-class activities, homework |
Quizzes, homework |
|
Week 4 |
Classification: logistic regression; scaling/standardization; probabilistic perspective; generalized linear models (GLMs); categorical encodings. Model evaluation—accuracy, precision, recall, specificity, confusion matrix, F1 score, ROC AUC, PR AUC. |
Lecture, in-class activities |
Quizzes |
|
Week 5 |
Joint and conditional probabilities; Bayes’ theorem; generative vs. discriminative algorithms. Fundamental limits of predictions. ChatGPT – the idea. |
Lecture, in-class activities, homework |
Quizzes, homework |
|
Week 6 |
Naïve Bayes; Gaussian Discriminant Analysis (GDA); imbalanced data strategies (resampling, class weights); probability calibration and threshold selection. (HW3: Probabilistic models for classification.) |
Lecture, in-class activities |
Exam |
|
Week 7 |
Support Vector Machines (SVM): margins, hyperplanes, support vectors. |
Lecture, in-class activities, homework |
Quizzes, homework |
|
Week 8 |
Kernel trick for nonlinear decision boundaries; regularization; applications of kernel methods in SVMs. (HW4: SVMs with and without kernels.) |
Lecture, in-class activities |
Quizzes |
|
Week 9 |
Artificial Neural Networks (ANN): neuron/perceptron model; feedforward networks and layers. |
Lecture, in-class activities, homework |
Quizzes, homework |
|
Week 10 |
Activation functions, loss functions, optimization, and backpropagation. (HW5: Build and train a simple ANN for classification or regression.) |
Lecture, in-class activities |
Quizzes |
|
Week 11 |
Data preprocessing and cleanup—handling missing values, scaling, normalization; Exploratory Data Analysis (EDA). |
Lecture, in-class activities, homewok |
Quizzes, homework |
|
Week 12 |
Unsupervised ML: clustering—k-means and Gaussian Mixture Models (GMM); visualizing clusters. |
in-class activities, project |
Lecture, in-class activities, project |
|
Week 13 |
Dimensionality reduction with Principal Component Analysis (PCA); anomaly detection; data visualization; brief introduction to reinforcement learning (for further study). |
in-class activities, project |
Lecture, in-class activities, project |
|
Week 14 |
Project Presentations |
Project |
Project |
|
Week 15 |
Project Presentations |
Project |
Project |
Expectations for Student Effort
For each hour of lecture equivalent, students should expect to have a minimum of two hours of work outside of class.
Grading
| Type of Assignment (tests, papers, etc) | Points | Percent of Overall Grade |
|---|---|---|
| Homework | 25% | |
| Quizzes | 15% | |
| Exams | 30% | |
| Project | 30% |
| Grade | Percent | Grade | Percent |
|---|---|---|---|
| A |
>92 |
C | 73-76 |
| A- | 90-91 | C- | 70-72 |
| B+ | 87-89 | D+ | 67-69 |
| B | 83-86 | D | 60-66 |
| B- | 80-82 | F | <60 |
| C+ | 77-79 |
Numerical grades will be rounded to the nearest integer value.
Attendance and Make-Up Policy
Students should make all reasonable efforts to attend all class meetings. However, in the event a student is unable to attend a class, it is the responsibility of the student to inform the instructor as soon as possible, explain the reason for the absence (and provide documentation, if appropriate), and make up class work missed within a reasonable amount of time, if allowed. Missing class meetings may result in reducing the overall grade in the class.
Academic Integrity Statement
You are responsible for reading WSU's Academic Integrity Policy, which is based on Washington State law. If you cheat in your work in this class you will:
-Receive an "F" for the course grade
-Be reported to the Center for Community Standards
-Have the right to appeal my decision
-Not be able to drop the course of withdraw from the course until the appeals process is finished
If you have any questions about what you can and cannot do in this course, ask me.
If you want to ask for a change in my decision about academic integrity, use the form at the Center for Community Standards website. You must submit this request within 21 calendar days of the decision.