Properties of vector embeddings in social networks
From MaRDI portal
Publication:2633162
DOI10.3390/A10040109zbMATH Open1462.91017OpenAlexW2758602106MaRDI QIDQ2633162FDOQ2633162
Authors: Fatemeh Salehi Rizi, Michael Granitzer
Publication date: 8 May 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a10040109
Recommendations
Cites Work
- Visualizing data using t-SNE
- Statistical mechanics of complex networks
- On Information and Sufficiency
- Empirical Analysis of an Evolving Social Network
- Title not available (Why is that?)
- Clique partitions, graph compression and speeding-up algorithms
- Learning to rank on graphs
- Ranking of Closeness Centrality for Large-Scale Social Networks
- Topological features of online social networks
Cited In (6)
- Learning to correlate accounts across online social networks: an embedding-based approach
- An unsupervised framework for comparing graph embeddings
- Identifying structural hole spanners in social networks via graph embedding
- Unsupervised framework for evaluating structural node embeddings of graphs
- An independent cascade walking based node embedding approach
- Story embedding: learning distributed representations of stories based on character networks
Uses Software
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)