Home Projects cs229-2018-autumn
cs229-2018-autumn
Jupyter Notebook

cs229-2018-autumn

All notes and materials for the CS229: Machine Learning course by Stanford University

by maxim5 · GitHub
Stars
Forks
Created
Last commit
Category
cs229machine-learningneural-networksJupyter Notebook
View on GitHub
In plain words

Access all lecture notes and materials for Stanford's Machine Learning course to enhance your learning.

You maintain this project?

Claim its page: indexed whatever its rank, translated into six languages, and enriched with what you write yourself.

Claim this page →
cs229-2018-autumn — GitHub preview card
📈 Star history
3.39k3.36k
2026-07-072026-08-31
📈 Track cs229-2018-autumn

Get an email alert on its next release or when it starts trending — never miss the moment.

Free · no card · unsubscribe anytime
Get email alerts →
📄 About

All notes and materials for the CS229: Machine Learning course by Stanford University

cs229-2018-autumn has 3.4k stars on GitHub. It has been forked 1.2k times. cs229-2018-autumn is written mainly in Jupyter Notebook. It has been in active development since 2021. Its main topics are cs229, machine-learning, neural-networks, stanford-university.

Frequently asked questions

What is cs229-2018-autumn?

All notes and materials for the CS229: Machine Learning course by Stanford University

Is cs229-2018-autumn open source?

cs229-2018-autumn is an open-source project.

Is cs229-2018-autumn free?

Yes. cs229-2018-autumn is free and open source — you can use, modify and self-host it.

What language is cs229-2018-autumn written in?

cs229-2018-autumn is written mainly in Jupyter Notebook.

🏅 Maintainer of this project?
olud.ai badge — cs229-2018-autumn

Add this live badge to your README — your GitHub stars and directory rank, refreshed daily.

[![olud.ai](https://olud.ai/badge.php?tool=maxim5-cs229-2018-autumn)](https://olud.ai/project/maxim5-cs229-2018-autumn.html)
More badge options →
🧬 Shares DNA with

Measured from GitHub topics shared by both projects, weighted by how rare each topic is.