You are viewing a plain text version of this content. The canonical link for it is here.

Posted to issues@spark.apache.org by "Joseph K. Bradley (JIRA)" <ji...@apache.org> on 2014/08/14 20:16:13 UTC

[jira] [Created] (SPARK-3042) DecisionTree filtering is very inefficient

Joseph K. Bradley created SPARK-3042:
----------------------------------------

             Summary: DecisionTree filtering is very inefficient
                 Key: SPARK-3042
                 URL: https://issues.apache.org/jira/browse/SPARK-3042
             Project: Spark
          Issue Type: Improvement
          Components: MLlib
            Reporter: Joseph K. Bradley


DecisionTree needs to match each example to a node at each iteration.  It currently does this with a set of filters very inefficiently: For each example, it examines each node at the current level and traces up to the root to see if that example should be handled by that node.

Proposed fix: Filter top-down using the partly built tree itself.



--
This message was sent by Atlassian JIRA
(v6.2#6252)

---------------------------------------------------------------------
To unsubscribe, e-mail: issues-unsubscribe@spark.apache.org
For additional commands, e-mail: issues-help@spark.apache.org