<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Survival Trees on R Views</title>
    <link>https://rviews.rstudio.com/tags/survival-trees/</link>
    <description>Recent content in Survival Trees on R Views</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en-us</language>
    <lastBuildDate>Fri, 29 Dec 2017 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://rviews.rstudio.com/tags/survival-trees/" rel="self" type="application/rss+xml" />
    
    
    
    
    <item>
      <title>Downtime Reading</title>
      <link>https://rviews.rstudio.com/2017/12/29/down-time-reading/</link>
      <pubDate>Fri, 29 Dec 2017 00:00:00 +0000</pubDate>
      
      <guid>https://rviews.rstudio.com/2017/12/29/down-time-reading/</guid>
      <description>
        &lt;p&gt;Not everyone has the luxury of taking some downtime at the end the year, but if you do have some free time, you may enjoy something on my short list of downtime reading. The books and articles here are not exactly &amp;ldquo;light reading&amp;rdquo;, nor are they literature for cuddling by the fire. Nevertheless, you may find something that catches your eye.&lt;/p&gt;

&lt;p&gt;The &lt;a href=&#34;https://www.syncfusion.com/resources/techportal/ebooks&#34;&gt;Syncfusion series&lt;/a&gt; of free eBooks contains more than a few gems on a variety of programming subjects, including James McCaffrey&amp;rsquo;s &lt;a href=&#34;https://www.syncfusion.com/resources/techportal/details/ebooks/R-Programming_Succinctly&#34;&gt;R Programming Succinctly&lt;/a&gt; and Barton Poulson&amp;rsquo;s &lt;a href=&#34;https://www.syncfusion.com/resources/techportal/details/ebooks/rsuccinctly&#34;&gt;R Succinctly&lt;/a&gt;.&lt;/p&gt;

&lt;p&gt;&lt;img src=&#34;/post/2017-12-28-Rickert-Reading_files/succinctly.png&#34; alt=&#34;&#34; /&gt;&lt;/p&gt;

&lt;p&gt;For a more ambitious read, mine the rich vein of &lt;a href=&#34;https://textbooks.opensuny.org/open-source-textbooks/&#34;&gt;SUNY Open Textbooks&lt;/a&gt;. My pick is Hiroki Sayama&amp;rsquo;s &lt;a href=&#34;https://textbooks.opensuny.org/introduction-to-the-modeling-and-analysis-of-complex-systems/&#34;&gt;Introduction to the Modeling and Analysis of Complex Systems&lt;/a&gt;.&lt;/p&gt;

&lt;p&gt;&lt;img src=&#34;/post/2017-12-28-Rickert-Reading_files/complex.png&#34; alt=&#34;&#34; /&gt;&lt;/p&gt;

&lt;p&gt;If you just can&amp;rsquo;t get enough of data science, then a few articles that caught my attention are:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Christopher Olah&amp;rsquo;s brief but mind-stretching post on &lt;a href=&#34;http://colah.github.io/posts/2014-03-NN-Manifolds-Topology/&#34;&gt;Neural Networks, Manifolds, and Topology&lt;/a&gt;, which is good preparation for the Fujitsu Laboratories paper on &lt;a href=&#34;https://www.jstage.jst.go.jp/article/tjsai/32/3/32_D-G72/_pdf&#34;&gt;Time Series Classification via Topological Data Analysis&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;The paper by Nguyen and Holmes on their &lt;a href=&#34;https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-017-1790-x&#34;&gt;Bayesian Unidimensional Scaling (BUDS)&lt;/a&gt; method for detecting patterns in high-dimensional data&lt;/li&gt;
&lt;li&gt;Bou-Hamad et. al&amp;rsquo;s &lt;a href=&#34;https://projecteuclid.org/download/pdfview_1/euclid.ssu/1315833185&#34;&gt;A review of survival trees&lt;/a&gt;, a valuable introduction to the literature on the subject&lt;/li&gt;
&lt;li&gt;Rob Hyndman&amp;rsquo;s recent post on &lt;a href=&#34;https://robjhyndman.com/hyndsight/tspackages/&#34;&gt;Some new time series packages&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Mike Bostock&amp;rsquo;s beautiful and mind-altering post on &lt;a href=&#34;https://bost.ocks.org/mike/algorithms/?t=1&amp;amp;cn=ZmxleGlibGVfcmVjcw%3D%3D&amp;amp;refsrc=email&amp;amp;iid=90e204098ee84319b825887ae4c1f757&amp;amp;uid=765311247189291008&amp;amp;nid=244+281088008&#34;&gt;Visualizing Algorithms&lt;/a&gt;.&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;&lt;img src=&#34;/post/2017-12-28-Rickert-Reading_files/starry.png&#34; alt=&#34;Starry Night through 6,667 uniform random samples&#34; /&gt;&lt;/p&gt;

&lt;p&gt;Finally, if you really have some time on your hands, try searching through the 318M+ papers on &lt;a href=&#34;https://www.pdfdrive.net/&#34;&gt;PDFDRIVE&lt;/a&gt;.&lt;/p&gt;

&lt;p&gt;Happy reading, and have a &lt;em&gt;Happy and Prosperous New Year&lt;/em&gt; from all of us at RStudio!!&lt;/p&gt;

        &lt;script&gt;window.location.href=&#39;https://rviews.rstudio.com/2017/12/29/down-time-reading/&#39;;&lt;/script&gt;
      </description>
    </item>
    
  </channel>
</rss>
