

PREV CLASS NEXT CLASS  FRAMES NO FRAMES  
SUMMARY: NESTED  FIELD  CONSTR  METHOD  DETAIL: FIELD  CONSTR  METHOD 
java.lang.Object de.aitools.aq.graph.weighted.util.KNNGraph
public final class KNNGraph
Method Summary  

static

createUndirectedKNNGraph(Vector[] data,
V[] vertices,
java.util.Comparator<V> vertexComparator,
Proximity<Vector> proximity,
int k)
Deprecated. Create an undirected KNearestNeighborGraph. 

static

createUndirectedKNNGraph(Vector[] data,
V[] vertices,
java.util.Comparator<V> vertexComparator,
Proximity<Vector> proximity,
int k,
double noEdgeWeight)
Deprecated. Create an undirected KNearestNeighborGraph. 

static UndirectedMutableIntGraph 
createUndirectedKNNIntGraph(Vector[] data,
Proximity<Vector> proximity,
int k)
Deprecated. Create an undirected KNearestNeighborGraph. 

static UndirectedMutableIntGraph 
createUndirectedKNNIntGraph(Vector[] data,
Proximity<Vector> proximity,
int k,
double noEdgeWeight)
Deprecated. Create an undirected KNearestNeighborGraph. 
Methods inherited from class java.lang.Object 

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait 
Method Detail 

public static <V> UndirectedMutableGraph<V> createUndirectedKNNGraph(Vector[] data, V[] vertices, java.util.Comparator<V> vertexComparator, Proximity<Vector> proximity, int k, double noEdgeWeight)
data
 The vectors to create the graph of.vertices
 The vertices of the graph. vertices[i] will
be treated as representative of data[i].vertexComparator
 The comparator is used to create the
ComparablesUndirectedGraph
.proximity
 Proximity measure to use on creating the graph.k
 Number of nearest neighbors. Must be greater than zero and
less than the number of vectors.noEdgeWeight
 Weight for all possible links between two vertices
that are not connected. See
UndirectedMutableIntGraph.setUnconnectedWeight(double)
.
public static <V> UndirectedMutableGraph<V> createUndirectedKNNGraph(Vector[] data, V[] vertices, java.util.Comparator<V> vertexComparator, Proximity<Vector> proximity, int k)
data
 The vectors to create the graph of.vertices
 The vertices of the graph. vertices[i] will
be treated as representative of data[i].vertexComparator
 The comparator is used to create the
ComparablesUndirectedGraph
.proximity
 Proximity measure to use on creating the graph.k
 Number of nearest neighbors. Must be greater than zero and
less than the number of vectors.
UndirectedMutableIntGraph.setUnconnectedWeight(double)
.
public static UndirectedMutableIntGraph createUndirectedKNNIntGraph(Vector[] data, Proximity<Vector> proximity, int k, double noEdgeWeight)
data
 The vectors to create the graph of.proximity
 Proximity measure to use on creating the graph.k
 Number of nearest neighbors. Must be greater than zero and
less than the number of vectors.noEdgeWeight
 Weight for all possible links between two vertices
that are not connected. See
UndirectedMutableIntGraph.setUnconnectedWeight(double)
.
public static UndirectedMutableIntGraph createUndirectedKNNIntGraph(Vector[] data, Proximity<Vector> proximity, int k)
data
 The vectors to create the graph of.proximity
 Proximity measure to use on creating the graph.k
 Number of nearest neighbors. Must be greater than zero and
less than the number of vectors.


PREV CLASS NEXT CLASS  FRAMES NO FRAMES  
SUMMARY: NESTED  FIELD  CONSTR  METHOD  DETAIL: FIELD  CONSTR  METHOD 