Documentation of 'jsat.linear.vectorcollection.VPTreeMV' Java class
VPTreeMV
jsat.linear.vectorcollection

Class VPTreeMV<V extends Vec>

  • All Implemented Interfaces:
    java.io.Serializable, java.lang.Cloneable, DualTree<V>, IncrementalCollection<V>, VectorCollection<V>


    public class VPTreeMV<V extends Vec>
    extends VPTree<V>
    The VPTreeMV is an extension of the VPTree, the MV meaning "of Minimum Variance". This extension alters the splitting method of nodes, giving up the O(log n) bound on query time. This is done to reduce the variance in the distance to the parent node of each split, which can result in lopsided distributions of values for each split. At the same time, this lopsidedness may better reflect the locality of points in the data set. This can result in a decrease in query time for some data sets, with minimal impact on construction time.
    See Also:
    Serialized Form

DataMelt 3.0 © DataMelt by jWork.ORG

You see the box below because you did not login.