Function to automatically learn the structure of data by either using L1-graph or the spanning-tree formulization
calc_principal_graph(
X,
C0,
maxiter = 10,
eps = 1e-05,
L1.gamma = 0.5,
L1.sigma = 0.01,
verbose = T
)the input data DxN
the initialization of centroids
maximum number of iteration
relative objective difference
regularization parameter for k-means (the prefix of 'param' is used to avoid name collision with gamma)
bandwidth parameter
emit results from iteration
a list of X, C, W, P, objs X is the input data C is the centers for principal graph W is the principal graph matrix P is the cluster assignment matrix objs is the objective value for the function