Common Terminologies in Graph Thoery Define an undirected graph with the natrual order as $G = (V,E,\sigma)$ where $V$ is the set of the vertices, $E$ is the set of edges and $\sigma$ is the natrual ordering. Chordal graph A chordal is a path of undirected graph between two non-conescutive vertices. (“shortcut”" between two vertices") A chordal graph referes to every cycle of length four or greater of a simple graph has a chord. (triangulated graph) Chordal Completion ...

Clique seperator Decomposition by clique seperator (Tarjan, 1985) Main Idea: Based on the idea of ‘divide and conquer’, this paper proposed an graph decomposition algorithm by finding the clique seperator recursively. The decomposition results in a binary decomposition tree. The author suggested some general ideas to tackle 4 NP-hard problems by ultlizing the binary decomposition tree. Preliminaries Perfect elimination ordering, Clique, Minimal and Minimum ordering, Seperator Algorithms Text description ...

Overview Revisitting the sparse matrix technology - Summary. ...

Overview Revisitting the sparse matrix technology. ...

Overview Revisitting the sparse matrix technology. ...

Monte Carlo Tree Search Summary...

Reinforcement Learning Algorithms Summary...

Markov Property (MP)...

Overview Normal Equation is a method in parallel with gradient descent algorithm to minimize the cost function J. ...

Linear Regression with multiple variables It is common to consider more than one features when making a prediction. For example when predicting the price of a house: ...