atlas

Research map / Graph learning / Graph algorithms and clustering

Incorporating Network Embedding into Markov Random Field for Better Community Detection

AAAI 2019 · Graph learning › Graph algorithms and clustering · approach: Neural and local graph clustering · 44 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
wrap network embedding (Node2Vec) in an MRF frameworkNode2Vec / DeepWalk / MNMF + k-means · 12 real networksNMIHelped
wrap network embedding in an MRF frameworkembedding methods · 12 real networksmisclassified significant nodes (RER)Helped
wrap embedding in MRF frameworkembedding methods · 20 real networksruntimeHurt
use MRF-N instead of NetMRFNetMRF · PubMedNMI: 16.89 -> 30.02Helped
use MRF-N instead of NetMRFNetMRF · CoraNMI: 37.24 -> 41.01Helped
use MRF-M instead of NetMRFNetMRF · UAI2010NMI: 25.76 -> 28.30Hurt
use MRF-N instead of NetMRFNetMRF · Metabolicmodularity Q: 0.4579 -> 0.4119Hurt
use MRF-N instead of NetMRFNetMRF · Powermodularity Q: 0.9266 -> 0.9207Hurt
use MRF-N instead of DNR-L2 baselineDNR · CoraNMI: 46.3 -> 41.01Hurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy