REM: From Structural Entropy to Community Structure Deception

Authors: Yiwei Liu, Jiamou Liu, Zijian Zhang, Liehuang Zhu, Angsheng Li

NeurIPS 2019 | Conference PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Experimental Experimental results over 9 real-world networks and 6 community detection algorithms show that REM is very effective in obfuscating the community structure as compared to other benchmark methods.
Researcher Affiliation Academia 1School of Computer Science & Technology, Beijing Institute of Technology, Beijing 100081, China 2Institute of Cyberspace Research, Zhejiang University, Zhejiang 310027, China 3School of Computer Science, The University of Auckland, Auckland 1142, New Zealand 4School of Computer Science, Beihang University, Beijing 100083, China
Pseudocode Yes Algorithm 1: An efficient REM deceptor
Open Source Code No The paper does not contain any explicit statement or link indicating that the source code for their methodology is publicly available.
Open Datasets Yes We evaluate the performance of our algorithm over 9 real-world networks from [http: //konect.uni-koblenz.de/].
Dataset Splits No The paper mentions the use of real-world networks but does not provide specific train/validation/test split percentages, sample counts, or explicit splitting methodology for the datasets.
Hardware Specification Yes Trials are conducted on a Server Xeon(skylake) platnum 8163 cpu 2.5GHz (12 cores, non-parallel computing) and 16GBs RAM
Software Dependencies No The paper mentions the use of community detection algorithms and refers to them by name, but it does not specify any software names with version numbers (e.g., Python version, specific library versions like PyTorch or TensorFlow).
Experiment Setup Yes Due to varying graph sizes, we set k = 20 for Dol; k = 1000 for Jaz, Eml, Fbk, Pow; k = 2000 for PGP; k = 10000 for CAI, Bri; and k = 20000 for Liv.