- 博客(2)
- 收藏
- 关注
原创 机器学习——吴恩达 week3
机器学习——吴恩达 week31: logistic regression: hypothesis: 0<h<1, 表示条件概率,sigmoid函数 decision boundary: theta' * x表示边界。 cost function: y=1,h=0 cost=无穷;y=0,h=1 cost=无穷; y=1,h...
2018-02-12 14:56:58
318
转载 Dijkstra's 最短路径算法能不能解这个含有负权重的问题
Q. Does Dijkstra's algorithm work with negative weights? A. Yes and no. There are two shortest paths algorithms known as Dijkstra's algorithm, depending on whether a vertex can be enqueued on the pr
2018-01-24 18:06:53
2324
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人