Skip to content

Commit

Permalink
Built site for gh-pages
Browse files Browse the repository at this point in the history
  • Loading branch information
Quarto GHA Workflow Runner committed Oct 14, 2024
1 parent c088fe5 commit e3397fd
Show file tree
Hide file tree
Showing 9 changed files with 456 additions and 456 deletions.
2 changes: 1 addition & 1 deletion .nojekyll
Original file line number Diff line number Diff line change
@@ -1 +1 @@
a9c76953
a6b74f38
27 changes: 14 additions & 13 deletions schedule/slides/15-LDA-and-QDA.html
Original file line number Diff line number Diff line change
Expand Up @@ -398,7 +398,7 @@
<h2>15 LDA and QDA</h2>
<p><span class="secondary">Stat 406</span></p>
<p><span class="secondary">Geoff Pleiss, Trevor Campbell</span></p>
<p>Last modified – 09 October 2023</p>
<p>Last modified – 14 October 2024</p>
<p><span class="math display">\[
\DeclareMathOperator*{\argmin}{argmin}
\DeclareMathOperator*{\argmax}{argmax}
Expand All @@ -424,33 +424,34 @@ <h2>15 LDA and QDA</h2>
\newcommand{\bls}{\widehat{\beta}_{ols}}
\newcommand{\blt}{\widehat{\beta}^L_{s}}
\newcommand{\bll}{\widehat{\beta}^L_{\lambda}}
\newcommand{\U}{\mathbf{U}}
\newcommand{\D}{\mathbf{D}}
\newcommand{\V}{\mathbf{V}}
\]</span></p>
</section>
<section id="last-time" class="slide level2">
<h2>Last time</h2>
<p>We showed that with two classes, the <span class="secondary">Bayes’ classifier</span> is</p>
<p><span class="math display">\[g_*(X) = \begin{cases}
1 &amp; \textrm{ if } \frac{p_1(X)}{p_0(X)} &gt; \frac{1-\pi}{\pi} \\
<p><span class="math display">\[g_*(x) = \begin{cases}
1 &amp; \textrm{ if } \frac{p_1(x)}{p_0(x)} &gt; \frac{1-\pi}{\pi} \\
0 &amp; \textrm{ otherwise}
\end{cases}\]</span></p>
<p>where <span class="math inline">\(p_1(X) = Pr(X \given Y=1)\)</span>, <span class="math inline">\(p_0(X) = Pr(X \given Y=0)\)</span> and <span class="math inline">\(\pi = Pr(Y=1)\)</span></p>
<p>where <span class="math inline">\(p_1(x) = \Pr(X=x \given Y=1)\)</span>, <span class="math inline">\(p_0(x) = \Pr(X=x \given Y=0)\)</span> and <span class="math inline">\(\pi = \Pr(Y=1)\)</span></p>
<div class="fragment">
<p>For more than two classes.</p>
<p><span class="math display">\[g_*(X) =
\argmax_k \frac{\pi_k p_k(X)}{\sum_k \pi_k p_k(X)}\]</span></p>
<p>where <span class="math inline">\(p_k(X) = Pr(X \given Y=k)\)</span> and <span class="math inline">\(\pi_k = P(Y=k)\)</span></p>
<p>For more than two classes:</p>
<p><span class="math display">\[g_*(x) =
\argmax_k \frac{\pi_k p_k(x)}{\sum_k \pi_k p_k(x)}\]</span></p>
<p>where <span class="math inline">\(p_k(x) = \Pr(X=x \given Y=k)\)</span> and <span class="math inline">\(\pi_k = P(Y=k)\)</span></p>
</div>
</section>
<section id="estimating-these" class="slide level2">
<h2>Estimating these</h2>
<p>Let’s make some assumptions:</p>
<ol type="1">
<li><span class="math inline">\(Pr(X\given Y=k) = \mbox{N}(\mu_k,\Sigma_k)\)</span></li>
<li><span class="math inline">\(\Pr(X=x\given Y=k) = \mbox{N}(x; \mu_k,\Sigma_k)\)</span></li>
<li><span class="math inline">\(\Sigma_k = \Sigma_{k'} = \Sigma\)</span></li>
</ol>
<div class="fragment">
<p>This leads to <span class="secondary">Linear Discriminant Analysis</span> (LDA), one of the oldest classifiers</p>
</div>
</section>
<section id="lda" class="slide level2">
<h2>LDA</h2>
Expand Down Expand Up @@ -606,10 +607,10 @@ <h2></h2>
</section>
<section id="naïve-bayes" class="slide level2">
<h2>Naïve Bayes</h2>
<p>Assume that <span class="math inline">\(Pr(X | Y = k) = Pr(X_1 | Y = k)\cdots Pr(X_p | Y = k)\)</span>.</p>
<p>Assume that <span class="math inline">\(\Pr(X=x | Y = k) = \Pr(X_1=x_1 | Y = k)\cdots \Pr(X_p=x_p | Y = k)\)</span>.</p>
<p>That is, conditional on the class, the feature distribution is independent.</p>
<div class="fragment">
<p>If we further assume that <span class="math inline">\(Pr(X_j | Y = k)\)</span> is Gaussian,</p>
<p>If we further assume that <span class="math inline">\(\Pr(X_j=x_j | Y = k)\)</span> is Gaussian,</p>
<p>This is the same as QDA but with <span class="math inline">\(\Sigma_k\)</span> Diagonal.</p>
</div>
<div class="fragment">
Expand Down
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
8 changes: 4 additions & 4 deletions search.json
Original file line number Diff line number Diff line change
Expand Up @@ -3735,21 +3735,21 @@
"href": "schedule/slides/15-LDA-and-QDA.html#section",
"title": "UBC Stat406 2024W",
"section": "15 LDA and QDA",
"text": "15 LDA and QDA\nStat 406\nGeoff Pleiss, Trevor Campbell\nLast modified – 09 October 2023\n\\[\n\\DeclareMathOperator*{\\argmin}{argmin}\n\\DeclareMathOperator*{\\argmax}{argmax}\n\\DeclareMathOperator*{\\minimize}{minimize}\n\\DeclareMathOperator*{\\maximize}{maximize}\n\\DeclareMathOperator*{\\find}{find}\n\\DeclareMathOperator{\\st}{subject\\,\\,to}\n\\newcommand{\\E}{E}\n\\newcommand{\\Expect}[1]{\\E\\left[ #1 \\right]}\n\\newcommand{\\Var}[1]{\\mathrm{Var}\\left[ #1 \\right]}\n\\newcommand{\\Cov}[2]{\\mathrm{Cov}\\left[#1,\\ #2\\right]}\n\\newcommand{\\given}{\\ \\vert\\ }\n\\newcommand{\\X}{\\mathbf{X}}\n\\newcommand{\\x}{\\mathbf{x}}\n\\newcommand{\\y}{\\mathbf{y}}\n\\newcommand{\\P}{\\mathcal{P}}\n\\newcommand{\\R}{\\mathbb{R}}\n\\newcommand{\\norm}[1]{\\left\\lVert #1 \\right\\rVert}\n\\newcommand{\\snorm}[1]{\\lVert #1 \\rVert}\n\\newcommand{\\tr}[1]{\\mbox{tr}(#1)}\n\\newcommand{\\brt}{\\widehat{\\beta}^R_{s}}\n\\newcommand{\\brl}{\\widehat{\\beta}^R_{\\lambda}}\n\\newcommand{\\bls}{\\widehat{\\beta}_{ols}}\n\\newcommand{\\blt}{\\widehat{\\beta}^L_{s}}\n\\newcommand{\\bll}{\\widehat{\\beta}^L_{\\lambda}}\n\\]"
"text": "15 LDA and QDA\nStat 406\nGeoff Pleiss, Trevor Campbell\nLast modified – 14 October 2024\n\\[\n\\DeclareMathOperator*{\\argmin}{argmin}\n\\DeclareMathOperator*{\\argmax}{argmax}\n\\DeclareMathOperator*{\\minimize}{minimize}\n\\DeclareMathOperator*{\\maximize}{maximize}\n\\DeclareMathOperator*{\\find}{find}\n\\DeclareMathOperator{\\st}{subject\\,\\,to}\n\\newcommand{\\E}{E}\n\\newcommand{\\Expect}[1]{\\E\\left[ #1 \\right]}\n\\newcommand{\\Var}[1]{\\mathrm{Var}\\left[ #1 \\right]}\n\\newcommand{\\Cov}[2]{\\mathrm{Cov}\\left[#1,\\ #2\\right]}\n\\newcommand{\\given}{\\ \\vert\\ }\n\\newcommand{\\X}{\\mathbf{X}}\n\\newcommand{\\x}{\\mathbf{x}}\n\\newcommand{\\y}{\\mathbf{y}}\n\\newcommand{\\P}{\\mathcal{P}}\n\\newcommand{\\R}{\\mathbb{R}}\n\\newcommand{\\norm}[1]{\\left\\lVert #1 \\right\\rVert}\n\\newcommand{\\snorm}[1]{\\lVert #1 \\rVert}\n\\newcommand{\\tr}[1]{\\mbox{tr}(#1)}\n\\newcommand{\\brt}{\\widehat{\\beta}^R_{s}}\n\\newcommand{\\brl}{\\widehat{\\beta}^R_{\\lambda}}\n\\newcommand{\\bls}{\\widehat{\\beta}_{ols}}\n\\newcommand{\\blt}{\\widehat{\\beta}^L_{s}}\n\\newcommand{\\bll}{\\widehat{\\beta}^L_{\\lambda}}\n\\newcommand{\\U}{\\mathbf{U}}\n\\newcommand{\\D}{\\mathbf{D}}\n\\newcommand{\\V}{\\mathbf{V}}\n\\]"
},
{
"objectID": "schedule/slides/15-LDA-and-QDA.html#last-time",
"href": "schedule/slides/15-LDA-and-QDA.html#last-time",
"title": "UBC Stat406 2024W",
"section": "Last time",
"text": "Last time\nWe showed that with two classes, the Bayes’ classifier is\n\\[g_*(X) = \\begin{cases}\n1 & \\textrm{ if } \\frac{p_1(X)}{p_0(X)} &gt; \\frac{1-\\pi}{\\pi} \\\\\n0 & \\textrm{ otherwise}\n\\end{cases}\\]\nwhere \\(p_1(X) = Pr(X \\given Y=1)\\), \\(p_0(X) = Pr(X \\given Y=0)\\) and \\(\\pi = Pr(Y=1)\\)\n\nFor more than two classes.\n\\[g_*(X) =\n\\argmax_k \\frac{\\pi_k p_k(X)}{\\sum_k \\pi_k p_k(X)}\\]\nwhere \\(p_k(X) = Pr(X \\given Y=k)\\) and \\(\\pi_k = P(Y=k)\\)"
"text": "Last time\nWe showed that with two classes, the Bayes’ classifier is\n\\[g_*(x) = \\begin{cases}\n1 & \\textrm{ if } \\frac{p_1(x)}{p_0(x)} &gt; \\frac{1-\\pi}{\\pi} \\\\\n0 & \\textrm{ otherwise}\n\\end{cases}\\]\nwhere \\(p_1(x) = \\Pr(X=x \\given Y=1)\\), \\(p_0(x) = \\Pr(X=x \\given Y=0)\\) and \\(\\pi = \\Pr(Y=1)\\)\n\nFor more than two classes:\n\\[g_*(x) =\n\\argmax_k \\frac{\\pi_k p_k(x)}{\\sum_k \\pi_k p_k(x)}\\]\nwhere \\(p_k(x) = \\Pr(X=x \\given Y=k)\\) and \\(\\pi_k = P(Y=k)\\)"
},
{
"objectID": "schedule/slides/15-LDA-and-QDA.html#estimating-these",
"href": "schedule/slides/15-LDA-and-QDA.html#estimating-these",
"title": "UBC Stat406 2024W",
"section": "Estimating these",
"text": "Estimating these\nLet’s make some assumptions:\n\n\\(Pr(X\\given Y=k) = \\mbox{N}(\\mu_k,\\Sigma_k)\\)\n\\(\\Sigma_k = \\Sigma_{k'} = \\Sigma\\)\n\n\nThis leads to Linear Discriminant Analysis (LDA), one of the oldest classifiers"
"text": "Estimating these\nLet’s make some assumptions:\n\n\\(\\Pr(X=x\\given Y=k) = \\mbox{N}(x; \\mu_k,\\Sigma_k)\\)\n\\(\\Sigma_k = \\Sigma_{k'} = \\Sigma\\)\n\nThis leads to Linear Discriminant Analysis (LDA), one of the oldest classifiers"
},
{
"objectID": "schedule/slides/15-LDA-and-QDA.html#lda",
Expand Down Expand Up @@ -3833,7 +3833,7 @@
"href": "schedule/slides/15-LDA-and-QDA.html#naïve-bayes",
"title": "UBC Stat406 2024W",
"section": "Naïve Bayes",
"text": "Naïve Bayes\nAssume that \\(Pr(X | Y = k) = Pr(X_1 | Y = k)\\cdots Pr(X_p | Y = k)\\).\nThat is, conditional on the class, the feature distribution is independent.\n\nIf we further assume that \\(Pr(X_j | Y = k)\\) is Gaussian,\nThis is the same as QDA but with \\(\\Sigma_k\\) Diagonal.\n\n\nDon’t have to assume Gaussian. Could do lots of stuff."
"text": "Naïve Bayes\nAssume that \\(\\Pr(X=x | Y = k) = \\Pr(X_1=x_1 | Y = k)\\cdots \\Pr(X_p=x_p | Y = k)\\).\nThat is, conditional on the class, the feature distribution is independent.\n\nIf we further assume that \\(\\Pr(X_j=x_j | Y = k)\\) is Gaussian,\nThis is the same as QDA but with \\(\\Sigma_k\\) Diagonal.\n\n\nDon’t have to assume Gaussian. Could do lots of stuff."
},
{
"objectID": "schedule/slides/24-pca-intro.html#section",
Expand Down
96 changes: 48 additions & 48 deletions sitemap.xml
Original file line number Diff line number Diff line change
Expand Up @@ -2,194 +2,194 @@
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/slides/00-r-review.html</loc>
<lastmod>2024-10-14T21:40:34.418Z</lastmod>
<lastmod>2024-10-14T21:47:33.395Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/handouts/keras-nnet.html</loc>
<lastmod>2024-10-14T21:40:34.410Z</lastmod>
<lastmod>2024-10-14T21:47:33.387Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/slides/11-kernel-smoothers.html</loc>
<lastmod>2024-10-14T21:40:34.418Z</lastmod>
<lastmod>2024-10-14T21:47:33.395Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/slides/09-l1-penalties.html</loc>
<lastmod>2024-10-14T21:40:34.418Z</lastmod>
<lastmod>2024-10-14T21:47:33.395Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/slides/18-the-bootstrap.html</loc>
<lastmod>2024-10-14T21:40:34.418Z</lastmod>
<lastmod>2024-10-14T21:47:33.395Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/slides/23-nnets-other.html</loc>
<lastmod>2024-10-14T21:40:34.422Z</lastmod>
<lastmod>2024-10-14T21:47:33.395Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/slides/05-estimating-test-mse.html</loc>
<lastmod>2024-10-14T21:40:34.418Z</lastmod>
<lastmod>2024-10-14T21:47:33.395Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/slides/25-pca-issues.html</loc>
<lastmod>2024-10-14T21:40:34.422Z</lastmod>
<lastmod>2024-10-14T21:47:33.395Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/slides/26-pca-v-kpca.html</loc>
<lastmod>2024-10-14T21:40:34.422Z</lastmod>
<lastmod>2024-10-14T21:47:33.395Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/slides/00-classification-losses.html</loc>
<lastmod>2024-10-14T21:40:34.418Z</lastmod>
<lastmod>2024-10-14T21:47:33.395Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/slides/20-boosting.html</loc>
<lastmod>2024-10-14T21:40:34.422Z</lastmod>
<lastmod>2024-10-14T21:47:33.395Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/slides/27-kmeans.html</loc>
<lastmod>2024-10-14T21:40:34.422Z</lastmod>
<lastmod>2024-10-14T21:47:33.395Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/slides/22-nnets-estimation.html</loc>
<lastmod>2024-10-14T21:40:34.422Z</lastmod>
<lastmod>2024-10-14T21:47:33.395Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/slides/04-bias-variance.html</loc>
<lastmod>2024-10-14T21:40:34.418Z</lastmod>
<lastmod>2024-10-14T21:47:33.395Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/slides/06-information-criteria.html</loc>
<lastmod>2024-10-14T21:40:34.418Z</lastmod>
<lastmod>2024-10-14T21:47:33.395Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/slides/03-regression-function.html</loc>
<lastmod>2024-10-14T21:40:34.418Z</lastmod>
<lastmod>2024-10-14T21:47:33.395Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/slides/21-nnets-intro.html</loc>
<lastmod>2024-10-14T21:40:34.422Z</lastmod>
<lastmod>2024-10-14T21:47:33.395Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/faq.html</loc>
<lastmod>2024-10-14T21:40:34.390Z</lastmod>
<lastmod>2024-10-14T21:47:33.363Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/slides/00-intro-to-class.html</loc>
<lastmod>2024-10-14T21:40:34.418Z</lastmod>
<lastmod>2024-10-14T21:47:33.395Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/handouts/lab00-git.html</loc>
<lastmod>2024-10-14T21:40:34.410Z</lastmod>
<lastmod>2024-10-14T21:47:33.387Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/course-setup.html</loc>
<lastmod>2024-10-14T21:40:34.390Z</lastmod>
<lastmod>2024-10-14T21:47:33.363Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/computing/windows.html</loc>
<lastmod>2024-10-14T21:40:34.390Z</lastmod>
<lastmod>2024-10-14T21:47:33.363Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/computing/mac_x86.html</loc>
<lastmod>2024-10-14T21:40:34.390Z</lastmod>
<lastmod>2024-10-14T21:47:33.363Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/computing/index.html</loc>
<lastmod>2024-10-14T21:40:34.390Z</lastmod>
<lastmod>2024-10-14T21:47:33.363Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/index.html</loc>
<lastmod>2024-10-14T21:40:34.390Z</lastmod>
<lastmod>2024-10-14T21:47:33.363Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/computing/mac_arm.html</loc>
<lastmod>2024-10-14T21:40:34.390Z</lastmod>
<lastmod>2024-10-14T21:47:33.363Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/computing/ubuntu.html</loc>
<lastmod>2024-10-14T21:40:34.390Z</lastmod>
<lastmod>2024-10-14T21:47:33.363Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/syllabus.html</loc>
<lastmod>2024-10-14T21:40:34.446Z</lastmod>
<lastmod>2024-10-14T21:47:33.419Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/index.html</loc>
<lastmod>2024-10-14T21:40:34.418Z</lastmod>
<lastmod>2024-10-14T21:47:33.395Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/slides/00-course-review.html</loc>
<lastmod>2024-10-14T21:40:34.418Z</lastmod>
<lastmod>2024-10-14T21:47:33.395Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/slides/00-version-control.html</loc>
<lastmod>2024-10-14T21:40:34.418Z</lastmod>
<lastmod>2024-10-14T21:47:33.395Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/slides/12-why-smooth.html</loc>
<lastmod>2024-10-14T21:40:34.418Z</lastmod>
<lastmod>2024-10-14T21:47:33.395Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/slides/01-lm-review.html</loc>
<lastmod>2024-10-14T21:40:34.418Z</lastmod>
<lastmod>2024-10-14T21:47:33.395Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/slides/00-cv-for-many-models.html</loc>
<lastmod>2024-10-14T21:40:34.418Z</lastmod>
<lastmod>2024-10-14T21:47:33.395Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/slides/19-bagging-and-rf.html</loc>
<lastmod>2024-10-14T21:40:34.422Z</lastmod>
<lastmod>2024-10-14T21:47:33.395Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/slides/14-classification-intro.html</loc>
<lastmod>2024-10-14T21:40:34.418Z</lastmod>
<lastmod>2024-10-14T21:47:33.395Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/slides/16-logistic-regression.html</loc>
<lastmod>2024-10-14T21:40:34.418Z</lastmod>
<lastmod>2024-10-14T21:47:33.395Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/slides/08-ridge-regression.html</loc>
<lastmod>2024-10-14T21:40:34.418Z</lastmod>
<lastmod>2024-10-14T21:47:33.395Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/slides/00-quiz-0-wrap.html</loc>
<lastmod>2024-10-14T21:40:34.418Z</lastmod>
<lastmod>2024-10-14T21:47:33.395Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/slides/15-LDA-and-QDA.html</loc>
<lastmod>2024-10-14T21:40:34.418Z</lastmod>
<lastmod>2024-10-14T21:47:33.395Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/slides/24-pca-intro.html</loc>
<lastmod>2024-10-14T21:40:34.422Z</lastmod>
<lastmod>2024-10-14T21:47:33.395Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/slides/13-gams-trees.html</loc>
<lastmod>2024-10-14T21:40:34.418Z</lastmod>
<lastmod>2024-10-14T21:47:33.395Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/slides/10-basis-expansions.html</loc>
<lastmod>2024-10-14T21:40:34.418Z</lastmod>
<lastmod>2024-10-14T21:47:33.395Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/slides/28-hclust.html</loc>
<lastmod>2024-10-14T21:40:34.422Z</lastmod>
<lastmod>2024-10-14T21:47:33.395Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/slides/07-greedy-selection.html</loc>
<lastmod>2024-10-14T21:40:34.418Z</lastmod>
<lastmod>2024-10-14T21:47:33.395Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/slides/02-lm-example.html</loc>
<lastmod>2024-10-14T21:40:34.418Z</lastmod>
<lastmod>2024-10-14T21:47:33.395Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/slides/17-nonlinear-classifiers.html</loc>
<lastmod>2024-10-14T21:40:34.418Z</lastmod>
<lastmod>2024-10-14T21:47:33.395Z</lastmod>
</url>
<url>
<loc>https://UBC-STAT.github.io/stat-406/schedule/slides/00-gradient-descent.html</loc>
<lastmod>2024-10-14T21:40:34.418Z</lastmod>
<lastmod>2024-10-14T21:47:33.395Z</lastmod>
</url>
</urlset>

0 comments on commit e3397fd

Please sign in to comment.