| 21-01-2021 |
Reasoning over knowledge graphs using vector embeddings
Knowledge graphs are one of the hottest topics in artificial intelligence today as they allow increasing the reasoning capabilities of neural networks. Extracting information from these graphs is complex, but this year new techniques have been presented to do it efficiently through machine learning techniques using vector embeddings. We want to study algorithmically robust and optimal ways to carry out this process based on the state of the art of data structures and algorithms.
Prerequisites:
IIC2133
Evaluation method: Nota 1-7, with 0/1 available vacants |
Mentor(s): Open in the plataform |
| 17-01-2020 |
Automatic constraint satisfaction problems
Study of decidability in infinite constraint satisfaction problems (CSP), with a focus in the automatic case: understanding basic concepts, collecting bibliography, learning about state-of-the-art.
Prerequisites:
None.
Evaluation method: Nota 1-7, with 0/1 available vacants |
Mentor(s): Open in the plataform |
| 03-07-2019 |
Keywords:
grafo
Prerequisites:
IIC2233
Evaluation method: Nota 1-7, with 0/4 available vacants |
Mentor(s): Open in the plataform |