Higher C = Harder margin (less tolerance for errors).
Number of nearest points used for voting.
Simulates tree depth/complexity in 3D grid.
Strength of the regularization penalty.
Balance between L1 (Lasso) and L2 (Ridge).