fengdu78/lihang-code

《统计学习方法》的代码实现

View on GitHub ↗Jump to charts ↓

fengdu78/lihang-code has 19k+ stars and 6k+ forks on GitHub, is written in Jupyter Notebook, and was last pushed on Oct 5, 2026. Data as of . Signed-in members get hourly updates — create a free account.

Summary Information

Updated 12 minutes ago
Added to GitGenius on October 5th, 2026
Created on November 26th, 2018
Open Issues & Pull Requests: 50 (+0)
GitHub issues: Enabled
Number of forks: 6,220
Total Stargazers: 19,604 (+0)
Total Subscribers: 538 (+0)

Repository Insights (GitGenius)

Most active contributors

Sign in to see contributor activity.
Sign in

Related repositories by overlapping contributors

No overlapping-contributor repos identified yet.

Charts & Analytics

Fetching additional details & charts...

Issue Activity (beta)

Open issues: 0
New in 7 days: 0
Closed in 7 days: 0
Avg open age: N/A days
Stale 30+ days: 0
Stale 90+ days: 0

Recent activity

Opened in 7 days: 0
Closed in 7 days: 0
Comments in 7 days: 0
Events in 7 days: 0

Top labels

No label distribution available yet.

Most active issues this week

Sign in to see which issues are moving.
Sign in

Detailed Description

Lihang-code is a code implementation repository that provides Python implementations of algorithms and methods from a foundational machine learning textbook.

The repository addresses the need for practical, working code examples to accompany theoretical machine learning instruction. It implements the algorithms and methods covered in the textbook, spanning both supervised and unsupervised learning approaches. The implementations are organized chapter by chapter, with each chapter corresponding to a specific learning method or algorithm covered in the source material.

This repository is suited for machine learning students and practitioners seeking to understand how classical statistical learning methods work in practice. It serves as a reference implementation for algorithms including perceptrons, k-nearest neighbors, naive Bayes, decision trees, logistic regression, support vector machines, boosting methods, expectation-maximization, hidden Markov models, and conditional random fields, as well as unsupervised methods like clustering, principal component analysis, and latent Dirichlet allocation. The implementations are presented as Jupyter Notebooks, making them accessible for interactive learning and experimentation.

The project maintains a straightforward structure with code organized to follow the textbook's progression through supervised learning methods in its first section and unsupervised learning methods in its second section. Development activity shows ongoing maintenance with code organization and refinement, drawing on contributions from multiple sources and community members who have shared their own implementations and notes.