-
Notifications
You must be signed in to change notification settings - Fork 0
/
index.xml
877 lines (819 loc) · 63.3 KB
/
index.xml
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
<channel>
<title>James Lawton</title>
<link>https://JamesL813.github.io/</link>
<description>Recent content on James Lawton</description>
<generator>Hugo -- gohugo.io</generator>
<language>en-us</language>
<lastBuildDate>Tue, 25 Apr 2023 00:00:00 +0000</lastBuildDate><atom:link href="https://JamesL813.github.io/index.xml" rel="self" type="application/rss+xml" /><item>
<title>KD Trees and Ball Trees</title>
<link>https://JamesL813.github.io/p/kd-trees-and-ball-trees/</link>
<pubDate>Tue, 25 Apr 2023 00:00:00 +0000</pubDate>
<guid>https://JamesL813.github.io/p/kd-trees-and-ball-trees/</guid>
<description><img src="https://JamesL813.github.io/img/ball_tree_diagram.jpg" alt="Featured image of post KD Trees and Ball Trees" /><h2 id="motivation">Motivation</h2>
<p>Imagine we are interested in determining the CMDA 4654 classmate that lives nearest to us. The “brute force” approach would be to ask each classmate where they live (i.e. make the search region , compute the distance between their house and ours, and then select the minimum distance. This is quite computationally expensive. In fact, it has a time complexity of O(2n), assuming 2-dimensional distance computations. <br>
<br>
A better approach might be to partition the class into different groups based on the broader attributes of their location. For instance, we can ask everyone who lives in Blacksburg to stand on one side of the classroom, while those that don’t (i.e. live in Christiansburg) stand on the other. Then, if we live in Blacksburg, we are able to reduce the size of the group that we compute our distance to. <br>
<br>
We can continue to partition the group based on other factors (i.e. on-campus vs off-campus, north vs south, etc) to further reduce the size of the search group. Then, the time complexity of our algorithm is going to be O(n+log(n)), which is much better than vanilla kNN.<br>
<br>
However, we might find someone who lives on the edge of campus and whose nearest neighbor is off-campus, which will never be found due to the clustering nature of this algorithm.<br>
<br>
This idea of partitioning the data into subsets that will later be used to search for nearest neighbor within that subset (and hope that it’s the global nearest neighbor) is the idea behind clustering using k-d trees and ball trees.</p>
<h2 id="intro-to-decision-trees">Intro to Decision Trees</h2>
<p>A tree is a common data structure composed of a hierarchical structure with branch nodes, and leaf nodes. They can be useful for providing a visual representation for a data set or model. <br>
<br>
A binary tree is one of the simplest implementations of the structure. It’s simply a way of storing a set of ordered data. The rules that make up a binary tree are as follows:<br>
\</p>
<ul>
<li>Each node must have at most 2 children</li>
<li>A node’s left child must come before it</li>
<li>A node’s right child must come after it.</li>
</ul>
<p>Using these simple rules, we can create a data structure that is computationally efficient to retrieve data from.\</p>
<p>Notice that each node in this example tree not only stores a data point, but it also represents a decision that each incoming data point has to make as it goes through the tree. Whether the result of this decision is true or false determines which direction the point will move next.</p>
<p><img src="https://JamesL813.github.io/p/kd-trees-and-ball-trees/img/intro_to_decision_tree_graph.png"
width="505"
height="442"
srcset="https://JamesL813.github.io/p/kd-trees-and-ball-trees/img/intro_to_decision_tree_graph_hu04e33ba3a4d7e94c30cb7e311964b447_21767_480x0_resize_box_3.png 480w, https://JamesL813.github.io/p/kd-trees-and-ball-trees/img/intro_to_decision_tree_graph_hu04e33ba3a4d7e94c30cb7e311964b447_21767_1024x0_resize_box_3.png 1024w"
loading="lazy"
alt="Binary Search Tree"
class="gallery-image"
data-flex-grow="114"
data-flex-basis="274px"
></p>
<hr>
<h2 id="kd-trees">KD Trees</h2>
<p>A K-D tree (or a K-dimensional tree) is a special type of decision tree that can organize data for efficient spatial search or nearest-neighbor search within K-dimensional space.<br>
<br>
In data modeling, each one of K dimensions normally represents a specific feature of the data set.<br>
<br>
The basic idea of k-d trees is to partition our feature space along the axes and prune subtrees that are too far away from our nearest neighbor(s) (essentially depth first search with pruning).</p>
<p><img src="https://JamesL813.github.io/p/kd-trees-and-ball-trees/img/kdtrees_pic.png"
width="572"
height="242"
srcset="https://JamesL813.github.io/p/kd-trees-and-ball-trees/img/kdtrees_pic_huaeb8696dc0c495cc4337f29b70c7fd6b_53351_480x0_resize_box_3.png 480w, https://JamesL813.github.io/p/kd-trees-and-ball-trees/img/kdtrees_pic_huaeb8696dc0c495cc4337f29b70c7fd6b_53351_1024x0_resize_box_3.png 1024w"
loading="lazy"
alt="KD Trees [Source: Carnegie Mellon]"
class="gallery-image"
data-flex-grow="236"
data-flex-basis="567px"
></p>
<h2 id="process">Process</h2>
<p>The basic idea of k-d trees is to partition our feature space along the axes and prune subtrees that are too far away from our nearest neighbor(s).<br>
\</p>
<ul>
<li>We construct the tree by partitioning our data into halves along one feature</li>
<li>We then rotate through our features based on which of them have the largest maximum variance and continue partitioning our data.</li>
</ul>
<p><br>
When considering a test point and its nearest neighbors, we calculate the distance between them, call it $x_d$
\</p>
<ul>
<li>Compare $x_d$ to the distance between the point and the partition, $x_p$</li>
<li>If $x_p &gt; x_d$, we can prune that subtree</li>
<li>If $x_p &lt; x_d$, recalculate nearest neighbor</li>
</ul>
<p><br>
Continue until all leaf nodes have been visited.</p>
<h2 id="limitations">Limitations</h2>
<p>K-d trees are really only effective in low dimensional spaces and is not very accurate in high dimensional spaces.<br>
\</p>
<ul>
<li>In higher dimensions, the points end up being close to every partition (i.e. a million partition lines)</li>
<li>Partitions are along axes and span the entire feature space, which proves to be problematic as the number of features grows</li>
<li>Nearest neighbors begins to lose meaning since the distance between the closest and farthest point are very similar.</li>
</ul>
<h2 id="example-the-iris-dataset">Example: The IRIS Dataset</h2>
<p>We will use the Iris data to demonstrate KD trees using</p>
<p><img src="https://JamesL813.github.io/p/kd-trees-and-ball-trees/img/kd_box1.png"
width="394"
height="320"
srcset="https://JamesL813.github.io/p/kd-trees-and-ball-trees/img/kd_box1_hu1c908732a4bdfe0f8c92c99bc0e57377_27367_480x0_resize_box_3.png 480w, https://JamesL813.github.io/p/kd-trees-and-ball-trees/img/kd_box1_hu1c908732a4bdfe0f8c92c99bc0e57377_27367_1024x0_resize_box_3.png 1024w"
loading="lazy"
alt="KD Tree 1"
class="gallery-image"
data-flex-grow="123"
data-flex-basis="295px"
></p>
<hr>
<p><img src="https://JamesL813.github.io/p/kd-trees-and-ball-trees/img/kd_box2.png"
width="394"
height="321"
srcset="https://JamesL813.github.io/p/kd-trees-and-ball-trees/img/kd_box2_huafa4ea0738b4e8dbee7e39d7197906e6_27905_480x0_resize_box_3.png 480w, https://JamesL813.github.io/p/kd-trees-and-ball-trees/img/kd_box2_huafa4ea0738b4e8dbee7e39d7197906e6_27905_1024x0_resize_box_3.png 1024w"
loading="lazy"
alt="KD Tree 2"
class="gallery-image"
data-flex-grow="122"
data-flex-basis="294px"
></p>
<hr>
<p><img src="https://JamesL813.github.io/p/kd-trees-and-ball-trees/img/kd_box3.png"
width="979"
height="792"
srcset="https://JamesL813.github.io/p/kd-trees-and-ball-trees/img/kd_box3_hueb654af92ec2427c686e6d81f28d5ea9_119668_480x0_resize_box_3.png 480w, https://JamesL813.github.io/p/kd-trees-and-ball-trees/img/kd_box3_hueb654af92ec2427c686e6d81f28d5ea9_119668_1024x0_resize_box_3.png 1024w"
loading="lazy"
alt="KD Tree 3"
class="gallery-image"
data-flex-grow="123"
data-flex-basis="296px"
></p>
<hr>
<p>Code to draw these rectangles in R:</p>
<div class="highlight"><div class="chroma">
<table class="lntable"><tr><td class="lntd">
<pre tabindex="0" class="chroma"><code><span class="lnt"> 1
</span><span class="lnt"> 2
</span><span class="lnt"> 3
</span><span class="lnt"> 4
</span><span class="lnt"> 5
</span><span class="lnt"> 6
</span><span class="lnt"> 7
</span><span class="lnt"> 8
</span><span class="lnt"> 9
</span><span class="lnt">10
</span><span class="lnt">11
</span><span class="lnt">12
</span><span class="lnt">13
</span><span class="lnt">14
</span><span class="lnt">15
</span><span class="lnt">16
</span><span class="lnt">17
</span></code></pre></td>
<td class="lntd">
<pre tabindex="0" class="chroma"><code class="language-fallback" data-lang="fallback"><span class="line"><span class="cl">library(ggplot2)
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl">ggplot(iris, aes(x=Petal.Length, y=Petal.Width, col=Species)) + geom_point() +
</span></span><span class="line"><span class="cl"> labs(x=&#34;Petal Length&#34;, y=&#34;Petal Width&#34;, title = &#34;Petal Length vs. Petal Width&#34;) + theme_bw() +
</span></span><span class="line"><span class="cl"> #geom_vline(xintercept = median(iris$Petal.Length)) +
</span></span><span class="line"><span class="cl"> geom_rect(aes(xmin=4.35, xmax=6.9, ymin=1.8, ymax=2.5), fill=NA, color=&#34;blue&#34;, alpha=0.25) +
</span></span><span class="line"><span class="cl"> geom_rect(aes(xmin=4.35, xmax=6.9, ymin=0, ymax=1.8), fill=NA, color=&#34;blue&#34;, alpha=0.25) +
</span></span><span class="line"><span class="cl"> geom_rect(aes(xmin=0, xmax=4.35, ymin=0.3, ymax=2.5), fill=NA, color=&#34;blue&#34;, alpha=0.25) +
</span></span><span class="line"><span class="cl"> geom_rect(aes(xmin=0, xmax=4.35, ymin=0, ymax=0.3), fill=NA, color=&#34;blue&#34;, alpha=0.25) +
</span></span><span class="line"><span class="cl"> geom_rect(aes(xmin=3.85, xmax=4.35, ymin=0.3, ymax=2.5), fill=NA, color=&#34;green&#34;, alpha=0.25) +
</span></span><span class="line"><span class="cl"> geom_rect(aes(xmin=0, xmax=3.85, ymin=0.3, ymax=2.5), fill=NA, color=&#34;green&#34;, alpha=0.25) +
</span></span><span class="line"><span class="cl"> geom_rect(aes(xmin=0, xmax=1.4, ymin=0, ymax=0.3), fill=NA, color=&#34;green&#34;, alpha=0.25) +
</span></span><span class="line"><span class="cl"> geom_rect(aes(xmin=1.4, xmax=4.35, ymin=0, ymax=0.3), fill=NA, color=&#34;green&#34;, alpha=0.25) +
</span></span><span class="line"><span class="cl"> geom_rect(aes(xmin=4.35, xmax=4.6, ymin=0, ymax=1.8), fill=NA, color=&#34;green&#34;, alpha=0.25) +
</span></span><span class="line"><span class="cl"> geom_rect(aes(xmin=4.6, xmax=6.9, ymin=0, ymax=1.8), fill=NA, color=&#34;green&#34;, alpha=0.25) +
</span></span><span class="line"><span class="cl"> geom_rect(aes(xmin=4.35, xmax=5.6, ymin=1.8, ymax=2.5), fill=NA, color=&#34;green&#34;, alpha=0.25) +
</span></span><span class="line"><span class="cl"> geom_rect(aes(xmin=5.6, xmax=6.9, ymin=1.8, ymax=2.5), fill=NA, color=&#34;green&#34;, alpha=0.25)
</span></span></code></pre></td></tr></table>
</div>
</div><hr>
<p><img src="https://JamesL813.github.io/p/kd-trees-and-ball-trees/img/kd_box4.png"
width="965"
height="789"
srcset="https://JamesL813.github.io/p/kd-trees-and-ball-trees/img/kd_box4_hub6e0809dc7a252b9d414e61530065603_85177_480x0_resize_box_3.png 480w, https://JamesL813.github.io/p/kd-trees-and-ball-trees/img/kd_box4_hub6e0809dc7a252b9d414e61530065603_85177_1024x0_resize_box_3.png 1024w"
loading="lazy"
alt="KD Tree 4"
class="gallery-image"
data-flex-grow="122"
data-flex-basis="293px"
></p>
<h2 id="ball-trees">Ball trees</h2>
<p>A ball tree is a space partitioning data structure for organizing points in a multidimensional space. <br>
<br>
Each internal node partitions the data into two disjoint sets which are associated with different balls. Each point is assigned to the ball with the closest center.</p>
<p>$$
D^B (t) =
\begin{cases}
\max( |t - B.pivot | - B.radius, D^{B.parent} ),\quad \text{ if }B \neq R \
\max( |t - B.pivot | - B.radius, D^{B.parent}, 0 ), \text{ if }B = R \
\end{cases}
$$</p>
<p><img src="https://JamesL813.github.io/p/kd-trees-and-ball-trees/img/ball_tree_diagram.png"
width="1319"
height="739"
srcset="https://JamesL813.github.io/p/kd-trees-and-ball-trees/img/ball_tree_diagram_hud8d3d15a230b5af5a6a5d95c7875bd46_191053_480x0_resize_box_3.png 480w, https://JamesL813.github.io/p/kd-trees-and-ball-trees/img/ball_tree_diagram_hud8d3d15a230b5af5a6a5d95c7875bd46_191053_1024x0_resize_box_3.png 1024w"
loading="lazy"
alt="ball tree diagram"
class="gallery-image"
data-flex-grow="178"
data-flex-basis="428px"
></p>
<h2 id="motivation-1">Motivation</h2>
<p>The ball tree algorithm is similar to k-d trees in that they both partition in terms of the feature space, but unlike k-d trees, the trees are partitioned into hyperplane spheres instead of boxes. <br>
<br>
While ball tree performance may suffer in lower dimensional feature spaces,
Ball tree performance of with O(n log(n)) is still better than kNN training speed of O(nd)</p>
<h2 id="example-the-iris-dataset-1">Example: The IRIS dataset</h2>
<div class="highlight"><div class="chroma">
<table class="lntable"><tr><td class="lntd">
<pre tabindex="0" class="chroma"><code><span class="lnt"> 1
</span><span class="lnt"> 2
</span><span class="lnt"> 3
</span><span class="lnt"> 4
</span><span class="lnt"> 5
</span><span class="lnt"> 6
</span><span class="lnt"> 7
</span><span class="lnt"> 8
</span><span class="lnt"> 9
</span><span class="lnt">10
</span><span class="lnt">11
</span><span class="lnt">12
</span><span class="lnt">13
</span><span class="lnt">14
</span><span class="lnt">15
</span><span class="lnt">16
</span><span class="lnt">17
</span><span class="lnt">18
</span><span class="lnt">19
</span></code></pre></td>
<td class="lntd">
<pre tabindex="0" class="chroma"><code class="language-fallback" data-lang="fallback"><span class="line"><span class="cl">source(&#34;ball_tree.R&#34;)
</span></span><span class="line"><span class="cl"> # scales all numeric columns
</span></span><span class="line"><span class="cl">iris_scaled &lt;- iris %&gt;%
</span></span><span class="line"><span class="cl"> mutate_if(is.numeric, scale)
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl"># columns to plot
</span></span><span class="line"><span class="cl">isc &lt;- iris_scaled[, c(3:4)]
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl"># builds the tree
</span></span><span class="line"><span class="cl">bt &lt;- build_ball_tree(isc, c(1:nrow(isc), min_points = 2))
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl">ggplot() + geom_balltree(bt, max_depth = 4) +
</span></span><span class="line"><span class="cl"> geom_point(
</span></span><span class="line"><span class="cl"> data = iris_scaled,
</span></span><span class="line"><span class="cl"> pch = 21,
</span></span><span class="line"><span class="cl"> size = 3,
</span></span><span class="line"><span class="cl"> aes(x = Petal.Length, y = Petal.Width, fill = Species)
</span></span><span class="line"><span class="cl"> ) +
</span></span><span class="line"><span class="cl"> theme_classic() + scale_colour_stepsn(colors = c(&#34;purple4&#34;,&#34;red&#34;,&#34;orange1&#34;))
</span></span></code></pre></td></tr></table>
</div>
</div><hr>
<p><img src="https://JamesL813.github.io/p/kd-trees-and-ball-trees/img/iris_petal_ball.png"
width="3000"
height="2550"
srcset="https://JamesL813.github.io/p/kd-trees-and-ball-trees/img/iris_petal_ball_hue56fb58cda12bf7feaa75f33b6f278e0_584223_480x0_resize_box_3.png 480w, https://JamesL813.github.io/p/kd-trees-and-ball-trees/img/iris_petal_ball_hue56fb58cda12bf7feaa75f33b6f278e0_584223_1024x0_resize_box_3.png 1024w"
loading="lazy"
alt="image"
class="gallery-image"
data-flex-grow="117"
data-flex-basis="282px"
></p>
<h2 id="housing-data">Housing Data</h2>
<p>The housing data we chose to use analyzed 12 different building shapes. Each building differs with respect to the glazing area, the glazing area distribution, and the orientation, amongst other parameters. With the data being found <a class="link" href="https://drive.google.com/drive/u/1/folders/1W_Qc1XoOJUjNWN14925pfaIVZKvrBahP" target="_blank" rel="noopener"
>here</a>.</p>
<table>
<thead>
<tr>
<th>Name</th>
<th>Definition</th>
</tr>
</thead>
<tbody>
<tr>
<td>X1</td>
<td>Relative Compactness</td>
</tr>
<tr>
<td>X2</td>
<td>Surface Area</td>
</tr>
<tr>
<td>X3</td>
<td>Wall Area</td>
</tr>
<tr>
<td>X4</td>
<td>Roof Area</td>
</tr>
<tr>
<td>X5</td>
<td>Overall Height</td>
</tr>
<tr>
<td>X6</td>
<td>Orientation</td>
</tr>
<tr>
<td>X7</td>
<td>Glazing Area</td>
</tr>
<tr>
<td>X8</td>
<td>Glazing Area Distribution</td>
</tr>
<tr>
<td>y1</td>
<td>Heating Load</td>
</tr>
<tr>
<td>y2</td>
<td>Cooling Load</td>
</tr>
</tbody>
</table>
<h2 id="kd-tree-approach">KD tree approach</h2>
<div class="highlight"><div class="chroma">
<table class="lntable"><tr><td class="lntd">
<pre tabindex="0" class="chroma"><code><span class="lnt"> 1
</span><span class="lnt"> 2
</span><span class="lnt"> 3
</span><span class="lnt"> 4
</span><span class="lnt"> 5
</span><span class="lnt"> 6
</span><span class="lnt"> 7
</span><span class="lnt"> 8
</span><span class="lnt"> 9
</span><span class="lnt">10
</span><span class="lnt">11
</span><span class="lnt">12
</span><span class="lnt">13
</span><span class="lnt">14
</span><span class="lnt">15
</span><span class="lnt">16
</span><span class="lnt">17
</span><span class="lnt">18
</span><span class="lnt">19
</span><span class="lnt">20
</span></code></pre></td>
<td class="lntd">
<pre tabindex="0" class="chroma"><code class="language-fallback" data-lang="fallback"><span class="line"><span class="cl">library(FNN)
</span></span><span class="line"><span class="cl">library(caret)
</span></span><span class="line"><span class="cl">house = read.csv(&#34;data/ENB2012_data.csv&#34;)
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl">house1 = house[c(1:768),-c(6,8)]
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl">index &lt;- sample(1:nrow(house1), round(nrow(house1) * 0.7))
</span></span><span class="line"><span class="cl">training_df &lt;- house1[index, ]
</span></span><span class="line"><span class="cl">testing_df &lt;- house1[-index, ]
</span></span><span class="line"><span class="cl"># Store the training/testing data features
</span></span><span class="line"><span class="cl">train_features &lt;- training_df[,-3]
</span></span><span class="line"><span class="cl">test_features &lt;- testing_df[, -3]
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl"># Store the actual labels
</span></span><span class="line"><span class="cl">train_classes &lt;- training_df$X3
</span></span><span class="line"><span class="cl">test_classes &lt;- testing_df$X3
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl">house_kd = knn(train = train_features, test = test_features, cl = train_classes, k = 5, algorithm=c(&#34;kd_tree&#34;))
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl">confusionMatrix(data = house_kd, reference = as.factor(test_classes))
</span></span></code></pre></td></tr></table>
</div>
</div><h2 id="confusion-matrix">Confusion Matrix</h2>
<div class="highlight"><div class="chroma">
<table class="lntable"><tr><td class="lntd">
<pre tabindex="0" class="chroma"><code><span class="lnt"> 1
</span><span class="lnt"> 2
</span><span class="lnt"> 3
</span><span class="lnt"> 4
</span><span class="lnt"> 5
</span><span class="lnt"> 6
</span><span class="lnt"> 7
</span><span class="lnt"> 8
</span><span class="lnt"> 9
</span><span class="lnt">10
</span><span class="lnt">11
</span></code></pre></td>
<td class="lntd">
<pre tabindex="0" class="chroma"><code class="language-fallback" data-lang="fallback"><span class="line"><span class="cl">confusion.table = table(&#34;predicted&#34; = house_kd, &#34;actual&#34; = as.factor(test_classes))
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl">plt &lt;- as.data.frame(confusion.table)
</span></span><span class="line"><span class="cl">plt$predicted &lt;- factor(plt$predicted, levels=rev(levels(plt$predicted)))
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl">ggplot(plt, aes(actual,predicted, fill= Freq)) +
</span></span><span class="line"><span class="cl"> geom_tile() + geom_text(aes(label=Freq)) +
</span></span><span class="line"><span class="cl"> scale_fill_gradient(low=&#34;white&#34;, high=&#34;#CF4420&#34;) +
</span></span><span class="line"><span class="cl"> labs(x = &#34;Reference&#34;,y = &#34;Prediction&#34;) +
</span></span><span class="line"><span class="cl"> scale_x_discrete(labels=c(&#34;245&#34;,&#34;269.5&#34;,&#34;294&#34;,&#34;318.5&#34;,&#34;343&#34;,&#34;367.5&#34;,&#34;416.5&#34;), position = &#34;top&#34;) +
</span></span><span class="line"><span class="cl"> scale_y_discrete(labels=c(&#34;416.5&#34;,&#34;367.5&#34;,&#34;343&#34;,&#34;318.5&#34;,&#34;294&#34;,&#34;269.5&#34;,&#34;245&#34;))
</span></span></code></pre></td></tr></table>
</div>
</div><hr>
<p><img src="https://JamesL813.github.io/p/kd-trees-and-ball-trees/img/kd_house_cm.png"
width="2689"
height="1823"
srcset="https://JamesL813.github.io/p/kd-trees-and-ball-trees/img/kd_house_cm_hu18608a10de6c6646d36f37e532f86e11_209258_480x0_resize_box_3.png 480w, https://JamesL813.github.io/p/kd-trees-and-ball-trees/img/kd_house_cm_hu18608a10de6c6646d36f37e532f86e11_209258_1024x0_resize_box_3.png 1024w"
loading="lazy"
alt="Confusion Matrix"
class="gallery-image"
data-flex-grow="147"
data-flex-basis="354px"
></p>
<h2 id="ball-tree-approach">Ball Tree Approach</h2>
<h2 id="knn-approach">kNN Approach</h2>
<p>For reference, we will show the kNN approach of classifying our data set</p>
<div class="highlight"><div class="chroma">
<table class="lntable"><tr><td class="lntd">
<pre tabindex="0" class="chroma"><code><span class="lnt">1
</span></code></pre></td>
<td class="lntd">
<pre tabindex="0" class="chroma"><code class="language-fallback" data-lang="fallback"><span class="line"><span class="cl">knn(train = train_features, test = test_features, cl = train_classes, k = 5, algorithm=c(&#34;brute&#34;))
</span></span></code></pre></td></tr></table>
</div>
</div></description>
</item>
<item>
<title>Raindrop Air Resistance Simulation</title>
<link>https://JamesL813.github.io/p/raindrop-air-resistance-simulation/</link>
<pubDate>Thu, 29 Sep 2022 00:00:00 +0000</pubDate>
<guid>https://JamesL813.github.io/p/raindrop-air-resistance-simulation/</guid>
<description><img src="https://JamesL813.github.io/p/raindrop-air-resistance-simulation/cover.jpg" alt="Featured image of post Raindrop Air Resistance Simulation" /><p>A simple python simulation</p>
<ul>
<li>Simulates a falling raindrop with air resistance and mass</li>
<li>Used to write a paper analyzing how air resistance affects terminal velocity and distance traveled</li>
</ul>
</description>
</item>
<item>
<title>Schrodinger Equation Simulation</title>
<link>https://JamesL813.github.io/p/schrodinger-equation-simulation/</link>
<pubDate>Thu, 29 Sep 2022 00:00:00 +0000</pubDate>
<guid>https://JamesL813.github.io/p/schrodinger-equation-simulation/</guid>
<description><img src="https://JamesL813.github.io/p/schrodinger-equation-simulation/cover.jpg" alt="Featured image of post Schrodinger Equation Simulation" /><p>A simple python simulation</p>
<ul>
<li>Simulates a falling raindrop with air resistance and mass</li>
<li>Used to write a paper analyzing how air resistance affects terminal velocity and distance traveled</li>
</ul>
</description>
</item>
<item>
<title>Dijkstra’s Path-finding Algorithm Simulation</title>
<link>https://JamesL813.github.io/p/dijkstras-path-finding-algorithm-simulation/</link>
<pubDate>Wed, 29 Jun 2022 00:00:00 +0000</pubDate>
<guid>https://JamesL813.github.io/p/dijkstras-path-finding-algorithm-simulation/</guid>
<description><img src="https://JamesL813.github.io/p/dijkstras-path-finding-algorithm-simulation/cover.jpg" alt="Featured image of post Dijkstra’s Path-finding Algorithm Simulation" /><p>A simple python simulation</p>
<ul>
<li>Utilizes Dijkstra’s Path-finding Algorithm</li>
<li>Finds the shortest paths to each point from a starting point on a directed graph.</li>
</ul>
</description>
</item>
<item>
<title>Geographic Information System</title>
<link>https://JamesL813.github.io/p/geographic-information-system/</link>
<pubDate>Sun, 29 May 2022 00:00:00 +0000</pubDate>
<guid>https://JamesL813.github.io/p/geographic-information-system/</guid>
<description><img src="https://JamesL813.github.io/p/geographic-information-system/cover.jpg" alt="Featured image of post Geographic Information System" /><ul>
<li>Tool to parse through Geographic Data</li>
<li>Uses a custom built PR Quad-Tree and Hash Table to store locations and names.</li>
<li>Can easily query by location range and name range.</li>
</ul>
</description>
</item>
<item>
<title>Hash Table</title>
<link>https://JamesL813.github.io/p/hash-table/</link>
<pubDate>Fri, 29 Apr 2022 00:00:00 +0000</pubDate>
<guid>https://JamesL813.github.io/p/hash-table/</guid>
<description><img src="https://JamesL813.github.io/p/hash-table/cover.jpg" alt="Featured image of post Hash Table" /><ul>
<li>Data structure made to be versatile with a variable bucket size.</li>
<li>Less space efficiency but more speed when querying</li>
</ul>
</description>
</item>
<item>
<title>PR Quad Tree</title>
<link>https://JamesL813.github.io/p/pr-quad-tree/</link>
<pubDate>Tue, 29 Mar 2022 00:00:00 +0000</pubDate>
<guid>https://JamesL813.github.io/p/pr-quad-tree/</guid>
<description><img src="https://JamesL813.github.io/p/pr-quad-tree/cover.jpg" alt="Featured image of post PR Quad Tree" /><ul>
<li>Data structure similar to a binary tree.</li>
<li>Each node contains four, a Northwest, Northeast, Southwest, and Southeast</li>
<li>Efficient when storing and querying data that can be identified by a location coordinate.</li>
</ul>
</description>
</item>
<item>
<title>Archives</title>
<link>https://JamesL813.github.io/archives/</link>
<pubDate>Tue, 28 May 2019 00:00:00 +0000</pubDate>
<guid>https://JamesL813.github.io/archives/</guid>
<description></description>
</item>
<item>
<title>Markdown Syntax Guide</title>
<link>https://JamesL813.github.io/p/markdown-syntax-guide/</link>
<pubDate>Mon, 11 Mar 2019 00:00:00 +0000</pubDate>
<guid>https://JamesL813.github.io/p/markdown-syntax-guide/</guid>
<description><img src="https://JamesL813.github.io/p/markdown-syntax-guide/pawel-czerwinski-8uZPynIu-rQ-unsplash.jpg" alt="Featured image of post Markdown Syntax Guide" /><p>This article offers a sample of basic Markdown syntax that can be used in Hugo content files, also it shows whether basic HTML elements are decorated with CSS in a Hugo theme.</p>
<h2 id="headings">Headings</h2>
<p>The following HTML <code>&lt;h1&gt;</code>—<code>&lt;h6&gt;</code> elements represent six levels of section headings. <code>&lt;h1&gt;</code> is the highest section level while <code>&lt;h6&gt;</code> is the lowest.</p>
<h1 id="h1">H1</h1>
<h2 id="h2">H2</h2>
<h3 id="h3">H3</h3>
<h4 id="h4">H4</h4>
<h5 id="h5">H5</h5>
<h6 id="h6">H6</h6>
<h2 id="paragraph">Paragraph</h2>
<p>Xerum, quo qui aut unt expliquam qui dolut labo. Aque venitatiusda cum, voluptionse latur sitiae dolessi aut parist aut dollo enim qui voluptate ma dolestendit peritin re plis aut quas inctum laceat est volestemque commosa as cus endigna tectur, offic to cor sequas etum rerum idem sintibus eiur? Quianimin porecus evelectur, cum que nis nust voloribus ratem aut omnimi, sitatur? Quiatem. Nam, omnis sum am facea corem alique molestrunt et eos evelece arcillit ut aut eos eos nus, sin conecerem erum fuga. Ri oditatquam, ad quibus unda veliamenimin cusam et facea ipsamus es exerum sitate dolores editium rerore eost, temped molorro ratiae volorro te reribus dolorer sperchicium faceata tiustia prat.</p>
<p>Itatur? Quiatae cullecum rem ent aut odis in re eossequodi nonsequ idebis ne sapicia is sinveli squiatum, core et que aut hariosam ex eat.</p>
<p>😄</p>
<h2 id="blockquotes">Blockquotes</h2>
<p>The blockquote element represents content that is quoted from another source, optionally with a citation which must be within a <code>footer</code> or <code>cite</code> element, and optionally with in-line changes such as annotations and abbreviations.</p>
<h4 id="blockquote-without-attribution">Blockquote without attribution</h4>
<blockquote>
<p>Tiam, ad mint andaepu dandae nostion secatur sequo quae.
<strong>Note</strong> that you can use <em>Markdown syntax</em> within a blockquote.</p>
</blockquote>
<h4 id="blockquote-with-attribution">Blockquote with attribution</h4>
<blockquote>
<p>Don&rsquo;t communicate by sharing memory, share memory by communicating.<!-- raw HTML omitted -->
— <!-- raw HTML omitted -->Rob Pike<sup id="fnref:1"><a href="#fn:1" class="footnote-ref" role="doc-noteref">1</a></sup><!-- raw HTML omitted --></p>
</blockquote>
<h2 id="tables">Tables</h2>
<p>Tables aren&rsquo;t part of the core Markdown spec, but Hugo supports supports them out-of-the-box.</p>
<table>
<thead>
<tr>
<th>Name</th>
<th>Age</th>
</tr>
</thead>
<tbody>
<tr>
<td>Bob</td>
<td>27</td>
</tr>
<tr>
<td>Alice</td>
<td>23</td>
</tr>
</tbody>
</table>
<h4 id="inline-markdown-within-tables">Inline Markdown within tables</h4>
<table>
<thead>
<tr>
<th>Italics</th>
<th>Bold</th>
<th>Code</th>
</tr>
</thead>
<tbody>
<tr>
<td><em>italics</em></td>
<td><strong>bold</strong></td>
<td><code>code</code></td>
</tr>
</tbody>
</table>
<table>
<thead>
<tr>
<th>A</th>
<th>B</th>
<th>C</th>
<th>D</th>
<th>E</th>
<th>F</th>
</tr>
</thead>
<tbody>
<tr>
<td>Lorem ipsum dolor sit amet, consectetur adipiscing elit.</td>
<td>Phasellus ultricies, sapien non euismod aliquam, dui ligula tincidunt odio, at accumsan nulla sapien eget ex.</td>
<td>Proin eleifend dictum ipsum, non euismod ipsum pulvinar et. Vivamus sollicitudin, quam in pulvinar aliquam, metus elit pretium purus</td>
<td>Proin sit amet velit nec enim imperdiet vehicula.</td>
<td>Ut bibendum vestibulum quam, eu egestas turpis gravida nec</td>
<td>Sed scelerisque nec turpis vel viverra. Vivamus vitae pretium sapien</td>
</tr>
</tbody>
</table>
<h2 id="code-blocks">Code Blocks</h2>
<h4 id="code-block-with-backticks">Code block with backticks</h4>
<div class="highlight"><div class="chroma">
<table class="lntable"><tr><td class="lntd">
<pre tabindex="0" class="chroma"><code><span class="lnt"> 1
</span><span class="lnt"> 2
</span><span class="lnt"> 3
</span><span class="lnt"> 4
</span><span class="lnt"> 5
</span><span class="lnt"> 6
</span><span class="lnt"> 7
</span><span class="lnt"> 8
</span><span class="lnt"> 9
</span><span class="lnt">10
</span></code></pre></td>
<td class="lntd">
<pre tabindex="0" class="chroma"><code class="language-html" data-lang="html"><span class="line"><span class="cl"><span class="cp">&lt;!doctype html&gt;</span>
</span></span><span class="line"><span class="cl"><span class="p">&lt;</span><span class="nt">html</span> <span class="na">lang</span><span class="o">=</span><span class="s">&#34;en&#34;</span><span class="p">&gt;</span>
</span></span><span class="line"><span class="cl"><span class="p">&lt;</span><span class="nt">head</span><span class="p">&gt;</span>
</span></span><span class="line"><span class="cl"> <span class="p">&lt;</span><span class="nt">meta</span> <span class="na">charset</span><span class="o">=</span><span class="s">&#34;utf-8&#34;</span><span class="p">&gt;</span>
</span></span><span class="line"><span class="cl"> <span class="p">&lt;</span><span class="nt">title</span><span class="p">&gt;</span>Example HTML5 Document<span class="p">&lt;/</span><span class="nt">title</span><span class="p">&gt;</span>
</span></span><span class="line"><span class="cl"><span class="p">&lt;/</span><span class="nt">head</span><span class="p">&gt;</span>
</span></span><span class="line"><span class="cl"><span class="p">&lt;</span><span class="nt">body</span><span class="p">&gt;</span>
</span></span><span class="line"><span class="cl"> <span class="p">&lt;</span><span class="nt">p</span><span class="p">&gt;</span>Test<span class="p">&lt;/</span><span class="nt">p</span><span class="p">&gt;</span>
</span></span><span class="line"><span class="cl"><span class="p">&lt;/</span><span class="nt">body</span><span class="p">&gt;</span>
</span></span><span class="line"><span class="cl"><span class="p">&lt;/</span><span class="nt">html</span><span class="p">&gt;</span>
</span></span></code></pre></td></tr></table>
</div>
</div><h4 id="code-block-indented-with-four-spaces">Code block indented with four spaces</h4>
<pre><code>&lt;!doctype html&gt;
&lt;html lang=&quot;en&quot;&gt;
&lt;head&gt;
&lt;meta charset=&quot;utf-8&quot;&gt;
&lt;title&gt;Example HTML5 Document&lt;/title&gt;
&lt;/head&gt;
&lt;body&gt;
&lt;p&gt;Test&lt;/p&gt;
&lt;/body&gt;
&lt;/html&gt;
</code></pre>
<h4 id="code-block-with-hugos-internal-highlight-shortcode">Code block with Hugo&rsquo;s internal highlight shortcode</h4>
<div class="highlight"><div class="chroma">
<table class="lntable"><tr><td class="lntd">
<pre tabindex="0" class="chroma"><code><span class="lnt"> 1
</span><span class="lnt"> 2
</span><span class="lnt"> 3
</span><span class="lnt"> 4
</span><span class="lnt"> 5
</span><span class="lnt"> 6
</span><span class="lnt"> 7
</span><span class="lnt"> 8
</span><span class="lnt"> 9
</span><span class="lnt">10
</span></code></pre></td>
<td class="lntd">
<pre tabindex="0" class="chroma"><code class="language-html" data-lang="html"><span class="line"><span class="cl"><span class="cp">&lt;!doctype html&gt;</span>
</span></span><span class="line"><span class="cl"><span class="p">&lt;</span><span class="nt">html</span> <span class="na">lang</span><span class="o">=</span><span class="s">&#34;en&#34;</span><span class="p">&gt;</span>
</span></span><span class="line"><span class="cl"><span class="p">&lt;</span><span class="nt">head</span><span class="p">&gt;</span>
</span></span><span class="line"><span class="cl"> <span class="p">&lt;</span><span class="nt">meta</span> <span class="na">charset</span><span class="o">=</span><span class="s">&#34;utf-8&#34;</span><span class="p">&gt;</span>
</span></span><span class="line"><span class="cl"> <span class="p">&lt;</span><span class="nt">title</span><span class="p">&gt;</span>Example HTML5 Document<span class="p">&lt;/</span><span class="nt">title</span><span class="p">&gt;</span>
</span></span><span class="line"><span class="cl"><span class="p">&lt;/</span><span class="nt">head</span><span class="p">&gt;</span>
</span></span><span class="line"><span class="cl"><span class="p">&lt;</span><span class="nt">body</span><span class="p">&gt;</span>
</span></span><span class="line"><span class="cl"> <span class="p">&lt;</span><span class="nt">p</span><span class="p">&gt;</span>Test<span class="p">&lt;/</span><span class="nt">p</span><span class="p">&gt;</span>
</span></span><span class="line"><span class="cl"><span class="p">&lt;/</span><span class="nt">body</span><span class="p">&gt;</span>
</span></span><span class="line"><span class="cl"><span class="p">&lt;/</span><span class="nt">html</span><span class="p">&gt;</span></span></span></code></pre></td></tr></table>
</div>
</div>
<h4 id="diff-code-block">Diff code block</h4>
<div class="highlight"><div class="chroma">
<table class="lntable"><tr><td class="lntd">
<pre tabindex="0" class="chroma"><code><span class="lnt">1
</span><span class="lnt">2
</span><span class="lnt">3
</span><span class="lnt">4
</span><span class="lnt">5
</span></code></pre></td>
<td class="lntd">
<pre tabindex="0" class="chroma"><code class="language-diff" data-lang="diff"><span class="line"><span class="cl">[dependencies.bevy]
</span></span><span class="line"><span class="cl">git = &#34;https://github.com/bevyengine/bevy&#34;
</span></span><span class="line"><span class="cl">rev = &#34;11f52b8c72fc3a568e8bb4a4cd1f3eb025ac2e13&#34;
</span></span><span class="line"><span class="cl"><span class="gd">- features = [&#34;dynamic&#34;]
</span></span></span><span class="line"><span class="cl"><span class="gd"></span><span class="gi">+ features = [&#34;jpeg&#34;, &#34;dynamic&#34;]
</span></span></span></code></pre></td></tr></table>
</div>
</div><h2 id="list-types">List Types</h2>
<h4 id="ordered-list">Ordered List</h4>
<ol>
<li>First item</li>
<li>Second item</li>
<li>Third item</li>
</ol>
<h4 id="unordered-list">Unordered List</h4>
<ul>
<li>List item</li>
<li>Another item</li>
<li>And another item</li>
</ul>
<h4 id="nested-list">Nested list</h4>
<ul>
<li>Fruit
<ul>
<li>Apple</li>
<li>Orange</li>
<li>Banana</li>
</ul>
</li>
<li>Dairy
<ul>
<li>Milk</li>
<li>Cheese</li>
</ul>
</li>
</ul>
<h2 id="other-elements--abbr-sub-sup-kbd-mark">Other Elements — abbr, sub, sup, kbd, mark</h2>
<p><!-- raw HTML omitted -->GIF<!-- raw HTML omitted --> is a bitmap image format.</p>
<p>H<!-- raw HTML omitted -->2<!-- raw HTML omitted -->O</p>
<p>X<!-- raw HTML omitted -->n<!-- raw HTML omitted --> + Y<!-- raw HTML omitted -->n<!-- raw HTML omitted --> = Z<!-- raw HTML omitted -->n<!-- raw HTML omitted --></p>
<p>Press <!-- raw HTML omitted --><!-- raw HTML omitted -->CTRL<!-- raw HTML omitted -->+<!-- raw HTML omitted -->ALT<!-- raw HTML omitted -->+<!-- raw HTML omitted -->Delete<!-- raw HTML omitted --><!-- raw HTML omitted --> to end the session.</p>
<p>Most <!-- raw HTML omitted -->salamanders<!-- raw HTML omitted --> are nocturnal, and hunt for insects, worms, and other small creatures.</p>
<h2 id="hyperlinked-image">Hyperlinked image</h2>
<p><a class="link" href="https://google.com" target="_blank" rel="noopener"
><img src="https://www.google.com/images/branding/googlelogo/1x/googlelogo_light_color_272x92dp.png"
loading="lazy"
alt="Google"
></a></p>
<div class="footnotes" role="doc-endnotes">
<hr>
<ol>
<li id="fn:1">
<p>The above quote is excerpted from Rob Pike&rsquo;s <a class="link" href="https://www.youtube.com/watch?v=PAAkCSZUG1c" target="_blank" rel="noopener"
>talk</a> during Gopherfest, November 18, 2015.&#160;<a href="#fnref:1" class="footnote-backref" role="doc-backlink">&#x21a9;&#xfe0e;</a></p>
</li>
</ol>
</div></description>
</item>
<item>
<title>Math Typesetting</title>
<link>https://JamesL813.github.io/p/math-typesetting/</link>
<pubDate>Fri, 08 Mar 2019 00:00:00 +0000</pubDate>
<guid>https://JamesL813.github.io/p/math-typesetting/</guid>
<description><p>Mathematical notation in a Hugo project can be enabled by using third party JavaScript libraries.</p>
<p>In this example we will be using <a class="link" href="https://katex.org/" target="_blank" rel="noopener"
>KaTeX</a></p>
<ul>
<li>Create a partial under <code>/layouts/partials/math.html</code></li>
<li>Within this partial reference the <a class="link" href="https://katex.org/docs/autorender.html" target="_blank" rel="noopener"
>Auto-render Extension</a> or host these scripts locally.</li>
<li>Include the partial in your templates like so:</li>
</ul>
<div class="highlight"><div class="chroma">
<table class="lntable"><tr><td class="lntd">
<pre tabindex="0" class="chroma"><code><span class="lnt">1
</span><span class="lnt">2
</span><span class="lnt">3
</span></code></pre></td>
<td class="lntd">
<pre tabindex="0" class="chroma"><code class="language-bash" data-lang="bash"><span class="line"><span class="cl"><span class="o">{{</span> <span class="k">if</span> or .Params.math .Site.Params.math <span class="o">}}</span>
</span></span><span class="line"><span class="cl"><span class="o">{{</span> partial <span class="s2">&#34;math.html&#34;</span> . <span class="o">}}</span>
</span></span><span class="line"><span class="cl"><span class="o">{{</span> end <span class="o">}}</span>
</span></span></code></pre></td></tr></table>
</div>
</div><ul>
<li>To enable KaTex globally set the parameter <code>math</code> to <code>true</code> in a project&rsquo;s configuration</li>
<li>To enable KaTex on a per page basis include the parameter <code>math: true</code> in content files</li>
</ul>
<p><strong>Note:</strong> Use the online reference of <a class="link" href="https://katex.org/docs/supported.html" target="_blank" rel="noopener"
>Supported TeX Functions</a></p>
<h3 id="examples">Examples</h3>
<p>Block math:
$$
\varphi = 1+\frac{1} {1+\frac{1} {1+\frac{1} {1+\cdots} } }
$$</p></description>
</item>
<item>
<title>About</title>
<link>https://JamesL813.github.io/about/</link>
<pubDate>Thu, 28 Feb 2019 00:00:00 +0000</pubDate>
<guid>https://JamesL813.github.io/about/</guid>
<description><p>Written in Go, Hugo is an open source static site generator available under the <a class="link" href="https://github.com/gohugoio/hugo/blob/master/LICENSE" target="_blank" rel="noopener"
>Apache Licence 2.0.</a> Hugo supports TOML, YAML and JSON data file types, Markdown and HTML content files and uses shortcodes to add rich content. Other notable features are taxonomies, multilingual mode, image processing, custom output formats, HTML/CSS/JS minification and support for Sass SCSS workflows.</p>
<p>Hugo makes use of a variety of open source projects including:</p>
<ul>
<li><a class="link" href="https://github.com/yuin/goldmark" target="_blank" rel="noopener"
>https://github.com/yuin/goldmark</a></li>
<li><a class="link" href="https://github.com/alecthomas/chroma" target="_blank" rel="noopener"
>https://github.com/alecthomas/chroma</a></li>
<li><a class="link" href="https://github.com/muesli/smartcrop" target="_blank" rel="noopener"
>https://github.com/muesli/smartcrop</a></li>
<li><a class="link" href="https://github.com/spf13/cobra" target="_blank" rel="noopener"
>https://github.com/spf13/cobra</a></li>
<li><a class="link" href="https://github.com/spf13/viper" target="_blank" rel="noopener"
>https://github.com/spf13/viper</a></li>
</ul>
<p>Hugo is ideal for blogs, corporate websites, creative portfolios, online magazines, single page applications or even a website with thousands of pages.</p>
<p>Hugo is for people who want to hand code their own website without worrying about setting up complicated runtimes, dependencies and databases.</p>
<p>Websites built with Hugo are extremelly fast, secure and can be deployed anywhere including, AWS, GitHub Pages, Heroku, Netlify and any other hosting provider.</p>
<p>Learn more and contribute on <a class="link" href="https://github.com/gohugoio" target="_blank" rel="noopener"
>GitHub</a>.</p>
</description>
</item>
<item>
<title>Links</title>
<link>https://JamesL813.github.io/links/</link>
<pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
<guid>https://JamesL813.github.io/links/</guid>
<description><p>To use this feature, add <code>links</code> section to frontmatter.</p>
<p>This page&rsquo;s frontmatter:</p>
<div class="highlight"><div class="chroma">
<table class="lntable"><tr><td class="lntd">
<pre tabindex="0" class="chroma"><code><span class="lnt">1
</span><span class="lnt">2
</span><span class="lnt">3
</span><span class="lnt">4
</span><span class="lnt">5
</span><span class="lnt">6
</span><span class="lnt">7
</span><span class="lnt">8
</span><span class="lnt">9
</span></code></pre></td>
<td class="lntd">
<pre tabindex="0" class="chroma"><code class="language-yaml" data-lang="yaml"><span class="line"><span class="cl"><span class="nt">links</span><span class="p">:</span><span class="w">
</span></span></span><span class="line"><span class="cl"><span class="w"> </span>- <span class="nt">title</span><span class="p">:</span><span class="w"> </span><span class="l">GitHub</span><span class="w">
</span></span></span><span class="line"><span class="cl"><span class="w"> </span><span class="nt">description</span><span class="p">:</span><span class="w"> </span><span class="l">GitHub is the world&#39;s largest software development platform.</span><span class="w">
</span></span></span><span class="line"><span class="cl"><span class="w"> </span><span class="nt">website</span><span class="p">:</span><span class="w"> </span><span class="l">https://github.com</span><span class="w">
</span></span></span><span class="line"><span class="cl"><span class="w"> </span><span class="nt">image</span><span class="p">:</span><span class="w"> </span><span class="l">https://github.githubassets.com/images/modules/logos_page/GitHub-Mark.png</span><span class="w">
</span></span></span><span class="line"><span class="cl"><span class="w"> </span>- <span class="nt">title</span><span class="p">:</span><span class="w"> </span><span class="l">TypeScript</span><span class="w">
</span></span></span><span class="line"><span class="cl"><span class="w"> </span><span class="nt">description</span><span class="p">:</span><span class="w"> </span><span class="l">TypeScript is a typed superset of JavaScript that compiles to plain JavaScript.</span><span class="w">
</span></span></span><span class="line"><span class="cl"><span class="w"> </span><span class="nt">website</span><span class="p">:</span><span class="w"> </span><span class="l">https://www.typescriptlang.org</span><span class="w">
</span></span></span><span class="line"><span class="cl"><span class="w"> </span><span class="nt">image</span><span class="p">:</span><span class="w"> </span><span class="l">ts-logo-128.jpg</span><span class="w">
</span></span></span></code></pre></td></tr></table>
</div>
</div><p><code>image</code> field accepts both local and external images.</p>
</description>
</item>
<item>
<title>Search</title>
<link>https://JamesL813.github.io/search/</link>
<pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
<guid>https://JamesL813.github.io/search/</guid>
<description></description>
</item>
</channel>
</rss>