%0 Conference Paper %1 bhattacharjee2019relations %A Bhattacharjee, Robi %A Dasgupta, Sanjoy %D 2019 %K bounds geometry graphs mathematics readings %T What relations are reliably embeddable in Euclidean space? %U http://arxiv.org/abs/1903.05347 %X We consider the problem of embedding a relation, represented as a directed graph, into Euclidean space. For three types of embeddings motivated by the recent literature on knowledge graphs, we obtain characterizations of which relations they are able to capture, as well as bounds on the minimal dimensionality and precision needed.

@inproceedings{bhattacharjee2019relations, abstract = {We consider the problem of embedding a relation, represented as a directed graph, into Euclidean space. For three types of embeddings motivated by the recent literature on knowledge graphs, we obtain characterizations of which relations they are able to capture, as well as bounds on the minimal dimensionality and precision needed.}, added-at = {2019-11-27T15:11:52.000+0100}, author = {Bhattacharjee, Robi and Dasgupta, Sanjoy}, biburl = {https://www.bibsonomy.org/bibtex/2033026a62a65d3e31d5d1c5ac7edca21/kirk86}, description = {[1903.05347] What relations are reliably embeddable in Euclidean space?}, interhash = {5854f2779ec32cb69c782e35369bfa5c}, intrahash = {033026a62a65d3e31d5d1c5ac7edca21}, keywords = {bounds geometry graphs mathematics readings}, note = {cite arxiv:1903.05347Comment: submitted to COLT 2019}, timestamp = {2019-11-27T15:11:52.000+0100}, title = {What relations are reliably embeddable in Euclidean space?}, url = {http://arxiv.org/abs/1903.05347}, year = 2019 }