Browse Source

fix old example links

tags/v0.60-tf.numpy
mschwrdtnr Haiping 4 years ago
parent
commit
a70b42fbea
3 changed files with 3 additions and 3 deletions
  1. +1
    -1
      docs/source/LinearRegression.md
  2. +1
    -1
      docs/source/LogisticRegression.md
  3. +1
    -1
      docs/source/NearestNeighbor.md

+ 1
- 1
docs/source/LinearRegression.md View File

@@ -82,4 +82,4 @@ When we visualize the graph in TensorBoard:


![linear-regression](_static/linear-regression-tensor-board.png) ![linear-regression](_static/linear-regression-tensor-board.png)


The full example is [here](https://github.com/SciSharp/TensorFlow.NET/blob/master/test/TensorFlowNET.Examples/BasicModels/LinearRegression.cs).
The full example is [here](https://github.com/SciSharp/TensorFlow.NET-Examples/blob/master/src/TensorFlowNET.Examples/BasicModels/LinearRegression.cs).

+ 1
- 1
docs/source/LogisticRegression.md View File

@@ -13,4 +13,4 @@ The dependent variable of logistics regression can be two-category or multi-cate
Softmax regression allows us to handle ![1557035393445](_static\logistic-regression\1557035393445.png) where K is the number of classes. Softmax regression allows us to handle ![1557035393445](_static\logistic-regression\1557035393445.png) where K is the number of classes.




The full example is [here](https://github.com/SciSharp/TensorFlow.NET/blob/master/test/TensorFlowNET.Examples/BasicModels/LogisticRegression.cs).
The full example is [here](https://github.com/SciSharp/TensorFlow.NET-Examples/blob/master/src/TensorFlowNET.Examples/BasicModels/LogisticRegression.cs).

+ 1
- 1
docs/source/NearestNeighbor.md View File

@@ -2,4 +2,4 @@


The nearest neighbour algorithm was one of the first algorithms used to solve the travelling salesman problem. In it, the salesman starts at a random city and repeatedly visits the nearest city until all have been visited. It quickly yields a short tour, but usually not the optimal one. The nearest neighbour algorithm was one of the first algorithms used to solve the travelling salesman problem. In it, the salesman starts at a random city and repeatedly visits the nearest city until all have been visited. It quickly yields a short tour, but usually not the optimal one.


The full example is [here](https://github.com/SciSharp/TensorFlow.NET/blob/master/test/TensorFlowNET.Examples/BasicModels/NearestNeighbor.cs).
The full example is [here](https://github.com/SciSharp/TensorFlow.NET-Examples/blob/master/src/TensorFlowNET.Examples/BasicModels/NearestNeighbor.cs).

Loading…
Cancel
Save