Examples of weka.core.neighboursearch.kdtrees.KDTreeNode

weka.core.neighboursearch.kdtrees.KDTreeNode

A class representing a KDTree node. A node does not explicitly store the instances that it contains. Instead, it only stores the start and end index of a portion in a master index array. Each node is assigned a portion in the master index array that stores the indices of the instances that the node contains. Every time a node is split by the KDTree's contruction method, the instances of its left child are moved to the left and the instances of its right child are moved to the right, in the portion of the master index array belonging to the node. The start and end index in each of its children are then set accordingly within that portion so that each have their own portion which contains their instances. P.S.: The master index array is only stored in KDTree class. @author Ashraf M. Kibriya (amk14[at-the-rate]cs[dot]waikato[dot]ac[dot]nz) @version $Revision: 1.2 $

    m_Splitter.setNodeWidthNormalization(m_NormalizeNodeWidth);


    // building tree
    m_NumNodes = m_NumLeaves = 1;
    m_MaxDepth = 0;
    m_Root = new KDTreeNode(m_NumNodes, 0, m_Instances.numInstances() - 1,
        universe);


    splitNodes(m_Root, universe, m_MaxDepth + 1);
  }


    } else {
      if (m_TreeStats != null) {
        m_TreeStats.incrIntNodeCount();
      }
      KDTreeNode nearer, further;
      boolean targetInLeft = m_EuclideanDistance.valueIsSmallerEqual(target,
          node.m_SplitDim, node.m_SplitValue);


      if (targetInLeft) {
        nearer = node.m_Left;

    m_Splitter.setNodeWidthNormalization(m_NormalizeNodeWidth);


    // building tree
    m_NumNodes = m_NumLeaves = 1;
    m_MaxDepth = 0;
    m_Root = new KDTreeNode(m_NumNodes, 0, m_Instances.numInstances() - 1,
        universe);


    splitNodes(m_Root, universe, m_MaxDepth + 1);
  }


    } else {
      if (m_TreeStats != null) {
        m_TreeStats.incrIntNodeCount();
      }
      KDTreeNode nearer, further;
      boolean targetInLeft = m_EuclideanDistance.valueIsSmallerEqual(target,
          node.m_SplitDim, node.m_SplitValue);


      if (targetInLeft) {
        nearer = node.m_Left;

Examples of weka.core.neighboursearch.kdtrees.KDTreeNode

Related Classes of weka.core.neighboursearch.kdtrees.KDTreeNode