knnGraph: Convert a data matrix to a K-NN graph or epsilon graph
In spa: Implements The Sequential Predictions Algorithm

Description Usage Arguments Details Value Note Author(s) References See Also

These functions are designed to convert data sets or distance matrices to graphs.

1 2	knnGraph(x, k = 5, weighted = TRUE, dist = FALSE, ...) epsGraph(x, eps = 0.2, weighted = TRUE, dist=FALSE, ...)

`x`	the data matrix, if `dist`=TRUE then x is a distance matrix
`k`	the number of neighbors for a knn graph
`eps`	size of fixed radius
`weighted`	if TRUE the graph will be weighted. Note if TRUE use `floyd` for shortest path distance otherwise use `fastDist`.
`dist`	when dist=TRUE then x is a distance matrix
`...`	Extra parameters for the daisy(...) method

The daisy function in cluster library is used primarily due to its speed and reliability.

`g`	A graph made from data x or distance matrix as input.

This command relies on the cluster library

Mark Culp

M. Culp (2011). spa: A Semi-Supervised R Package for Semi-Parametric Graph-Based Estimation. Journal of Statistical Software, 40(10), 1-29. URL http://www.jstatsoft.org/v40/i10/.

spa knnGraph epsGraph

spa documentation built on May 30, 2017, 1:27 a.m.