A new method for node classification in multiplex graphs adapts to mixed homophily and heterophily per dimension via compatibility matrices and Chebyshev-approximated product filters optimized with proximal gradients.
Hierarchical aggregations for high-dimensional multiplex graph embedding.IEEE Transactions on Knowledge and Data Engineering, 36(4):1624–1637
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Modeling Heterophily in Multiplex Graphs: An Adaptive Approach for Node Classification
A new method for node classification in multiplex graphs adapts to mixed homophily and heterophily per dimension via compatibility matrices and Chebyshev-approximated product filters optimized with proximal gradients.