commit 12bc1baf33b3b5dd40575abaa8f7b2e09d34f34e
parent 9aab798e75913d9374f54998b5589a2c06726857
Author: Andrew <andrewlaack1@gmail.com>
Date: Tue, 12 Nov 2024 14:08:33 -0600
took notes
Diffstat:
6 files changed, 45 insertions(+), 4 deletions(-)
diff --git a/Algorithms.md b/Algorithms.md
@@ -79,7 +79,9 @@ Ch 6 (Information Theory and Data Compression)
- [BinaryCode](BinaryCode.md)
- [Entropy](Entropy.md)
- [InformationContent](InformationContent.md)
- - RootedTree
+ - HuffmanCoding
+ - RootedTree (ordered pair (T,r) where r is the root (arbitrary) and T is a graph (tree))
+ - Leaf - Exactly one neighbor
#### Other Stuff To Look At
diff --git a/Assembly.md b/Assembly.md
@@ -121,6 +121,10 @@ Corresponding pop:
pop {R1, R2}
+consider incrementing count in insert
+
+---
+
+Processing GPIO interrupts
-consider incrementing count in insert
diff --git a/BinaryCode.md b/BinaryCode.md
@@ -8,3 +8,29 @@ Ch 6
**Definition:** A binary code for S is a function c from S -> {0,1} * .
Basically, this is the function to encode elements of S to binary.
+
+### Proper
+
+A proper binary code is a binary code such that there are not any possible combinations of codes that can be confused with each other.
+
+Example of improper:
+
+S = {'A', 'B', 'C'}
+
+c : S -> {0,1}\*
+
+c('A') = 0
+
+c('B') = 01
+
+c('C') = 10
+
+The problem here is that we don't know if 010 is BA or CA. This is because the prefix of B is A.
+
+It is sufficient to ensure all codewords are not prefixes for other codewords.
+
+#### Prefix Property
+
+**Definition:** c : S -> {0,1}\* be a binary code. We say c has the prefix property if no codeword is a prefix of any other codeword.
+
+$\forall x,y \in S, x \neq y$ then there are no strings r such that $c(x) = c(y) + r$
diff --git a/Codeword.md b/Codeword.md
@@ -8,3 +8,7 @@ Ch 6
**Definition:** A codeword is an element c(x) where c is a binary code and x is a message.
Remember, a binary code is defined as c : S -> {0,1}\*.
+
+To find the average codeword length we simply compute:
+
+$\frac{\sum_{x\in S} P(x) len(c(x))}{|S|}$
diff --git a/MachineLearning.md b/MachineLearning.md
@@ -35,9 +35,13 @@ Deep Learning With Python (Francois Chollet):
Ch 1:
* [RepresentationLearning](RepresentationLearning.md)
-*
+* LossFunction - Cost Function - Objective Function
-Introduction to Statistical Learning (Python):
+Ch 2:
+
+FINISH CH 1 NOTES FIRST!!!
+
+ISL Python:
Ch 2:
- [[Inference.md]]
diff --git a/index.md b/index.md
@@ -52,3 +52,4 @@ ML
- [ ] Transformer
- [ ] KAN
- [ ] Linear Regression statistical approach
+ - [ ] Boosting (XGBoost, AdaBoost, LightGBM, etc.)
