CRAN/E | lsbclust

lsbclust

Least-Squares Bilinear Clustering for Three-Way Data

Installation

About

Functions for performing least-squares bilinear clustering of three-way data. The method uses the bilinear decomposition (or bi-additive model) to model two-way matrix slices while clustering over the third way. Up to four different types of clusters are included, one for each term of the bilinear decomposition. In this way, matrices are clustered simultaneously on (a subset of) their overall means, row margins, column margins and row-column interactions. The orthogonality of the bilinear model results in separability of the joint clustering problem into four separate ones. Three of these sub-problems are specific k-means problems, while a special algorithm is implemented for the interactions. Plotting methods are provided, including biplots for the low-rank approximations of the interactions.

Citation lsbclust citation info

Key Metrics

Version 1.1
R ≥ 3.5
Published 2019-04-15 1848 days ago
Needs compilation? yes
License GPL-2
License GPL-3
CRAN checks lsbclust results

Downloads

Yesterday 4 0%
Last 7 days 53 -32%
Last 30 days 220 +7%
Last 90 days 620 -22%
Last 365 days 2.592 -18%

Maintainer

Maintainer

Pieter Schoonees

schoonees@gmail.com

Authors

Pieter Schoonees

aut / cre

Patrick Groenen

ctb

Material

Reference manual
Package source

macOS

r-release

arm64

r-oldrel

arm64

r-release

x86_64

r-oldrel

x86_64

Windows

r-devel

x86_64

r-release

x86_64

r-oldrel

x86_64

Old Sources

lsbclust archive

Depends

R ≥ 3.5
stats
ggplot2

Imports

plyr
clue
grid
gridExtra
reshape2
Rcpp
mvtnorm
graphics
methods
doParallel
foreach
parallel

LinkingTo

Rcpp

Reverse Imports

ccrs