It's a good question. People have been publishing papers on decision trees and various methods of constructing and pruning them for over 30 years. I think it's rather a question for a historian at this point.
On Fri, Sep 30, 2016 at 5:08 PM, janardhan shetty <janardhan...@gmail.com> wrote: > Read this explanation but wondering if this algorithm has the base from a > research paper for detail understanding. > > On Fri, Sep 30, 2016 at 1:36 PM, Kevin Mellott <kevin.r.mell...@gmail.com> > wrote: > >> The documentation details the algorithm being used at >> http://spark.apache.org/docs/latest/mllib-decision-tree.html >> >> Thanks, >> Kevin >> >> On Fri, Sep 30, 2016 at 1:14 AM, janardhan shetty <janardhan...@gmail.com >> > wrote: >> >>> Hi, >>> >>> Any help here is appreciated .. >>> >>> On Wed, Sep 28, 2016 at 11:34 AM, janardhan shetty < >>> janardhan...@gmail.com> wrote: >>> >>>> Is there a reference to the research paper which is implemented in >>>> spark 2.0 ? >>>> >>>> On Wed, Sep 28, 2016 at 9:52 AM, janardhan shetty < >>>> janardhan...@gmail.com> wrote: >>>> >>>>> Which algorithm is used under the covers while doing decision trees >>>>> FOR SPARK ? >>>>> for example: scikit-learn (python) uses an optimised version of the >>>>> CART algorithm. >>>>> >>>> >>>> >>> >> >
