/** * Creates a new instance of BallTree. */ public BallTree() { super(); if(getMeasurePerformance()) m_Stats = m_TreeStats = new TreePerformanceStats(); }
/** * Builds the Cover Tree on the given set of instances. * * @param instances The insts on which the Cover Tree is to be built. * @throws Exception If some error occurs while building the Cover Tree */ @Override public void setInstances(Instances instances) throws Exception { super.setInstances(instances); buildCoverTree(instances); }
/** * Builds the KDTree on the given set of instances. * @param instances The insts on which the KDTree is to be * built. * @throws Exception If some error occurs while * building the KDTree */ public void setInstances(Instances instances) throws Exception { super.setInstances(instances); buildKDTree(instances); }
/** * Builds the BallTree based on the given set of instances. * @param insts The insts for which the BallTree is to be * built. * @throws Exception If some error occurs while * building the BallTree */ public void setInstances(Instances insts) throws Exception { super.setInstances(insts); buildTree(); }
/** * Creates a new instance of KDTree. */ public KDTree() { super(); if (getMeasurePerformance()) m_Stats = m_TreeStats = new TreePerformanceStats(); }
/** * default constructor. */ public CoverTree() { super(); if (getMeasurePerformance()) { m_Stats = m_TreeStats = new TreePerformanceStats(); } }
/** * default constructor. */ public PerformanceStats() { reset(); }
/** * Creates a new internal node for a given Instance/point p. * * @param idx The index of the instance the node represents. * @return Newly created CoverTreeNode. */ protected CoverTreeNode new_node(Integer idx) { // const point &p) CoverTreeNode new_node = new CoverTreeNode(); new_node.idx = idx; return new_node; }
/** * Replaces the current top/max value in the heap with the new one. The new * max value should be <= the old one. * * @param upper_bound The heap. * @param new_bound The new value that should replace the old top one. * @throws Exception if the new value is greater than the old value. */ protected void update(MyHeap upper_bound, double new_bound) throws Exception { upper_bound.putBySubstitute(new_bound); }
/** * Returns the distances for the nearest neighbours in the FILTERED space * * @return the array of distances for the nearest neighbours * * @see weka.core.neighboursearch.NearestNeighbourSearch#getDistances() */ @Override public double[] getDistances() throws Exception { return m_ModifiedSearchMethod.getDistances(); }
/** * Builds the Cover Tree on the given set of instances. * * @param instances The insts on which the Cover Tree is to be built. * @throws Exception If some error occurs while building the Cover Tree */ @Override public void setInstances(Instances instances) throws Exception { super.setInstances(instances); buildCoverTree(instances); }
/** * Builds the KDTree on the given set of instances. * @param instances The insts on which the KDTree is to be * built. * @throws Exception If some error occurs while * building the KDTree */ public void setInstances(Instances instances) throws Exception { super.setInstances(instances); buildKDTree(instances); }
/** * Builds the BallTree based on the given set of instances. * @param insts The insts for which the BallTree is to be * built. * @throws Exception If some error occurs while * building the BallTree */ public void setInstances(Instances insts) throws Exception { super.setInstances(insts); buildTree(); }
/** * Creates a new instance of BallTree. */ public BallTree() { super(); if(getMeasurePerformance()) m_Stats = m_TreeStats = new TreePerformanceStats(); }
/** * Creates a new instance of KDTree. * It also builds the tree on supplied set of Instances. * @param insts The instances/points on which the BallTree * should be built on. */ public KDTree(Instances insts) { super(insts); if (getMeasurePerformance()) m_Stats = m_TreeStats = new TreePerformanceStats(); }
/** * default constructor. */ public CoverTree() { super(); if (getMeasurePerformance()) { m_Stats = m_TreeStats = new TreePerformanceStats(); } }
/** * Creates a new instance of BallTree. * It also builds the tree on supplied set of Instances. * @param insts The instances/points on which the BallTree * should be built on. */ public BallTree(Instances insts) { super(insts); if(getMeasurePerformance()) m_Stats = m_TreeStats = new TreePerformanceStats(); }
/** * Creates a new instance of KDTree. */ public KDTree() { super(); if (getMeasurePerformance()) m_Stats = m_TreeStats = new TreePerformanceStats(); }
/** * Creates a new instance of BallTree. * It also builds the tree on supplied set of Instances. * @param insts The instances/points on which the BallTree * should be built on. */ public BallTree(Instances insts) { super(insts); if(getMeasurePerformance()) m_Stats = m_TreeStats = new TreePerformanceStats(); }
/** * Creates a new instance of KDTree. * It also builds the tree on supplied set of Instances. * @param insts The instances/points on which the BallTree * should be built on. */ public KDTree(Instances insts) { super(insts); if (getMeasurePerformance()) m_Stats = m_TreeStats = new TreePerformanceStats(); }