get.algorithms

an string for the type of algorithms. The default value is prototype for the names of algorithms for initialization of cluster prototypes. Use membership for the names of algorithms for initialization of hard and fuzzy membership degrees.

atype

Gets the names of initialization algorithms which are available in the package &#8216;inaparc&#8217;.

Partitioning clustering algorithms divide data sets into k subsets or partitions so-called clusters. They require some initialization procedures for starting the algorithms. Initialization of cluster prototypes is one of such kind of procedures for most of the partitioning algorithms. Cluster prototypes are the centers of clusters, i.e. centroids or medoids, representing the clusters in a data set. In order to initialize cluster prototypes, the package 'inaparc' contains a set of the functions that are the implementations of several linear time-complexity and loglinear time-complexity methods in addition to some novel techniques. Initialization of fuzzy membership degrees matrices is another important task for starting the probabilistic and possibilistic partitioning algorithms. In order to initialize membership degrees matrices required by these algorithms, a number of functions based on some traditional and novel initialization techniques are also available in the package 'inaparc'.

get.algorithms: Get the names of algorithms in ‘inaparc’

Description

Usage

Arguments

Value

See Also

Examples