• Refine your search:
  • 
    Keyword
  • 
    Creator / Publisher:
    
    • Bollegala, Danushka (3)
    • Mandya, Angrosh (3)
    • Coenen, Frans (2)
    • Bel, Núria (1)
    • Hakami, Huda (1)
    • Hakami, Mona (1)
    • Scott, Donia (1)
    • The 28th International Conference on Computational Linguistics 2020 (1)
    • Zong, Chengqing (1)
  • 
    Year:
    
    • 2022 (1)
    • 2020 (2)
  • 
    Medium:
    
    • Online (3)
  • 
    Type
  • 
    BLLDB-Access

Search in the Catalogues and Directories

All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year Sort by creator [A → Z]' creator [Z → A]' publishing year ↑ (asc)' publishing year ↓ (desc)' title [A → Z]' title [Z → A]' Simple Search Hits 1 – 3 of 3 1 Learning to Borrow -- Relation Representation for Without-Mention Entity-Pairs for Knowledge Graph Completion ... Hakami, Huda; Hakami, Mona; Mandya, Angrosh. - : arXiv, 2022 BASE Show details 2 Graph Convolution over Multiple Dependency Sub-graphs for Relation Extraction ... The 28th International Conference on Computational Linguistics 2020; Bollegala, Danushka; Coenen, Frans; Mandya, Angrosh. - : Underline Science Inc., 2020 Abstract: We propose in this paper a contextualised graph convolution network over multiple dependency sub-graphs for relation extraction. A novel method to construct multiple sub-graphs using words in shortest dependency path and words linked to entities in the dependency graph is proposed. Graph convolution operation is performed over the resulting multiple sub-graphs to obtain more informative features useful for relation extraction. Our experimental results show that the proposed method achieves superior performance over existing GCN-based models achieving state-of-the-art performance on cross-sentence n-ary relation extraction and SemEval 2010 Task 8 sentence-level relation extraction task. Our model also achieves a comparable performance to the SoTA on the TACRED dataset. ... Keyword: Computer and Information Science; Information and Knowledge Engineering; Intelligent System; Natural Language Processing; Neural Network URL: https://underline.io/lecture/9015-graph-convolution-over-multiple-dependency-sub-graphs-for-relation-extraction https://dx.doi.org/10.48448/ef5g-9703 BASE Hide details 3 Graph Convolution over Multiple Dependency Sub-graphs for Relation Extraction. Mandya, Angrosh; Coenen, Frans; Bollegala, Danushka. - : International Committee on Computational Linguistics, 2020 BASE Show details

Mobile view All Catalogues UB Frankfurt Linguistik 0 IDS Mannheim 0 OLC Linguistik 0 UB Frankfurt Retrokatalog 0 DNB Subject Category Language 0 Institut für Empirische Sprachwissenschaft 0 Leibniz-Centre General Linguistics (ZAS) 0 Bibliographies BLLDB 0 BDSL 0 IDS Bibliografie zur deutschen Grammatik 0 IDS Bibliografie zur Gesprächsforschung 0 IDS Konnektoren im Deutschen 0 IDS Präpositionen im Deutschen 0 IDS OBELEX meta 0 MPI-SHH Linguistics Collection 0 MPI for Psycholinguistics 0 Linked Open Data catalogues Annohub 0 Online resources Link directory 0 Journal directory 0 Database directory 0 Dictionary directory 0 Open access documents BASE 3 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0