Signed network representation with novel node proximity evaluation
The paper studies signed network representation with novel node proximity evaluation. The paper attempts to generalize the basic distance metric average first-passage time to signed networks and investigates the theoretical foundation of signed average first-passage time and its analytical solution. Three node proximity metrics are proposed based on signed average first-passage time. A signed network representation method is designed to preserve the proposed node proximity. Experiments on some real-world datasets are performed to illustrate the method on two downstream tasks.
- Survey of signed network research
- Network modelling and variational Bayesian inference for structure analysis of signed networks
- Signed network prediction based on structural balance theory and LP algorithm
- Dynamics over signed networks
- Prediction and clustering in signed networks: a local to global perspective
- A simple generalisation of the area under the ROC curve for multiple class classification problems
- Asymptotic stability and generalized Gelfand spectral radius formula
- Generalized inverses. Theory and applications.
- Hitting and commute times in large random neighborhood graphs
- scientific article; zbMATH DE number 1460605 (Why is no real title available?)
- Low-complexity Graph Sampling With Noise and Signal Reconstruction via Neumann Series
- Markov Chains
This page was built for publication: Signed network representation with novel node proximity evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6072446)
