Pesquisa de Doutorado da Veronica

https://dl.acm.org/doi/pdf/10.1145/3543507.3583316 Lihui Liu, Yuzhong Chen, Mahashweta Das, Hao Yang, and Hanghang Tong. 2023. Knowledge Graph Question Answering with Ambiguous Query. In Proceedings of the ACM Web Conference 2023 (WWW '23). Association for Computing Machinery, New York, NY, USA, 2477–2486. https://doi.org/10.1145/3543507.3583316 Abs -> 1 -> 6 -> 2 -> 5 -> 4 -> 3 ABSTRACT In the vast majority of the existing works, the input queries are considered perfect and can precisely express the user’s query intention. However, in reality, input queries might be ambiguous and elusive which only contain a limited amount of information. [Consultas em palavras chaves? Consultas como perguntas "completas"? Consultas em liguagem GQL?] [Na minha pesquisa consideramos que as consultas, de qualquer tipo, são potencialmente incompletas em relação ao contexto (implícito) uma vez que o próprio usuário / aplicação pode desconhecer o contexto que se aplica ás al...

ABSTRACT: Inductive Logic Programming (ILP) can be used to mine logical rules from the KB. These rules can help deduce and add missing knowledge to the KB. While ILP is a mature field, mining logical rules from KBs is different in two aspects: First, current rule mining systems are easily overwhelmed by the amount of data .... Second, ILP usually requires counterexamples. KBs, however, implement the open world assumption (OWA), meaning that absent data cannot be used as counterexamples.    [Mesmo problema de algortimos de ML para Link Prediction] 1. INTRODUCTION   Making these KBs complete requires great effort to extract facts, check them for correctness, and add them to the KB. However, KBs themselves often already contain enough information to derive and add new facts. ... As for any rule, there can be exceptions, but in the vast majority of cases, the rule will hold. [Mesmo que as regras não prevejam todos os fatos corretamente pois há exceções ainda é válido para a m...