Bipartite Graph Embedding via Mutual Information Maximization.
Jiangxia Cao|Xixun Lin|Shu Guo|Luchen Liu|Tingwen Liu|Bin Wang
| Anthology ID: | DBLP:conf/wsdm/CaoLGLL021 |
|---|---|
| Volume: | WSDM '21, The Fourteenth ACM International Conference on Web Search and Data Mining, Virtual Event, Israel, March 8-12, 2021 |
| Year: | 2021 |
| Venue: | Web Search and Data Mining (WSDM) |
| Publisher: | ACM |
| Pages: | 635-643 |
| URL: | https://doi.org/10.1145/3437963.3441783 |
| DOI: | https://doi.org/10.1145/3437963.3441783 |
| DBLP: | conf/wsdm/CaoLGLL021 |
| BibTeX: |
@inproceedings{cao-2021-bipartite,
author = {Jiangxia Cao and
Xixun Lin and
Shu Guo and
Luchen Liu and
Tingwen Liu and
Bin Wang},
editor = {Liane Lewin-Eytan and
David Carmel and
Elad Yom-Tov and
Eugene Agichtein and
Evgeniy Gabrilovich},
title = {{Bipartite Graph Embedding via Mutual Information Maximization}},
booktitle = {{WSDM '21, The Fourteenth ACM International Conference on Web Search and Data Mining, Virtual Event, Israel, March 8-12, 2021}},
pages = {635--643},
publisher = {ACM},
year = {2021},
url = {https://doi.org/10.1145/3437963.3441783},
doi = {https://doi.org/10.1145/3437963.3441783}
}