 | Up a level |
Hakami, Huda and Bollegala, Danushka 
ORCID: 0000-0003-4476-7003
(2017)
Compositional approaches for representing relations between words: A comparative study.
KNOWLEDGE-BASED SYSTEMS, 136.
172 - 182.
Hakami, Huda and Bollegala, Danushka ORCID: 0000-0003-4476-7003
(2017)
Compositional approaches for representing relations between words: A comparative study.
Knowl.-Based Syst., 136.
172 - 182.
Hakami, Huda and Bollegala, Danushka ORCID: 0000-0003-4476-7003
(2020)
Context-Guided Self-supervised Relation Embeddings.
In: International Conference of the Pacific Association for Computational Linguistics, 2019-10-11 - 2019-10-13, Hanoi, Vietnam.
Hakami, Huda, Mandya, Angrosh and Bollegala, Danushka ORCID: 0000-0003-4476-7003
(2018)
Discovering Representative Space for Relational Similarity Measurement.
.
Chen, Wenye, Hakami, Huda and Bollegala, Danushka ORCID: 0000-0003-4476-7003
(2020)
Learning to Compose Relational Embeddings in Knowledge Graphs.
In: International Conference of the Pacific Association for Computational Linguistics, 2019-10-11 - 2019-10-13, Hanoi, Vietnam.
Hakami, Huda, Hayashi, Kohei and Bollegala, Danushka ORCID: 0000-0003-4476-7003
(2018)
An Optimality Proof for the PairDiff operator for Representing Relations between Words.
CoRR, abs/17.
Bollegala, Danushka ORCID: 0000-0003-4476-7003, Hakami, Huda, Yoshida, Yuichi and Kawarabayashi, Ken-ichi
(2021)
RelWalk - A Latent Variable Model Approach to Knowledge Graph Embedding.
.
Hakami, Huda
(2020)
A Study on Learning Representations for Relations Between Words.
PhD thesis, University of Liverpool.
Hakami, Huda, Bollegala, Danushka ORCID: 0000-0003-4476-7003 and Kohei, Hayashi
(2018)
Why PairDiff works? -- A Mathematical Analysis of Bilinear Relational Compositional Operators for Analogy Detection.
Proceedings of International Conference on Computational Linguistics.