[Machine Learning]: #5 Computing Parameters Analytically

[Machine Learning]: Computing Parameters Analytically

[Write Infront]:

We have already know the Gradient Descent Algo, Today we are going to talk another way to min the Cost Function, we call this Normal Equation!

[Normal Equation]:

The Normal Equation Formula is given below: $$\theta = {({X^T}X)^{ - 1}}{X^T}Y$$

here is an example of how to use it:

If we use this method, there is no need to do Feature Scaling

[Comparison]:

Gradient Descent	Normal Equation
Need to choose $\alpha$	No need to choose $\alpha$
Needs many iterations	No need to iterate
$O(k{n^2})$	$O({n^3})$
Works well when n is large	Slow if n is very large

Comments

[LeetCode Solution 230]: Kth Smallest Element in a BST

Question: Given a binary search tree, write a function kthSmallest to find the k th smallest element in it. ************************************************************************************************************************************ Write Infront To read to a tutorial, please to read the tutorial of in-order traversal of BST, please check: LeetCode Solution 94: Binary Tree Inorder Traversal We are going to solve this question using the following 4 methods: ->Binary Search ->Recursive ->Iterative ->Morris Approach #1 Binary Search [Accepted] Detail Explanation The first method to solve this problem is using Binary Search. The idea is very easy and extremely to think. We use BST's property that the left child of the root is smaller than the root while the right child of the root is always bigger. We consider that the root is the pivot, and find the number of the nodes in the left subtree and the number of ...

[LeetCode Solution 145] Binary Tree Postorder Traversal

[LeetCode Solution 145]: Binary Tree Postorder Traversal Question: Given a binary tree, return the postorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3} , 1 \ 2 / 3 return [3,2,1] . Approach #1 Recursive [Accepted] Detail Explanation The first method to solve this problem is using recursive. This is the classical method and straightforward. we can define a helper function to implement recursion. The java code is as follows: Java public class Solution { public List<Integer> postorderTraversal (TreeNode root) { List<Integer> res = new ArrayList<>(); helper(root, res); return res; } public void helper (TreeNode root, List<Integer> res) { if (root != null ) { if (root.left != null ) { helper(root.left, res); } if (root.right != null ) { helper(root.right, res); } res.add(root.val); } } } Complexity Analysis Ti...

[LeetCode Solution 144] Binary Tree Preorder Traversal

[LeetCode 144] Given a binary tree, return the preorder traversal of its nodes' values. For example: Given binary tree, {1,#,2,3} 1 \ 2 / 3 return [1,2,3] . Note: Recursive solution is trivial, could you do it iteratively? ***************************************************************************************************************** Solution: [My Solution on LeetCode] Approach #1 Recursive Detail Explanation The first method to solve this problem is using recursive. This is the classical method and straightforward. we can define a helper function to implement recursion. The java code is as follows: Java public List<Integer> preorderTraversal (TreeNode root) { List<Integer> res = new ArrayList<>(); helper(root, res); return res; } public void helper (TreeNode root, List<Integer> res) { if (root != null ) { res.add(root.val); if (root.left != null ...

MY

Search This Blog