mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-02-25 18:38:39 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update decision_tree.py

Browse Source
This commit is contained in:
thor-harsh 2023-08-17 13:46:50 +05:30 committed by GitHub
parent 4f759d1e26
commit ed5abdd37e
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
machine_learning/decision_tree.py
View File

@ -164,7 +164,7 @@ def main():
to predict the label of 10 different test values. Here we should prefer to predict the label of 10 different test values. Here we should prefer
calculating Root Mean Squared Error over Mean Sqaured error because RMSE calculating Root Mean Squared Error over Mean Sqaured error because RMSE
should be used when you need to communicate your results in an understandable should be used when you need to communicate your results in an understandable
way to end users or when penalising outliers is less of a priority.Interpretation will be easy in this case. way to end users or when penalising outliers is less of a priority.
""" """
x = np.arange(-1.0, 1.0, 0.005) x = np.arange(-1.0, 1.0, 0.005)
y = np.sin(x) y = np.sin(x)