remove .html

_pages/categories/algorithm.md

@@ -9,130 +9,130 @@ toc_sticky: true
 
 PS에 대한 아티클은 [요기]({{"/category/problem-solving" | relative_url}})👀에서 확인하실 수 있습니다 😎
 
-알고리즘 정리를 마무리한 후기는 [요기]({{"/2022/05/21/end-of-algorithm-lecture.html" | relative_url}})에서 확인하실 수 있습니다.
+알고리즘 정리를 마무리한 후기는 [요기]({{"/2022/05/21/end-of-algorithm-lecture" | relative_url}})에서 확인하실 수 있습니다.
 
 정규수업에서 다루지 않은 내용은 🎈로 표시하였습니다 😉
 {: .notice}
 
 ## Computational Complexity
 
-- [Asymptotic Analysis]({{"/2021/05/14/asymptotic-analysis.html" | relative_url}})
+- [Asymptotic Analysis]({{"/2021/05/14/asymptotic-analysis" | relative_url}})
   - Big-O / Big-Omega / Big-Theta
   - little-o / little-omega / little-theta
-- [Master Theorem: Recurrence relations]({{"/2021/02/26/divide-and-conquer.html#master-theorem-recurrence-relations" | relative_url}})
-- [Fibonacci Number]({{"/2021/05/15/fibonacci-number.html" | relative_url}})
+- [Master Theorem: Recurrence relations]({{"/2021/02/26/divide-and-conquer#master-theorem-recurrence-relations" | relative_url}})
+- [Fibonacci Number]({{"/2021/05/15/fibonacci-number" | relative_url}})
   - Brute Force
   - DP
   - Matrix-based
-- [Convex Hull Algorithm]({{"/2021/05/15/convex-hull-algorithm.html" | relative_url}})
+- [Convex Hull Algorithm]({{"/2021/05/15/convex-hull-algorithm" | relative_url}})
   - Brute Force
   - Graham's Scan
 
-## [Divide and Conquer]({{"2021/02/26/divide-and-conquer.html" | relative_url}})
+## [Divide and Conquer]({{"2021/02/26/divide-and-conquer" | relative_url}})
 
-- [Multiplication Algorithm: Karatsuba Algorithm]({{"2021/02/26/multiplication-algorithm.html" | relative_url}})
-- [Binary Search]({{"2021/02/27/binary-search.html" | relative_url}})
+- [Multiplication Algorithm: Karatsuba Algorithm]({{"2021/02/26/multiplication-algorithm" | relative_url}})
+- [Binary Search]({{"2021/02/27/binary-search" | relative_url}})
   - Off-by-One
   - Approximate Matches
-- [Merge Sort]({{"/2021/02/27/merge-sort.html" | relative_url}})
-  - [Skyline Problem]({{"/2021/09/25/skyline-problem.html" | relative_url}}) 🎈
-- [Matrix Multiplication: Strassen Algorithm]({{"/2021/10/19/matrix-multiplication-strassen-algorithm.html" | relative_url}})
-- [Quick Selection]({{"/2021/10/21/quick-selection.html" | relative_url}})
-- [Closest pair of points]({{"/2021/10/22/closest-pair-of-points.html" | relative_url}})
+- [Merge Sort]({{"/2021/02/27/merge-sort" | relative_url}})
+  - [Skyline Problem]({{"/2021/09/25/skyline-problem" | relative_url}}) 🎈
+- [Matrix Multiplication: Strassen Algorithm]({{"/2021/10/19/matrix-multiplication-strassen-algorithm" | relative_url}})
+- [Quick Selection]({{"/2021/10/21/quick-selection" | relative_url}})
+- [Closest pair of points]({{"/2021/10/22/closest-pair-of-points" | relative_url}})
 
 ## Graph Algorithm
 
