DIBcont: Cluster Continuous Data Using the Deterministic Information...

In IBclust: Information Bottleneck Methods for Clustering Mixed-Type Data

Cluster Continuous Data Using the Deterministic Information Bottleneck Algorithm

Description

The DIBcont function implements the Deterministic Information Bottleneck (DIB) algorithm for clustering continuous data. This method optimizes an information-theoretic objective to preserve relevant information while forming concise and interpretable cluster representations \insertCitecosta_dib_2025IBclust.

Usage

DIBcont(X, ncl, randinit = NULL, s = -1, scale = TRUE,
        maxiter = 100, nstart = 100, verbose = FALSE)

Arguments

X	A numeric matrix or data frame containing the continuous data to be clustered. All variables should be of type numeric.
ncl	An integer specifying the number of clusters to form.
randinit	Optional. A vector specifying initial cluster assignments. If NULL, cluster assignments are initialized randomly.
s	A numeric value or vector specifying the bandwidth parameter(s) for continuous variables. The values must be greater than 0. The default value is -1, which enables the automatic selection of optimal bandwidth(s).
scale	A logical value indicating whether the continuous variables should be scaled to have unit variance before clustering. Defaults to TRUE.
maxiter	The maximum number of iterations allowed for the clustering algorithm. Defaults to 100.
nstart	The number of random initializations to run. The best clustering result (based on the information-theoretic criterion) is returned. Defaults to 100.
verbose	Logical. Default to FALSE to suppress progress messages. Change to TRUE to print.

Details

The DIBcont function applies the Deterministic Information Bottleneck algorithm to cluster datasets comprising only continuous variables. This method leverages an information-theoretic objective to optimize the trade-off between data compression and the preservation of relevant information about the underlying data distribution.

The function utilizes the Gaussian kernel \insertCitesilverman_density_1998IBclust for estimating probability densities of continuous features. The kernel is defined as:

K_c\left(\frac{x - x'}{s}\right) = \frac{1}{\sqrt{2\pi}} \exp\left\{-\frac{\left(x - x'\right)^2}{2s^2}\right\}, \quad s > 0.

The bandwidth parameter s, which controls the smoothness of the density estimate, is automatically determined by the algorithm if not provided by the user.

Value

A list containing the following elements:

Cluster	An integer vector indicating the cluster assignment for each observation.
Entropy	A numeric value representing the entropy of the cluster assignments at convergence.
MutualInfo	A numeric value representing the mutual information, I(Y;T), between the underlying data distribution and the cluster assignments.
beta	A numeric vector of the final beta values used during the iterative optimization.
s	A numeric value or vector of bandwidth parameters used for the continuous variables. Typically, this will be a single value if all continuous variables share the same bandwidth.
ents	A numeric vector tracking the entropy values over the iterations, providing insight into the convergence process.
mis	A numeric vector tracking the mutual information values over the iterations.

Author(s)

Efthymios Costa, Ioanna Papatsouma, Angelos Markos

References

\insertRef

costa_dib_2025IBclust

\insertRef

silverman_density_1998IBclust

See Also

DIBmix, DIBcat

Examples

# Generate simulated continuous data
set.seed(123)
X <- matrix(rnorm(1000), ncol = 5)  # 200 observations, 5 features

# Run DIBcont with automatic bandwidth selection and multiple initializations
result <- DIBcont(X = X, ncl = 3, s = -1, nstart = 50)

# Print clustering results
print(result$Cluster)       # Cluster assignments
print(result$Entropy)       # Final entropy
print(result$MutualInfo)    # Mutual information

IBclust documentation built on Aug. 8, 2025, 6:39 p.m.