pith. sign in

Here, ReLU(x) = max(0, x) is the element-wise ReLU activation function at x, and model parameters are collected intoϕ

+b 2 +b 3, 12 Decoder-only Clustering in Graphs with Dynamic Attributes where W1 ∈R h1×d,W 2 ∈R h2×h1, W3 ∈R n×h2 are weights, b1 ∈R h1×1,b 2 ∈R h2×1, b3 ∈R n×1 are bias parameters · 2018

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

fields

stat.ME 1

years

2025 1

verdicts

UNVERDICTED 1

representative citing papers

Decoder-only Clustering in Attributed Graphs

stat.ME · 2025-11-06 · unverdicted · novelty 5.0

A new method for nodal clustering in attributed graphs that combines low-dimensional node priors, a neural decoder, and graph-fused LASSO regularization on prior means, demonstrated via simulations on grid graphs and real data applications.

citing papers explorer

Showing 1 of 1 citing paper.

  • Decoder-only Clustering in Attributed Graphs stat.ME · 2025-11-06 · unverdicted · none · ref 5

    A new method for nodal clustering in attributed graphs that combines low-dimensional node priors, a neural decoder, and graph-fused LASSO regularization on prior means, demonstrated via simulations on grid graphs and real data applications.