insert_nodes

(list): The nested list containing the heaps. Each entry in the
list is a list maintained in max-heap structure.

heap_list

(numeric): The vector representing the heap assignments.

heap_assn

(string): A vector containing the probability for data.

data_probs

(numeric): A vector containing the indices of leaves in heap.

leaves_ind

(numeric): The number of clusters. Default: 2

num_clusters

Implements the node insertion into the heaps.

Implements the Improved Expectation Maximisation EM* and the traditional EM algorithm for clustering
big data (gaussian mixture models for both multivariate and univariate datasets). This version
implements the faster alternative EM* that avoids revisiting data by leveraging the heap structure.
The implementation supports both random and K-means++ based initialization. Reference: Hasan Kurban, Mark Jenne,
Mehmet M. Dalkilic (2016) <doi:10.1007/s41060-017-0062-1>. This work is partially supported by
NCI Grant 1R01CA213466-01.

insert_nodes: insert_nodes: Part of DCEM package.

Description

Usage

Arguments

Value

References