Automatic Dimension Selection for a Non-negative Factorization Approach to Clustering Multiple Random Graphs

06/24/2014
by   Nam H. Lee, et al.
0

We consider a problem of grouping multiple graphs into several clusters using singular value thesholding and non-negative factorization. We derive a model selection information criterion to estimate the number of clusters. We demonstrate our approach using "Swimmer data set" as well as simulated data set, and compare its performance with two standard clustering algorithms.

READ FULL TEXT
research
06/24/2014

Techniques for clustering interaction data as a collection of graphs

A natural approach to analyze interaction data of form "what-connects-to...
research
12/29/2013

A model selection approach for clustering a multinomial sequence with non-negative factorization

We consider a problem of clustering a sequence of multinomial observatio...
research
04/11/2016

Phase Transitions and a Model Order Selection Criterion for Spectral Graph Clustering

One of the longstanding open problems in spectral graph clustering (SGC)...
research
02/19/2022

Distributed non-negative RESCAL with Automatic Model Selection for Exascale Data

With the boom in the development of computer hardware and software, soci...
research
06/07/2022

Model selection for robust learning of mutational signatures using Negative Binomial non-negative matrix factorization

The spectrum of mutations in a collection of cancer genomes can be descr...
research
09/28/2021

Unsupervised Learning for Submarket Modeling: A Proxy for Neighborhood Change

This study focused on submarket modeling with unsupervised learning and ...
research
12/10/2020

Four algorithms to solve symmetric multi-type non-negative matrix tri-factorization problem

In this paper, we consider the symmetric multi-type non-negative matrix ...

Please sign up or login with your details

Forgot password? Click here to reset