atlas

Research map / Learning theory and algorithms / Clustering

CoDiNMF: Co-Clustering of Directed Graphs via NMF

AAAI 2018 · Learning theory and algorithms › Clustering · approach: Correlation clustering · 6 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
add directed subgraphs (Z, S) and net-flow term to co-clustering (ablation)CoDiNMF (vs CoNMF) · US patent A22average F1: 0.242 -> 0.367Helped
add directed subgraphs and net-flow term (ablation)CoDiNMF (vs CoNMF) · US patent B68adjusted Rand index: 0.239 -> 0.275Helped
add directed subgraphs and net-flow term (ablation)CoDiNMF (vs CoNMF) · BlogCatalogaverage F1: 0.249 -> 0.262Helped
add directed subgraphs and net-flow term (ablation)CoDiNMF (vs CoNMF) · US patent A22Rand index: 0.976 -> 0.979No clear effect
use nonzero lambda for net-directional-flow term (ablation)CoDiNMF · US patent C14F1 and ARIHelped
replace spectral co-clustering with NMF-based method on directed graphsCoDiNMF (vs SCo) · US patent A22average F1: 0.124 -> 0.367Helped
use net-flow control term in philosopher co-clustersCoDiNMF · Wikipedia philosophersproportion of cluster pairs with clear net flowHelped

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