Bipartite Graph Embedding via Mutual Information Maximization

Research article (Proceedings of the 14th ACM International Conference on Web Search and Data Mining, 2021) · cited 118× · AI/ML
Press Enter · cited answer in seconds

Bipartite Graph Embedding via Mutual Information Maximization

Summary

Bipartite Graph Embedding via Mutual Information Maximization is a scholarly article[1].

Key Facts

  • Bipartite Graph Embedding via Mutual Information Maximization's instance of is recorded as scholarly article[2].

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Bipartite Graph Embedding via Mutual Information Maximization. Retrieved May 24, 2026, from https://4ort.xyz/entity/bipartite-graph-embedding-via-mutual-information-maximization
MLA “Bipartite Graph Embedding via Mutual Information Maximization.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/bipartite-graph-embedding-via-mutual-information-maximization.
BibTeX @misc{4ortxyz_bipartite-graph-embedding-via-mutual-information-maximization_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Bipartite Graph Embedding via Mutual Information Maximization}}, year = {2026}, url = {https://4ort.xyz/entity/bipartite-graph-embedding-via-mutual-information-maximization}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Bipartite Graph Embedding via Mutual Information Maximization — https://4ort.xyz/entity/bipartite-graph-embedding-via-mutual-information-maximization (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/bipartite-graph-embedding-via-mutual-information-maximization · Last refreshed: