default search action
Huda Hakami
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c7]Huda Hakami, Mona Hakami, Angrosh Mandya, Danushka Bollegala
:
Learning to Borrow- Relation Representation for Without-Mention Entity-Pairs for Knowledge Graph Completion. NAACL-HLT 2022: 2887-2898 - [i4]Huda Hakami, Mona Hakami, Angrosh Mandya, Danushka Bollegala:
Learning to Borrow - Relation Representation for Without-Mention Entity-Pairs for Knowledge Graph Completion. CoRR abs/2204.13097 (2022) - 2021
- [c6]Danushka Bollegala
RelWalk - A Latent Variable Model Approach to Knowledge Graph Embedding. EACL 2021: 1551-1565 - [i3]Danushka Bollegala
RelWalk A Latent Variable Model Approach to Knowledge Graph Embedding. CoRR abs/2101.10070 (2021) - 2020
- [b1]Huda Hakami:
A study on learning representations for relations between words. University of Liverpool, UK, 2020
2010 – 2019
- 2019
- [c5]Huda Hakami, Danushka Bollegala:
Learning Relation Representations from Word Representations. AKBC 2019 - [c4]Wenye Chen, Huda Hakami, Danushka Bollegala
Learning to Compose Relational Embeddings in Knowledge Graphs. PACLING 2019: 56-66 - [c3]Huda Hakami, Danushka Bollegala
Context-Guided Self-supervised Relation Embeddings. PACLING 2019: 67-78 - 2018
- [c2]Huda Hakami, Kohei Hayashi, Danushka Bollegala:
Why does PairDiff work? - A Mathematical Analysis of Bilinear Relational Compositional Operators for Analogy Detection. COLING 2018: 2493-2504 - 2017
- [j2]Huda Hakami, Danushka Bollegala
Compositional approaches for representing relations between words: A comparative study. Knowl. Based Syst. 136: 172-182 (2017) - [j1]Huda Hakami, Danushka Bollegala
A classification approach for detecting cross-lingual biomedical term translations. Nat. Lang. Eng. 23(1): 31-51 (2017) - [c1]Huda Hakami
Discovering Representative Space for Relational Similarity Measurement. PACLING 2017: 76-87 - [i2]Huda Hakami, Danushka Bollegala
Compositional Approaches for Representing Relations Between Words: A Comparative Study. CoRR abs/1709.01193 (2017) - [i1]Huda Hakami, Kohei Hayashi, Danushka Bollegala
An Optimality Proof for the PairDiff operator for Representing Relations between Words. CoRR abs/1709.06673 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: