<?xml version="1.0" encoding="utf-8" standalone="yes" ?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Visualization on OranLooney.com</title>
    <link>https://www.oranlooney.com/tags/visualization/</link>
    <description>Recent content in Visualization on OranLooney.com</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en</language>
    <lastBuildDate>Thu, 16 Jul 2026 00:00:00 +0000</lastBuildDate>
    
	<atom:link href="https://www.oranlooney.com/tags/visualization/index.xml" rel="self" type="application/rss+xml" />
    
    
    <item>
      <title>What Rose Petals Teach Us about Induction</title>
      <link>https://www.oranlooney.com/post/rose-petals/</link>
      <pubDate>Thu, 16 Jul 2026 00:00:00 +0000</pubDate>
      
      <guid>https://www.oranlooney.com/post/rose-petals/</guid>
      <description>Richard Hamming famously used to ask his colleagues at Bell Labs this question: &amp;ldquo;What is the most important problem in your field, and why aren&amp;rsquo;t you working on it?&amp;rdquo; To which they probably replied, &amp;ldquo;Look, Dick, it&amp;rsquo;s eight-thirty in the morning. I haven&amp;rsquo;t even had my coffee yet. Who starts a conversation like that?</description>
    </item>
    
    <item>
      <title>Modeling Cycles of Grift with Evolutionary Game Theory</title>
      <link>https://www.oranlooney.com/post/grifters-skeptics-marks/</link>
      <pubDate>Sun, 22 Feb 2026 00:00:00 +0000</pubDate>
      
      <guid>https://www.oranlooney.com/post/grifters-skeptics-marks/</guid>
      <description>We are in a golden age of grift. Where adventurers once flocked to California or the Yukon because &amp;ldquo;there was gold in them thar hills,&amp;rdquo; the fastest way to get rich today is by fleecing suckers. We&amp;rsquo;ve got crypto rug pulls, meme stocks, nutritional supplements, MLMs&amp;mdash;anything to make a quick buck.</description>
    </item>
    
    <item>
      <title>The Art and Mathematics of Genji-Kō</title>
      <link>https://www.oranlooney.com/post/genji-ko/</link>
      <pubDate>Tue, 26 Nov 2024 00:00:00 +0000</pubDate>
      
      <guid>https://www.oranlooney.com/post/genji-ko/</guid>
      <description>You might think it&amp;rsquo;s unlikely for any interesting mathematics to arise from incense appreciation, but that&amp;rsquo;s only because you&amp;rsquo;re unfamiliar with the peculiar character of Muromachi (室町) era Japanese nobles.
There has never been a group of people, in any time or place, who were so driven to display their sophistication and refinement.</description>
    </item>
    
    <item>
      <title>Stacking Triangles for Fun and Profit</title>
      <link>https://www.oranlooney.com/post/angle-addition/</link>
      <pubDate>Mon, 08 Apr 2024 00:00:00 +0000</pubDate>
      
      <guid>https://www.oranlooney.com/post/angle-addition/</guid>
      <description>One thing you may have noticed about the trigonometric functions sine and cosine is that they seem to have no agreed upon definition. Or rather, different authors choose different definitions as the starting point, mainly based on convenience. This isn&amp;rsquo;t problematic or even particularly unusual in mathematics: as long as we can derive any of the other forms from any starting point, it makes little difference which we start from.</description>
    </item>
    
    <item>
      <title>Kaprekar&#39;s Magic 6174</title>
      <link>https://www.oranlooney.com/post/kaprekar/</link>
      <pubDate>Sun, 25 Feb 2024 00:00:00 +0000</pubDate>
      
      <guid>https://www.oranlooney.com/post/kaprekar/</guid>
      <description>&lt;p&gt;&lt;a href=&#34;https://en.wikipedia.org/wiki/Kaprekar%27s_routine&#34;&gt;Kaprekar&amp;rsquo;s routine&lt;/a&gt; is a simple arithmetic procedure on four digit numbers which rapidly converges to the fixed point 6174, known as the
Kaprekar constant. Unlike other famous iterative procedures such as the
&lt;a href=&#34;https://en.wikipedia.org/wiki/Collatz_conjecture&#34;&gt;Collatz function&lt;/a&gt;, the &lt;em&gt;ad hoc&lt;/em&gt; nature of the Kaprekar routine
doesn&amp;rsquo;t hint at fundamental mathematical discoveries yet to be made.
&lt;/p&gt;</description>
    </item>
    
    <item>
      <title>Cracking Playfair Ciphers</title>
      <link>https://www.oranlooney.com/post/playfair/</link>
      <pubDate>Wed, 13 Sep 2023 00:00:00 +0000</pubDate>
      
      <guid>https://www.oranlooney.com/post/playfair/</guid>
      <description>In 2020, the Zodiac 340 cipher was finally cracked after more than 50 years of trying by amateur code breakers. While the effort to crack it was extremely impressive, the cipher itself was ultimately disappointing. A homophonic substitution cipher with a minor gimmick of writing diagonally, the main factor that prevented it from being solved much earlier was the several errors the Zodiac killer made when encoding it.</description>
    </item>
    
    <item>
      <title>Visualizing Multiclass Classification Results</title>
      <link>https://www.oranlooney.com/post/viz-tsne/</link>
      <pubDate>Thu, 23 Aug 2018 00:00:00 +0000</pubDate>
      
      <guid>https://www.oranlooney.com/post/viz-tsne/</guid>
      <description>Introduction Visualizing the results of a binary classifier is already a challenge, but having more than two classes aggravates the matter considerably.
Let&amp;rsquo;s say we have $k$ classes. Then for each observation, there is one correct prediction and $k-1$ possible incorrect prediction. Instead of a $2 \times 2$ confusion matrix, we have a $k^2$ possibilities.</description>
    </item>
    
  </channel>
</rss>