Pular para o conteúdo principal

KGTK Tutorial @ ISWC'21 - 24 de Outubro

Links 

https://usc-isi-i2.github.io/kgtk-tutorial-iswc-2021/

https://iswc2021.semanticweb.org/tutorial-schedule

 

Programa

Introduction to the KGs and available KG toolkits

Basic KGTK
Introduction to KGTK file format and basic commands
Hands-on: importing (Wikidata, DBpedia), filtering, combining graphs, deployment, exporting

Advanced KGTK
Introduction to KGTK advanced functionalities
Hands-on: Kypher, embeddings, centrality, paths

Use cases part I
Use case 1: Building a Commonsense Knowledge Graph
Use case 2: Analysis of all 300+ dumps of Wikidata
    
Use cases part II & Discussion
Use case 3: Enriching Wikidata with Excel Spreadsheets & Web Tables
Wrap-up and discussion

Comentários

  1. Preciso acompanhar quando abre as inscrições

    ResponderExcluir
    Respostas
    1. Registration is now open for this year’s virtual conference, ISWC 2021, October 26 – 28, with Workshops and Tutorials scheduled for October24 and 25.

      Please go to iswc2021.semanticweb.org to register! The program is still being sorted out and will appear as quickly as possible.

      The main blocks are:

      Oct 24 and 25 – Workshops and Tutorials

      Oct 26 – 28 – Main Program with Keynotes at the start of each day followed by sessions from all tracks.

      Meantime, please visit the Accepted Papers link in the Program menu to see what’s happening this year!

      Please spread the word!

      Thanks
      Kathy (Local Organizing Chair)

      Excluir
    2. 50 doláres, 300 reais somente para o tutorial.

      Excluir
  2. Since some asked, here is a summary of all the resources:
    Hands-on materials: https://github.com/usc-isi-i2/kgtk-notebooks/
    Colab Notebooks: https://github.com/usc-isi-i2/kgtk-notebooks#running-the-notebooks-in-google-colab
    Slides: https://github.com/usc-isi-i2/kgtk-notebooks/tree/main/slides
    KGTK documentation: https://kgtk.readthedocs.io/
    Similarity GUI: https://kgtk.isi.edu/similarity/
    KGTK Search: https://kgtk.isi.edu/search/
    KGTK Browser: https://kgtk.isi.edu/iswc/browser/Q2685
    Resource paper (ESWC'20): https://arxiv.org/pdf/2006.00088.pdf
    KGTK on GitHub: https://github.com/usc-isi-i2/kgtk/ (edited)

    ResponderExcluir
    Respostas
    1. Fiz os testes com os notebooks no Goggle Colab e salvei no meu GitHub. Ainda preciso entender melhor o notebook 03 sobre embeddings.

      Excluir
    2. A etapa de Link Prediction do notebook 03 só funciona com o algoritmo ComplEx. Tentei com DistMult, TransE e RESCAL e não se adequa. Os demais passos de geração dos embeddings e do calculo de similaridade (usando gensim) entendi.

      Excluir

Postar um comentário

Sinta-se a vontade para comentar. Críticas construtivas são sempre bem vindas.

Postagens mais visitadas deste blog

Aula 12: WordNet | Introdução à Linguagem de Programação Python *** com NLTK

 Fonte -> https://youtu.be/0OCq31jQ9E4 A WordNet do Brasil -> http://www.nilc.icmc.usp.br/wordnetbr/ NLTK  synsets = dada uma palavra acha todos os significados, pode informar a língua e a classe gramatical da palavra (substantivo, verbo, advérbio) from nltk.corpus import wordnet as wn wordnet.synset(xxxxxx).definition() = descrição do significado É possível extrair hipernimia, hiponimia, antonimos e os lemas (diferentes palavras/expressões com o mesmo significado) formando uma REDE LEXICAL. Com isso é possível calcular a distância entre 2 synset dentro do grafo.  Veja trecho de código abaixo: texto = 'útil' print('NOUN:', wordnet.synsets(texto, lang='por', pos=wordnet.NOUN)) texto = 'útil' print('ADJ:', wordnet.synsets(texto, lang='por', pos=wordnet.ADJ)) print(wordnet.synset('handy.s.01').definition()) texto = 'computador' for synset in wn.synsets(texto, lang='por', pos=wn.NOUN):     print('DEF:',s

truth makers AND truth bearers - Palestra Giancarlo no SBBD

Dando uma googada https://iep.utm.edu/truth/ There are two commonly accepted constraints on truth and falsehood:     Every proposition is true or false.         [Law of the Excluded Middle.]     No proposition is both true and false.         [Law of Non-contradiction.] What is the difference between a truth-maker and a truth bearer? Truth-bearers are either true or false; truth-makers are not since, not being representations, they cannot be said to be true, nor can they be said to be false . That's a second difference. Truth-bearers are 'bipolar,' either true or false; truth-makers are 'unipolar': all of them obtain. What are considered truth bearers?   A variety of truth bearers are considered – statements, beliefs, claims, assumptions, hypotheses, propositions, sentences, and utterances . When I speak of a fact . . . I mean the kind of thing that makes a proposition true or false. (Russell, 1972, p. 36.) “Truthmaker theories” hold that in order for any truthbe

DGL-KE : Deep Graph Library (DGL)

Fonte: https://towardsdatascience.com/introduction-to-knowledge-graph-embedding-with-dgl-ke-77ace6fb60ef Amazon recently launched DGL-KE, a software package that simplifies this process with simple command-line scripts. With DGL-KE , users can generate embeddings for very large graphs 2–5x faster than competing techniques. DGL-KE provides users the flexibility to select models used to generate embeddings and optimize performance by configuring hardware, data sampling parameters, and the loss function. To use this package effectively, however, it is important to understand how embeddings work and the optimizations available to compute them. This two-part blog series is designed to provide this information and get you ready to start taking advantage of DGL-KE . Finally, another class of graphs that is especially important for knowledge graphs are multigraphs . These are graphs that can have multiple (directed) edges between the same pair of nodes and can also contain loops. The