Implicit consensus clustering from multiple graphs

DOI10.1007/S10618-021-00788-YMaRDI QIDQ2066641zbMATH OpenOpenAlexFDO

Authors Rafika Boutalbi, Lazhar Labiod, M. Nadif

Publication date 14 January 2022

Published in Data Mining and Knowledge Discovery (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10618-021-00788-y

zbMATH Keywords

co-clusteringconsensusmultiple graphsthree-way data

Mathematics Subject Classification ID

Probabilistic graphical models (62H22) Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Recommendations

• Block spectral clustering methods for multiple graphs.
• Latent Clustering on Graphs with Multiple Edge Types
• Clustering data that are graph connected
• Multiple graphs clustering by gradient flow method
• Auto-weighted multi-view co-clustering with bipartite graphs

Cites work

• 10.1162/153244303321897735
• A classification EM algorithm for clustering and two stochastic versions
• Advances in Intelligent Data Analysis VI
• Block spectral clustering methods for multiple graphs.
• Clustering for binary data and mixture models—choice of the model
• Directional co-clustering
• Estimation and Prediction for Stochastic Blockstructures
• Finite mixture models
• scientific article; zbMATH DE number 6381735 (Why is no real title available?)
• scientific article; zbMATH DE number 3466361 (Why is no real title available?)
• scientific article; zbMATH DE number 3567782 (Why is no real title available?)
• scientific article; zbMATH DE number 1222290 (Why is no real title available?)
• scientific article; zbMATH DE number 2107182 (Why is no real title available?)
• Learning from multiple sources
• Mutual information, phi-squared and model-based co-clustering for contingency tables
• PARAFAC: Parallel factor analysis
• Poisson convergence and Poisson processes with applications to random graphs
• Regularized bi-directional co-clustering
• Tensor Decompositions and Applications
• The boosting approach to machine learning: an overview

Cited in

(4)

• Multiple graphs clustering by gradient flow method
• Latent Clustering on Graphs with Multiple Edge Types
• A Deep Dynamic Latent Block Model for Co-clustering of Zero-Inflated Data Matrices
• Unsupervised learning from attributed networks

Describes a project that uses

Uses Software

• PARAFAC
• k-means++
• CoClust
• ca

This page was built for publication: Implicit consensus clustering from multiple graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2066641)