Nevin Manimala Statistics

Model-based clustering for random hypergraphs

Adv Data Anal Classif. 2022;16(3):691-723. doi: 10.1007/s11634-021-00454-7. Epub 2021 Jun 28.


A probabilistic model for random hypergraphs is introduced to represent unary, binary and higher order interactions among objects in real-world problems. This model is an extension of the latent class analysis model that introduces two clustering structures for hyperedges and captures variation in the size of hyperedges. An expectation maximization algorithm with minorization maximization steps is developed to perform parameter estimation. Model selection using Bayesian Information Criterion is proposed. The model is applied to simulated data and two real-world data sets where interesting results are obtained.

PMID:36043219 | PMC:PMC9418112 | DOI:10.1007/s11634-021-00454-7

By Nevin Manimala

Portfolio Website for Nevin Manimala