BenBenBenBenBenB的博客

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 ...

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...

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...

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...

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...

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...

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...