Skip to content

chihuanbin/multi-view-clustering

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

16 Commits
 
 
 
 
 
 

Repository files navigation

Multi-view Clustering

A categorization and reproduction for Multi-view Clustering(MvC).

Contents

Papers

MvC for consensus learning

These methods adopt different strategies to collect information effectively from each view. Indies of clustering performance (i.e. Accuracy, NMI) is mainly used to measure the quality of the model. In general, they are mainly based on matrix factorization, spectral-graph theory and others like kernel mapping and tensor rank constraint. Note that differences of these methods are reflected in the assumption on data distribution. Matrix factorization are applied to solve linear seperatable data, while spectral-graph theory and kernel mapping methods are good at handling non-linear ones.

Graph-based method

Spectral-based method

MvC for large-scale data

Incomplete MvC

Partial consensus Learning

Data completion

Performance

MvC for consensus learning

Mfeat Caltech101-7
Methods Acc NMI F-measure Acc NMI F-measure
SC_best 0.829 0.843 0.802 0.636 0.518 0.282
CLR_best 0.832 0.838 0.802 0.712 0.526 0.267
SwMC 0.858 0.888 0.838 0.651 0.582 0.319
PwMC 0.860 0.885 0.839 0.652 0.548 0.320
CAN_best 0.876 0.904 0.844 0.723 0.435 0.248
MLAN 0.952 0.913 0.954 0.816 0.550 0.379
Co-reg 0.964 0.931 0.964 0.651 0.550 0.308
AMGL 0.876 0.894 0.861 0.674 0.650 0.392

About

A repository for Multi-view Clustering.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages