The SuperCENT methodology that simultaneously solves the centrality estimation and regression given a fixed \(\lambda\).
supercent( A, X, y, l = NULL, tol = 1e-04, max_iter = 200, weights = rep(1, length(y)), verbose = 0, ... )
A | The input network |
---|---|
X | The design matrix |
y | The response vector |
l | The tuning parameter of the penalty |
tol | The precision tolerance to stop |
max_iter | The maximum iteration |
weights | The weight vector for each observation in (X,y) |
verbose | Output detailed message at different levels |
folds | The number of fold for cross-validation |
Output a supercent
object
The estimated \(d\)
The estimated hub centrality
The estimated authority centrality
The scaled estimated regression coeffcients
The tuning parameter \(\lambda\)
The residuals of the regression
The predicted response
The estimated \(\sigma_a\)
The estimated \(\sigma_y\)
The adjacency matrix of the input network
The input design matrix
The input response
The grid of the tuning parameter
The maximum iteration
The sequence of differences of \(\hat{u}\) between the two consecutive iterations
The estimation method: supercent