- 博客(7)
- 收藏
- 关注
原创 NLP: Hidden Markov Model & Viterbi Algorithm
In NLP, we have a type of tasks called “Part-of-Speech Tagging”. It basically requires us to build up a model that can label the word in a sentence with correct part-of-speech tag. For example,Noun ...
2020-03-22 13:52:02 321
原创 Algorithm Design and Analysis: Tarjan's Algorithm and its Proof
Hi there,Today, I want to talk about Tarjan’s algorithm that finds the strongly connected component (SCC). Before we dive into the amazing algorithm, let’s define SCC.SCC: in a directed graph, SCC...
2020-03-15 23:26:45 155
原创 Algorithm Analysis & Design: Dynamic Programming - Optimal BST
Hi peers,In this essay, I will introduce a dynamic programming algorithm that can construct an optimal binary search tree. Before we talk about the algorithm, let’s first understand what an optimal B...
2020-02-24 17:58:21 255
原创 Algorithm Design & Analysis: Single-linkage Clustering Algorithm & Proof
Hi peers,In this essay, I will talk about single-linkage clustering (SLC) algorithm. I will first give the problem definition of clustering problem. With proper concepts being introduced, I then give...
2020-02-22 16:28:17 290
原创 Algorithm Design & Analysis: Dijkstra Algorithm - Proof of Correctness
Hi peers,Dijkstra algorithm is a greedy algorithm that finds the shortest paths from a given source vertex to all other vertices in a graph. In this short essay, I will review the pseudocode for Dijk...
2020-02-16 17:51:07 425
原创 Algorithm Analysis and Design: Kruskal's Algorithm - Proof of Correctnes
Proof of Correctness – Kruskal AlgorithmHi peers,We know Prim’s algorithm can correctly find the minimum spanning tree (MST) in a given graph. Kruskal algorithm (“the algorithm” in the following con...
2020-02-09 16:32:19 841
原创 Algorithm Design & Analysis: Prim's Algorithm - Proof of Correctness
Hi peers,Prim’s Algorithm is for finding the minimum spanning tree (MST) of a graph. It is simple, straightforward, and powerful. It always gives us the correct MST for an input graph every time. How...
2020-02-08 11:29:54 307
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人