Unofficial Python implementation of the DNMF overlapping community detection algorithm
Project description
DNMF
Unofficial Python implementation of the Discrete Non-negative Matrix Factorization (DNMF) overlapping community detection algorithm
Paper
Ye, Fanghua, Chuan Chen, Zibin Zheng, Rong-Hua Li, and Jeffrey Xu Yu. 2019. “Discrete Overlapping Community Detection with Pseudo Supervision.” In 2019 IEEE International Conference on Data Mining (ICDM), 708–17. https://doi.org/10.1109/ICDM.2019.00081.
Requirements
python>=3.7.1
torch>=1.9.1
Quick start
-
To install the package run one of the two commands:
python -m pip install dnmf-python
(installation from PyPI)python setup.py install
(compile from source, if cloned the repository)
-
To run the algorithm, load the graph adjacency matrix into a
torch.FloatTensor
(for ex.A
), then call:from dnmf.DNMF import DNMF dnmf = DNMF() F = dnmf(A)
-
To run a quick test of the algorithm with an example graph, run
python src/test.py
Config
The DNMF module supports the following hyperparameters as arguments:
alpha
: tradeoff parameter for the U-subproblembeta
: tradeoff parameter for the F-subproblemgamma
: regularization parameterk
: desired number of overlapping communitiesnum_outer_iter
: number of iterations for the outer loop (SDP iterations)num_inner_iter
: number of iterations for the inner loops (U and F subproblems)
Author
Andrej Janchevski
EPFL STI IEM LIONS
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Hashes for dnmf_python-0.0.1-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | d5dbb9a3a52ddc7fa09bd4cf3ec819717d5433ec6da6b7b35c72c6c2e23497b9 |
|
MD5 | 1fec727fb210f3e6254fb91973f59bb1 |
|
BLAKE2b-256 | 33bff2e1b664f8ace538327c6509582f4df1c620787794796b42ef2920ab761c |