Learn R Programming

dils (version 0.8.1)

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

Description

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).

Copy Link

Version

Install

install.packages('dils')

Monthly Downloads

9

Version

0.8.1

License

MIT + file LICENSE

Maintainer

Stephen Haptonstahl

Last Published

November 25th, 2013

Functions in dils (0.8.1)

RssSuggestedNetwork

Suggest a network with imputed links
GetSampleFromDb

Sample from the rows of a (possibly large) database table (NOT IMPLEMENTED)
AdjacencyFromEdgelist

Convert an edgelist to an adjacency matrix
GetSampleFromDataFrame

Randomly select rows from a data.frame.
RssCell

Calculate the RSS from one node to another.
RssThisRadius

Calculate part of the RSS from one node to another.
EdgelistFromAdjacency

Convert an adjacency matrix to filled edgelist.
RelativeNetworkInformation

Compare how much two networks inform a particular network measure
GetSampleFromFile

Sample from the rows of a (possibly large) text file (NOT IMPLEMENTED)
EdgelistFill

Ensure an edgelist has all dyads and a column of weights.
ScalablePCA

Perform Principal Component Analysis on a large data set
IgraphFromEdgelist

Convert an edgelist to an igraph
MergeEdgelists

Combine edgelists into a single data.frame
MeasureNetworkInformation

Measure how much a network informs a particular network measure
GenerateDilsNetwork

Combine multiple networks into a single weighted network.
dils-package

Data-Informed Link Strength. Combine multiple-relationship networks into a single weighted network.
EdgelistFromIgraph

Convert an igraph to filled edgelist
RelationStrengthSimilarity

Calculate the RSS from one node to another.