Corpus ID: 88519839

Resolution-limit-free and local Non-negative Matrix Factorization quality functions for graph clustering

@article{Laarhoven2014ResolutionlimitfreeAL,
  title={Resolution-limit-free and local Non-negative Matrix Factorization quality functions for graph clustering},
  author={Twan van Laarhoven and Elena Marchiori},
  journal={arXiv: Machine Learning},
  year={2014}
}
Many graph clustering quality functions suffer from a resolution limit, the inability to find small clusters in large graphs. So called resolution-limit-free quality functions do not have this limit. This property was previously introduced for hard clustering, that is, graph partitioning. We investigate the resolution-limit-free property in the context of Non-negative Matrix Factorization (NMF) for hard and soft graph clustering. To use NMF in the hard clustering setting, a common approach is… Expand

Figures from this paper