Skip to content

Commit f50dcb2

Browse files
authored
Update README.md
1 parent 861800c commit f50dcb2

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -11,7 +11,7 @@ Thanks,
1111

1212
|Algorithm|Description|Link|
1313
|------|------|--------|
14-
|Decision Tree|By calculating the entropy of previous observations, decision tree algorithm may help us to predict the decision or results|[Source Code](https://github.com/Cheng-Lin-Li/MachineLearning/tree/master/DecisionTree)|
14+
|Decision Tree|By measuring information gain via calculating the entropy of previous observations, decision tree algorithm may help us to predict the decision or results|[Source Code](https://github.com/Cheng-Lin-Li/MachineLearning/tree/master/DecisionTree)|
1515
|Fast Map|An approach for dimensions reductions|[Source Code](https://github.com/Cheng-Lin-Li/MachineLearning/tree/master/FastMap)|
1616
|Gaussian Mixture Models (GMMs)|GMMs are among the most statistically mature methods for data clustering (and density estimation)|[Source Code](https://github.com/Cheng-Lin-Li/MachineLearning/tree/master/GMM)|
1717
|Hierarchical clustering (HAC)|HCA seeks to build a hierarchy of clusters from bottom up or top down. This is a bottom up implementation.|[Source Code](https://github.com/Cheng-Lin-Li/MachineLearning/tree/master/HAC)|

0 commit comments

Comments
 (0)