Learn R Programming

mstknnclust (version 0.3.2)

generate.intersections.mst.knn: Performs the intersections between MST y kNN graphs

Description

This function performs a graph partition based on the intersection of the edges of two proximity graphs: MST and kNN.

Usage

generate.intersections.mst.knn(nodes.list, distance.matrix, suggested.k)

Value

A list with the elements

cc

A numeric value representing the number of connected components (cc) generated after graphs intersection.

subgraphs

A list where each item contains the nodes of the connected components (cc) generated.

ccgraph

A object of class "igraph" which is a network with each connected components (cc) generated.

Arguments

nodes.list

A vector with a subset of objects (nodes) of the data matrix for which the MST y kNN graphs must be generated.

distance.matrix

A distance matrix between each pair of elements in nodes.list. It is used as the edges costs to generate MST y kNN graphs.

suggested.k

A numeric value representing the number of nearest neighbors to consider to generate the kNN graph.

Author

Mario Inostroza-Ponta, Jorge Parraga-Alava, Pablo Moscato