PMST.Construction {HGC} | R Documentation

## Building Unweighted Perturbed Minimum Spanning Tree Graph

### Description

This function builds an Unweighted Perturbed Minimum Spanning Tree (PMST) graph in the input feature space using Euclidean distance metric.

### Usage

    PMST.Construction(mat, iter, r)

### Arguments

`mat` | the input data saved as a numerical matrix. The columns are the features and the rows are the samples.
`iter` | the number of perturbation.
`r` | the parameter about the strength of the perturbation.

### Details

The function builds a PMST graph of the input data. PMST is the combination of a number of MSTs, which are built in the perturbed data spaces.

### Value

An n by n binary dgCMatrix object C, where n is the number of input samples. The matrix C is the adjacency matrix of the built PMST graph. C[i,j] = 1 means that there is an edge between sample i and sample j.

### Examples

    data(Pollen)
    Pollen.PCs <- Pollen[["PCs"]]
    G <- PMST.Construction(Pollen.PCs)

[Package HGC version 1.2.0 Index]