dils: Data-Informed Link Strength. Combine multiple-relationship networks into a single weighted network. Impute (fill-in) missing network links.

Combine multiple-relationship networks into a single weighted network. The approach is similar to factor analysis in the that contribution from each constituent network varies so as to maximize the information gleaned from the multiple-relationship networks. This implementation uses Principal Component Analysis calculated using 'prcomp' with bootstrap subsampling. Missing links are imputed using the method of Chen et al. (2012).

AuthorStephen R. Haptonstahl
Date of publication2013-11-25 21:23:02
MaintainerStephen R. Haptonstahl <srh@haptonstahl.org>
LicenseMIT + file LICENSE
Version0.8.1

View on CRAN

Functions

AdjacencyFromEdgelist Man page
dils-package Man page
EdgelistFill Man page
EdgelistFromAdjacency Man page
EdgelistFromIgraph Man page
GenerateDilsNetwork Man page
GetSampleFromDataFrame Man page
GetSampleFromDb Man page
GetSampleFromFile Man page
IgraphFromEdgelist Man page
MeasureNetworkInformation Man page
MergeEdgelists Man page
RelationStrengthSimilarity Man page
RelativeNetworkInformation Man page
RssCell Man page
RssSuggestedNetwork Man page
RssThisRadius Man page
ScalablePCA Man page

Questions? Problems? Suggestions? or email at ian@mutexlabs.com.

Please suggest features or report bugs with the GitHub issue tracker.

All documentation is copyright its authors; we didn't write any of that.