|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Graph.addEdge(EdgeType,Node,Node,double)
instead
null
if this queue is sorted according to
the natural ordering of its elements.
risk(predictions) = sum over x in testset: argmin_i [ 1-f(x,i) ],
where f(x,i)
is the probability that x
belongs to class i
.
NetworkLearning.LC_PREFIX
property.
classifier
and options
properties in addition to anything used by the superclass.
classifier
and options
properties in addition to anything used by the superclass.
classifier
and options
properties in addition to anything used by the superclass.
true
if this queue contains the specified element.
result[numsplit][0][...]
is the training set for split numsplit
and result[numsplit][1][...]
is the test set for split numsplit
.
Node.getNeighbors(List,NodeFilter)
except that the
NodeFilter always accepts Nodes, nothing is filtered out.
SchemaReader.readGDASchema(Reader,Reader)
PajekGraph.readGraph(Reader)
SchemaReader.readSchema(Reader,String)
PriorityQueue
with the default initial
capacity (11) that orders its elements according to their
natural ordering.
PriorityQueue
with the specified initial
capacity that orders its elements according to their
natural ordering.
PriorityQueue
with the specified initial capacity
that orders its elements according to the specified comparator.
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |