website

commit 38484883dcb79c1546f99b569c3bb25150280f9b
parent f3db848a16d2db8e382c9349415b6c6860de8ca5
Author: AndrewLockVI <andrew@laack.co>
Date:   Mon, 12 May 2025 00:00:25 -0500

Updated website

Diffstat:
M
index.html
 | 
20
++++++++++++++------

1 file changed, 14 insertions(+), 6 deletions(-)
diff --git a/index.html b/index.html
@@ -113,21 +113,29 @@ a:hover {
 	</h1>
 
 	<nav class="navigation">
-	  <a href="#research">Research</a>
+	  <a href="#research">research</a>
 	  <span class="separator">|</span>
-	  <a href="#code">Code</a>
+	  <a href="#code">code</a>
 	  <span class="separator">|</span>
-	  <a href="#workexperience">Work</a>
+	  <a href="#workexperience">work</a>
 	  <span class="separator">|</span>
-	  <a href="#studies">Studies</a>
+	  <a href="#studies">studies</a>
 	  <span class="separator">|</span>
-	  <a href="#contact">Contact</a>
+	  <a href="#contact">contact</a>
 	</nav>
 
 
   <hr>
   <h2 id="research">research</h2>
-  <p>I am currently doing research on oblique decision tree induction. <a href="https://git.laack.co/cart-elc"> The source</a> for my research is freely available, but requires citation if it is used in other research. The source repository contains the code for the algorithm, the associated .tex file for the research paper, tests, and all of the code used for data gathering.
+  <p> My main research interest is classical machine learning. In particular, oblique decision trees, ensemble methods, and interpretability.
+	
+<h3 id="publications">publications</h3>
+<ul>
+  <li>
+<strong>Laack, A. D.</strong> (2025, May 8). <em>CART-ELC: Oblique decision tree induction via exhaustive search</em> [Manuscript under review]. arXiv. <a href="https://doi.org/10.48550/arxiv.2505.05402" target="_blank">https://doi.org/10.48550/arxiv.2505.05402</a>
+  </li>
+</ul>
+
 
   <hr>
   <h2 id="code">code</h2>