Changes between Version 44 and Version 45 of Parallel-DT

Timestamp:

Jan 18, 2010, 10:30:41 PM (14 years ago)

Author:

andrei.minca

Comment:

--

Parallel-DT

@@ -30 +30 @@
 In this approach, all processors construct a decision tree syncronously by sending and receiving class distribution information of local data. Major steps for the approach:
  
-   * select a node to expand according to a decision tree expansion strategy (eg Depth-First or Breadth-First), and call that node as the current node. At the beginning, root node is selected as the current node
+   * select a node to expand according to a decision tree expansion strategy (eg. Depth-First or Breadth-First), and call that node as the current node. At the beginning, root node is selected as the current node
    * for each data attribute, collect class distribution information of the local data at the current node
    * exchange the local class distribuition information using global reduction among processors
@@ -47 +47 @@
 
 '''Step 1''' processors in ''Pn'' cooperate to expand node ''n''
+
 '''Step 2''' once the node ''n'' is expanded in to successors nodes, ''n1'', ''n2'', ..., ''nk'' then the processor group ''Pn'' is also partitioned, and the successor nodes are assigned to processors as follows:
+
    '''Case 1''': if the number of successor nodes is greater than |''Pn''|
                1. partition the successors into |''Pn''| groups such that the total number of training cases corresponding to each node group is roughly equal. Assign each processor to one node group.