Learn R Programming

mstclustering (version 1.0.0.0)

"MST-Based Clustering"

Description

Implements a minimum-spanning-tree-based heuristic for k-means clustering using a union-find disjoint set and the algorithm in Kruskal (1956) .

Copy Link

Version

Install

install.packages('mstclustering')

Monthly Downloads

194

Version

1.0.0.0

License

AGPL (>= 3)

Maintainer

Kevin Frick

Last Published

February 8th, 2022

Functions in mstclustering (1.0.0.0)

mst.cluster

mst.cluster
kruskal

kruskal
is.same.set

is.same.set
union.set

union.set
gen.edge.list

gen.edge.list
reset.ufds

reset.ufds
find.set

find.set
gen.child.list.mst

gen.child.list.mst