-- [DFS and BFS]({{"/2021/03/12/dfs-and-bfs.html" | relative_url}})
-  - [DFS and BFS - code]({{"/2021/03/13/dfs-and-bfs-code.html" | relative_url}})
-- [DFS Tree]({{"/2021/03/13/dfs-tree.html" | relative_url}})
-- [Dijkstra's Algorithm]({{"/2021/04/17/dijkstra-algorithm.html" | relative_url}})
-- [Bellman-Ford Algorithm]({{"/2021/04/18/Bellman-Ford.html" | relative_url}})
-- [DAG & Topological Sort]({{"/2021/04/19/directed-acyclic-graph.html" | relative_url}})
+- [DFS and BFS]({{"/2021/03/12/dfs-and-bfs" | relative_url}})
+  - [DFS and BFS - code]({{"/2021/03/13/dfs-and-bfs-code" | relative_url}})
+- [DFS Tree]({{"/2021/03/13/dfs-tree" | relative_url}})
+- [Dijkstra's Algorithm]({{"/2021/04/17/dijkstra-algorithm" | relative_url}})
+- [Bellman-Ford Algorithm]({{"/2021/04/18/Bellman-Ford" | relative_url}})
+- [DAG & Topological Sort]({{"/2021/04/19/directed-acyclic-graph" | relative_url}})
 
-## [Greedy Algorithm]({{"/2021/04/19/greedy-algorithm.html" | relative_url}})
+## [Greedy Algorithm]({{"/2021/04/19/greedy-algorithm" | relative_url}})
 
 - MST; Minimum Spanning Tree
-  - [Kruskal's Algorithm]({{"/2021/04/19/kruskal-and-prim-algorithm.html#kruskals-algorithm" | relative_url}})
-  - [Prim's Algorithm]({{"2021/04/19/kruskal-and-prim-algorithm.html#prims-algorithm" | relative_url}})
-  - [Disjoint Set & Path Compression]({{"/2021/10/26/disjoint-set-and-path-compression.html" | relative_url}})
-- [Intervel Scheduling & Partitioning]({{"/2021/04/20/interval-scheduling-and-partitioning.html" | relative_url}})
-- [Huffman Encoding]({{"/2021/10/08/Huffman-encoding.html" | relative_url}})
-- [Clustering of Maximum Spacing]({{"/2021/10/29/clustering-of-maximum-spacing.html" | relative_url}})
-
-## [Dynamic Programming]({{"/2021/04/20/dynamic-programming.html" | relative_url}})
-
-- [LIS; Longest Incresaing Subsequences]({{"/2021/04/20/longest-increasing-subsequences.html" | relative_url}})
-- [Edit Distance]({{"/2021/04/20/edit-distanace.html" | relative_url}})
-  - [Dameraus-Levenshtein Distance]({{"/2021/04/24/Damerau-Levenshtein-distance.html" | relative_url}}) 🎈
-- [Knapsack]({{"/2021/04/30/kanpsack.html" | relative_url}})
-- [Chain Matrix Multiplication]({{"/2021/05/02/chain-matrix-multiplication.html" | relative_url}})
-- [Shortest Reliable Paths]({{"/2021/06/13/shortest-reliable-paths.html" | relative_url}})
-- [All Pairs Shortest Paths; Floyd-Warshall]({{"/2021/06/13/all-pairs-shortest-paths.html" | relative_url}})
-- [TSP; Traveling Salesman Problem]({{"/2021/06/13/traveling-salesman-problem.html" | relative_url}})
+  - [Kruskal's Algorithm]({{"/2021/04/19/kruskal-and-prim-algorithm#kruskals-algorithm" | relative_url}})
+  - [Prim's Algorithm]({{"2021/04/19/kruskal-and-prim-algorithm#prims-algorithm" | relative_url}})
+  - [Disjoint Set & Path Compression]({{"/2021/10/26/disjoint-set-and-path-compression" | relative_url}})
+- [Intervel Scheduling & Partitioning]({{"/2021/04/20/interval-scheduling-and-partitioning" | relative_url}})
+- [Huffman Encoding]({{"/2021/10/08/Huffman-encoding" | relative_url}})
+- [Clustering of Maximum Spacing]({{"/2021/10/29/clustering-of-maximum-spacing" | relative_url}})
+
+## [Dynamic Programming]({{"/2021/04/20/dynamic-programming" | relative_url}})
+
+- [LIS; Longest Incresaing Subsequences]({{"/2021/04/20/longest-increasing-subsequences" | relative_url}})
+- [Edit Distance]({{"/2021/04/20/edit-distanace" | relative_url}})
+  - [Dameraus-Levenshtein Distance]({{"/2021/04/24/Damerau-Levenshtein-distance" | relative_url}}) 🎈
+- [Knapsack]({{"/2021/04/30/kanpsack" | relative_url}})
+- [Chain Matrix Multiplication]({{"/2021/05/02/chain-matrix-multiplication" | relative_url}})
+- [Shortest Reliable Paths]({{"/2021/06/13/shortest-reliable-paths" | relative_url}})
+- [All Pairs Shortest Paths; Floyd-Warshall]({{"/2021/06/13/all-pairs-shortest-paths" | relative_url}})
+- [TSP; Traveling Salesman Problem]({{"/2021/06/13/traveling-salesman-problem" | relative_url}})
   - 완전탐색
   - DP
-- [Independent Sets in Tree]({{"/2021/07/10/independent-sets-in-tree.html" | relative_url}})
-- [Weighted Interval Scheduling]({{"/2021/07/12/weighted-interval-scheduling.html" | relative_url}})
-- [Segmented Least Squares]({{"/2021/07/12/segmented-least-squares.html" | relative_url}})
+- [Independent Sets in Tree]({{"/2021/07/10/independent-sets-in-tree" | relative_url}})
+- [Weighted Interval Scheduling]({{"/2021/07/12/weighted-interval-scheduling" | relative_url}})
+- [Segmented Least Squares]({{"/2021/07/12/segmented-least-squares" | relative_url}})
 
 ## Linear Programming
 
-- [Linear Programming]({{"2021/10/30/linear-programming.html" | relative_url}})
-- [Simplex Method]({{"/2021/11/16/simplex-method.html" | relative_url}})
+- [Linear Programming]({{"2021/10/30/linear-programming" | relative_url}})
+- [Simplex Method]({{"/2021/11/16/simplex-method" | relative_url}})
 
-## [Network Flow]({{"/2021/07/16/network-flow.html" | relative_url}})
+## [Network Flow]({{"/2021/07/16/network-flow" | relative_url}})
 
-- [Max-Flow Min-Cut Theorem]({{"/2021/07/16/network-flow.html#residual-network" | relative_url}})
-- [Ford-Fulkerson Algorithm & Edmons-Karp Algorithm]({{"/2021/10/03/ford-fulkerson-algorithm-and-edmons-karp-algorithm.html" | relative_url}})
-- [Bipartite Matching]({{"/2021/10/04/bipartite-matching.html" | relative_url}})
+- [Max-Flow Min-Cut Theorem]({{"/2021/07/16/network-flow#residual-network" | relative_url}})
+- [Ford-Fulkerson Algorithm & Edmons-Karp Algorithm]({{"/2021/10/03/ford-fulkerson-algorithm-and-edmons-karp-algorithm" | relative_url}})
+- [Bipartite Matching]({{"/2021/10/04/bipartite-matching" | relative_url}})
 - Variations of Network Flow Problem
 - Dinic Algorithm 🎈
 
 ## NP & NP-complete
 
-- [P and NP]({{"/2022/01/14/P-and-NP.html" | relative_url}})
-  - [Satisfiability (SAT)]({{"/2022/05/07/satisfiability.html" | relative_url}})
-  - [Traveling Salesman Problem (TSP)]({{"/2021/06/13/traveling-salesman-problem.html" | relative_url}})
-  - [Hamilton Cycle Problem (HCP)]({{"/2022/03/12/hamilton-cycle-problem.html" | relative_url}})
-  - [Balanced Cut]({{"/2022/05/07/balanced-cut.html" | relative_url}})
-  - [3D Matching]({{"/2022/05/07/3D-matching.html" | relative_url}})
+- [P and NP]({{"/2022/01/14/P-and-NP" | relative_url}})
+  - [Satisfiability (SAT)]({{"/2022/05/07/satisfiability" | relative_url}})
+  - [Traveling Salesman Problem (TSP)]({{"/2021/06/13/traveling-salesman-problem" | relative_url}})
+  - [Hamilton Cycle Problem (HCP)]({{"/2022/03/12/hamilton-cycle-problem" | relative_url}})
+  - [Balanced Cut]({{"/2022/05/07/balanced-cut" | relative_url}})
+  - [3D Matching]({{"/2022/05/07/3D-matching" | relative_url}})
   - Integer Linear Programming 🎈
-  - [Independent Set, Vertex Cover, Clique]({{"/2022/05/08/independent-set-and-vertex-cover-and-clique.html" | relative_url}})
-  - [Longest Path, Subset Sum]({{"/2022/05/08/longest-path-and-subset-sum.html" | relative_url}})
+  - [Independent Set, Vertex Cover, Clique]({{"/2022/05/08/independent-set-and-vertex-cover-and-clique" | relative_url}})
+  - [Longest Path, Subset Sum]({{"/2022/05/08/longest-path-and-subset-sum" | relative_url}})
 
-- [Reductions]({{"/2022/05/08/reduction-1.html" | relative_url}})
-  - [Reduction and NP-complete]({{"/2022/05/08/reduction-1.html" | relative_url}})
+- [Reductions]({{"/2022/05/08/reduction-1" | relative_url}})
+  - [Reduction and NP-complete]({{"/2022/05/08/reduction-1" | relative_url}})
     - Mapping Reduction & Polynomial Reduction 🎈
-    - [NP-complete and NP-hard]({{"/2022/05/10/NP-complete-and-NP-hard.html" | relative_url}})
-  - [Reduction (2)]({{"/2022/05/12/reduction-2.html" | relative_url}})
+    - [NP-complete and NP-hard]({{"/2022/05/10/NP-complete-and-NP-hard" | relative_url}})
+  - [Reduction (2)]({{"/2022/05/12/reduction-2" | relative_url}})
     - 3-SAT → Independent-Set
     - Independent-Set → Vertex Cover
     - Independent-Set → Clique
     - 3-SAT → Clique
-  - [Reduction (3)]({{"/2022/05/13/reduction-3.html" | relative_url}})
+  - [Reduction (3)]({{"/2022/05/13/reduction-3" | relative_url}})
     - 3-SAT → 3D-Matching
-  - [Reduction (4): Circuit-SAT and Cook-Levin Theorem]({{"/2022/05/14/reduction-4.html" | relative_url}})
+  - [Reduction (4): Circuit-SAT and Cook-Levin Theorem]({{"/2022/05/14/reduction-4" | relative_url}})
 
-## [Coping with NP-hardness]({{"/2022/05/18/coping-with-np-hardness.html" | relative_url}})
+## [Coping with NP-hardness]({{"/2022/05/18/coping-with-np-hardness" | relative_url}})
 
 - Exhaustive Search
-  - [Backtracking]({{"/2022/05/19/bacaktracking.html" | relative_url}})
-  - [Branch-and-Bound]({{"/2022/05/20/branch-and-bound.html" | relative_url}})
+  - [Backtracking]({{"/2022/05/19/bacaktracking" | relative_url}})
+  - [Branch-and-Bound]({{"/2022/05/20/branch-and-bound" | relative_url}})
 - Heuristic Algorithm
-  - [Local Search]({{"/2022/05/20/local-search.html" | relative_url}})
+  - [Local Search]({{"/2022/05/20/local-search" | relative_url}})
 
 ## Appendix
 
-- [Amortized Analysis]({{"/2021/05/08/amortized-analysis.html" | relative_url}}) 🎈
+- [Amortized Analysis]({{"/2021/05/08/amortized-analysis" | relative_url}}) 🎈
   - Accounting Method
-- [Implementations of Heap]({{"/2021/05/03/implementations-of-heap.html" | relative_url}}) 🎈
+- [Implementations of Heap]({{"/2021/05/03/implementations-of-heap" | relative_url}}) 🎈
   - Heap by unordered array & ordered array
   - Binary Heap
-  - [d-ary Heap]({{"/2021/05/03/implementations-of-heap.html#d-ary-heap" | relative_url}})
-  - [Binomial Heap]({{"/2021/05/03/implementations-of-heap.html#binomial-heap" | relative_url}})
+  - [d-ary Heap]({{"/2021/05/03/implementations-of-heap#d-ary-heap" | relative_url}})
+  - [Binomial Heap]({{"/2021/05/03/implementations-of-heap#binomial-heap" | relative_url}})
     - Binomial Tree
-  - [Lazy-Binomial Heap]({{"2021/05/03/implementations-of-heap.html#lazy-binomial-heap" | relative_url}})
-  - [Fibonacci Heap]({{"/2021/05/03/implementations-of-heap.html#fibonacci-heap" | relative_url}}) 🔥
+  - [Lazy-Binomial Heap]({{"2021/05/03/implementations-of-heap#lazy-binomial-heap" | relative_url}})
+  - [Fibonacci Heap]({{"/2021/05/03/implementations-of-heap#fibonacci-heap" | relative_url}}) 🔥
 - FFT; Fast Fourier Transformation 🎈
 
 ## 참고 교재

_pages/categories/artificial-intelligence.md

@@ -14,7 +14,7 @@ toc_sticky: true
 
 <hr/>
 
-- [Introduction to AI]({{"/2021/05/20/intro-to-artificial-intelligence.html" | relative_url}})
+- [Introduction to AI]({{"/2021/05/20/intro-to-artificial-intelligence" | relative_url}})
 
 ## Reflex-based Model
 

_pages/categories/calculus.md

@@ -7,4 +7,4 @@ toc_sticky: true
 
 
 
-- [Taylor Series & Macluarin Series]({{"/2022/10/29/talyor-series-and-maclaurin-series.html" | relative_url}})
+- [Taylor Series & Macluarin Series]({{"/2022/10/29/talyor-series-and-maclaurin-series" | relative_url}})

_pages/categories/complex-variable.md

@@ -13,14 +13,14 @@ toc_sticky: true
 
 # Part I - Complex Functions
 
-- [Complex Variable - Basic]({{"2021/01/24/complex-variable-basic.html" | relative_url}})
+- [Complex Variable - Basic]({{"2021/01/24/complex-variable-basic" | relative_url}})
   - Triangle inequality
   - Euler’s formula
   - de Moivre’s formula
   - $n$-th root of $z$
   - Interior / Exteriror / Boundary
 
-- [Complex Analysis - Basic]({{"2021/01/26/complex-analysis-basic.html" | relative_url}})
+- [Complex Analysis - Basic]({{"2021/01/26/complex-analysis-basic" | relative_url}})
   - Complex Functions
   - Complex Limit
   - Complex Continuity
@@ -57,10 +57,10 @@ $$
 
 </div>
 
-- [Cauchy-Riemann Equation]({{"2021/02/07/Cauchy-Riemann-Equation.html" | relative_url}})
+- [Cauchy-Riemann Equation]({{"2021/02/07/Cauchy-Riemann-Equation" | relative_url}})
   - Laplace's Equation & Harmonic functions
   - harmonic conjugate
-- [Elementary Complex Functions]({{"2021/02/09/Elementary-Complex-Functions.html" | relative_url}})
+- [Elementary Complex Functions]({{"2021/02/09/Elementary-Complex-Functions" | relative_url}})
   - Exponential Functions; $\exp z$
   - Trigonometric Functions; $\cos z$, $\sin z$, $\tan z$
   - Hyperbolic Functions; $\cosh z$, $\sinh z$
@@ -97,18 +97,18 @@ $$
 
 </div>
 
-- [Contour Integrals]({{"2021/02/14/Cotour-integrals.html" | relative_url}})
+- [Contour Integrals]({{"2021/02/14/Cotour-integrals" | relative_url}})
   - parametric curves
   - Length of Curve; $\lvert C \rvert$
-- [Complex Integrations]({{"2021/02/18/Complex-Integrations.html" | relative_url}})
+- [Complex Integrations]({{"2021/02/18/Complex-Integrations" | relative_url}})
   - Primitive Function
   - Bounds for integrals: ML-inequality
-- [Cauchy-Goursat Theorem]({{"2021/02/21/Cauchy-Goursat-theorem.html" | relative_url}})
+- [Cauchy-Goursat Theorem]({{"2021/02/21/Cauchy-Goursat-theorem" | relative_url}})
   - Cauchy's proof (feat. Green's theorem)
   - Goursat's proof
-- [Cauchy’s Integral Formula]({{"2021/02/23/Cauchy-integral-formula.html" | relative_url}})
-- [Extended Cauchy's Integral Formula]({{"2021/03/07/extension-of-Cauchy-integral-formula.html#extension-of-cauchys-integral-formula" | relative_url}})
-- [Applications of Cauchy Integral]({{"2021/03/07/extension-of-Cauchy-integral-formula.html#application-of-cauchy-integral" | relative_url}})
+- [Cauchy’s Integral Formula]({{"2021/02/23/Cauchy-integral-formula" | relative_url}})
+- [Extended Cauchy's Integral Formula]({{"2021/03/07/extension-of-Cauchy-integral-formula#extension-of-cauchys-integral-formula" | relative_url}})
+- [Applications of Cauchy Integral]({{"2021/03/07/extension-of-Cauchy-integral-formula#application-of-cauchy-integral" | relative_url}})
   - Cauchy's Inequality
   - Liouville’s Theroem
   - Fundamental Theorem of Algebra
@@ -178,17 +178,17 @@ $$
   <img src="https://mathworld.wolfram.com/images/eps-gif/Contour_750.gif">
 </div>
 
-- [Residue Theorem]({{"2020/11/30/Residue-Thm.html" | relative_url}})
-- [singular points & poles]({{"2020/11/30/singulars-poles.html" | relative_url}})
-- [Formulas for residue]({{"2020/12/01/formulas-for-residue.html" | relative_url}})
-- [Applications to real integrals]({{"2020/12/02/Applications-to-real-integrals.html" | relative_url}}); integral with $\cos$, $\sin$ / improper integral
+- [Residue Theorem]({{"2020/11/30/Residue-Thm" | relative_url}})
+- [singular points & poles]({{"2020/11/30/singulars-poles" | relative_url}})
+- [Formulas for residue]({{"2020/12/01/formulas-for-residue" | relative_url}})
+- [Applications to real integrals]({{"2020/12/02/Applications-to-real-integrals" | relative_url}}); integral with $\cos$, $\sin$ / improper integral
 
 <hr/>
 
 # Part V - Complex Transformation
 
-- [Linear Transformation]({{"2020/12/14/Linear-Transformation.html" | relative_url}})
-- [Linear Fractional Trnasformation]({{"2020/12/15/Linear-Fractional-Trenasformation.html" | relative_url}})
+- [Linear Transformation]({{"2020/12/14/Linear-Transformation" | relative_url}})
+- [Linear Fractional Trnasformation]({{"2020/12/15/Linear-Fractional-Trenasformation" | relative_url}})
 - Conformal mapping
   - $w = \sin z$
 - Laplace's Equation

_pages/categories/computer-vision.md

@@ -175,10 +175,10 @@ toc_sticky: true
 
 ### Metric Learning
 - Pairwise & Triplet Metric
-- [Mahalanobis Distance]({{"2020/12/02/metric-learning-1.html#mahalanobis-distance" | relative_url}})
-- [A first approach to distnace metric learning]({{"2020/12/02/metric-learning-1.html#a-first-approach-to-distnace-metric-learning" | relative_url}}) <small>(Pairwise)</small>
-- [Large Margin Nearest Neighbor(LMNN)]({{"2020/12/02/metric-learning-1.html#mahalanobis-distance" | relative_url}}) <small>(Triplet)</small>
-- [Metric Learning + DL]({{"2020/12/02/metric-learning-1.html#metric-learning--dl" | relative_url}})
+- [Mahalanobis Distance]({{"2020/12/02/metric-learning-1#mahalanobis-distance" | relative_url}})
+- [A first approach to distnace metric learning]({{"2020/12/02/metric-learning-1#a-first-approach-to-distnace-metric-learning" | relative_url}}) <small>(Pairwise)</small>
+- [Large Margin Nearest Neighbor(LMNN)]({{"2020/12/02/metric-learning-1#mahalanobis-distance" | relative_url}}) <small>(Triplet)</small>
+- [Metric Learning + DL]({{"2020/12/02/metric-learning-1#metric-learning--dl" | relative_url}})
 
 <br>
 <hr>
@@ -208,7 +208,7 @@ toc_sticky: true
 
 #### Visual Tracking
 - Probabilistic Tracking
-- [Sequential Density Estimation]({{"2020/12/15/Sequential-Density-Estimation.html" | relative_url}})
+- [Sequential Density Estimation]({{"2020/12/15/Sequential-Density-Estimation" | relative_url}})
 - Kalman Filter
 - Particle Filtering
 

_pages/categories/data-mining.md

@@ -9,5 +9,5 @@ toc_sticky: true
 
 2021-1학기에 수강한 POSTECH 김원화 교수님의 "**데이터 마이닝(CSED526)**" 수업에서 배운 것을 정리했습니다. 😁
 
-- [Naive Bayes Classifier]({{"/2021/05/09/naive-bayes-classifier.html" | relative_url}})
-- [Density Estimation]({{"/2022/03/06/density-estimation.html" | relative_url}})
+- [Naive Bayes Classifier]({{"/2021/05/09/naive-bayes-classifier" | relative_url}})
+- [Density Estimation]({{"/2022/03/06/density-estimation" | relative_url}})