## Viterbi Algorithm维比特算法 VS Dijkstra迪杰斯特拉

#### 1.概述

Viterbi维比特：动态规划逆向操作找到起点到终点的最短路径

Dijkstra迪杰斯特拉：贪心顺向操作找到起点到所有节点的最短路径不适用于边权为负值不适用带有点权（可扩展解决，参考

#### 2.举例

Viterbi vs Dijkstra

## sklearn.linear_model.SGDClassifier

1.The loss function to be used. Defaults to ‘hinge’, which gives a linear SVM.

2.The ‘log’ loss gives logistic regression, a probabilistic classifier.

3.‘modified_huber’ is another smooth loss that brings tolerance to outliers as well as probability estimates.

4.‘squared_hinge’ is like hinge but is quadratically penalized.

5.‘perceptron’ is the linear loss used by the perceptron algorithm.