<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" version="2.0">
  <channel>
    <title>topic Re: CHAID algorithm vs. JMP partition (decision tree) in Discussions</title>
    <link>https://community.jmp.com/t5/Discussions/CHAID-algorithm-vs-JMP-partition-decision-tree/m-p/10450#M10125</link>
    <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;Hi Joe,&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Here is a very brief overview on differences (from the SAS forum, but the same insights apply): &lt;/P&gt;&lt;P&gt;&lt;A href="http://support.sas.com/kb/24/337.html" title="http://support.sas.com/kb/24/337.html"&gt;What differentiates the various Tree algorithms? What are the main differences between CHAID and CART?&lt;/A&gt;&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;and a more involved description I like from Prof. Galit Shmueli:&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;&lt;A href="http://www.bzst.com/2006/10/classification-trees-cart-vs-chaid.html" title="http://www.bzst.com/2006/10/classification-trees-cart-vs-chaid.html"&gt;Classification Trees: CART vs. CHAID&lt;/A&gt;&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;I hope this helps!&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Julian&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
    <pubDate>Tue, 23 Dec 2014 23:56:22 GMT</pubDate>
    <dc:creator>jules</dc:creator>
    <dc:date>2014-12-23T23:56:22Z</dc:date>
    <item>
      <title>CHAID algorithm vs. JMP partition (decision tree)</title>
      <link>https://community.jmp.com/t5/Discussions/CHAID-algorithm-vs-JMP-partition-decision-tree/m-p/10449#M10124</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;Hi All, I was wondering if anyone could tell me just how similar the JMP decision tree (partition) algorithm is to the classic CHAID approach.&lt;/P&gt;&lt;P&gt;Many thanks,&lt;/P&gt;&lt;P&gt;Joe Retzer&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Fri, 19 Dec 2014 17:50:47 GMT</pubDate>
      <guid>https://community.jmp.com/t5/Discussions/CHAID-algorithm-vs-JMP-partition-decision-tree/m-p/10449#M10124</guid>
      <dc:creator>jjrr</dc:creator>
      <dc:date>2014-12-19T17:50:47Z</dc:date>
    </item>
    <item>
      <title>Re: CHAID algorithm vs. JMP partition (decision tree)</title>
      <link>https://community.jmp.com/t5/Discussions/CHAID-algorithm-vs-JMP-partition-decision-tree/m-p/10450#M10125</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;Hi Joe,&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Here is a very brief overview on differences (from the SAS forum, but the same insights apply): &lt;/P&gt;&lt;P&gt;&lt;A href="http://support.sas.com/kb/24/337.html" title="http://support.sas.com/kb/24/337.html"&gt;What differentiates the various Tree algorithms? What are the main differences between CHAID and CART?&lt;/A&gt;&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;and a more involved description I like from Prof. Galit Shmueli:&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;&lt;A href="http://www.bzst.com/2006/10/classification-trees-cart-vs-chaid.html" title="http://www.bzst.com/2006/10/classification-trees-cart-vs-chaid.html"&gt;Classification Trees: CART vs. CHAID&lt;/A&gt;&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;I hope this helps!&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Julian&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Tue, 23 Dec 2014 23:56:22 GMT</pubDate>
      <guid>https://community.jmp.com/t5/Discussions/CHAID-algorithm-vs-JMP-partition-decision-tree/m-p/10450#M10125</guid>
      <dc:creator>jules</dc:creator>
      <dc:date>2014-12-23T23:56:22Z</dc:date>
    </item>
  </channel>
</rss>

