Properties of vector embeddings in social networks
From MaRDI portal
Publication:2633162
Recommendations
Cites work
- scientific article; zbMATH DE number 867339 (Why is no real title available?)
- Clique partitions, graph compression and speeding-up algorithms
- Empirical Analysis of an Evolving Social Network
- Learning to rank on graphs
- On Information and Sufficiency
- Ranking of Closeness Centrality for Large-Scale Social Networks
- Statistical mechanics of complex networks
- Topological features of online social networks
- Visualizing data using t-SNE
Cited in
(6)- Story embedding: learning distributed representations of stories based on character networks
- Identifying structural hole spanners in social networks via graph embedding
- Learning to correlate accounts across online social networks: an embedding-based approach
- Unsupervised framework for evaluating structural node embeddings of graphs
- An unsupervised framework for comparing graph embeddings
- An independent cascade walking based node embedding approach
This page was built for publication: Properties of vector embeddings in social networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2633162)