algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-07-05 01:09:40 +08:00
Code Issues Packages Projects Releases Wiki Activity

Simplify code by dropping support for legacy Python (#1143)

Browse Source 
* Simplify code by dropping support for legacy Python

* sort() --> sorted()
This commit is contained in:
Christian Clauss
2019-08-19 15:37:49 +02:00
committed by GitHub
parent 32aa7ff081
commit 47a9ea2b0b
145 changed files with 367 additions and 976 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
machine_learning/decision_tree.py
View File

@ -1,10 +1,8 @@
"""
Implementation of a basic regression decision tree.
Input data set: The input data set must be 1-dimensional with continuous labels.
Output: The decision tree maps a real number input to a real number output.
Output: The decision tree maps a real number input to a real number output.
"""
from __future__ import print_function
import numpy as np
class Decision_Tree:
@ -19,7 +17,7 @@ class Decision_Tree:
def mean_squared_error(self, labels, prediction):
"""
mean_squared_error:
@param labels: a one dimensional numpy array
@param labels: a one dimensional numpy array
@param prediction: a floating point value
return value: mean_squared_error calculates the error if prediction is used to estimate the labels
"""
@ -32,7 +30,7 @@ class Decision_Tree:
"""
train:
@param X: a one dimensional numpy array
@param y: a one dimensional numpy array.
@param y: a one dimensional numpy array.
The contents of y are the labels for the corresponding X values
train does not have a return value
@ -135,6 +133,6 @@ def main():
print("Predictions: " + str(predictions))
print("Average error: " + str(avg_error))
if __name__ == '__main__':
main()