5 papers
QuatE-D: A Distance-Based Quaternion Model for Knowledge Graph Embedding
Hamideh-Sadat Fazael-Ardakani, Hamid Soltanian-Zadeh
Knowledge graph embedding (KGE) methods aim to represent entities and relations in a continuous space while preserving their structural and semantic properties. Quaternion-based KG…
Subspace-Informed Matrix Completion
Hamideh. Sadat Fazael Ardakani, Sajad Daei, Arash Amini +2
In this work, we consider the matrix completion problem, where the objective is to reconstruct a low-rank matrix from a few observed entries. A commonly employed approach involves…
Multi-weight Matrix Completion with Arbitrary Subspace Prior Information
Hamideh. Sadat Fazael Ardakani, Niloufar Rahmani, Sajad Daei
Matrix completion refers to completing a low-rank matrix from a few observed elements of its entries and has been known as one of the significant and widely-used problems in recent…
Multi-weight Nuclear Norm Minimization for Low-rank Matrix Recovery in Presence of Subspace Prior Information
Hamideh Sadat Fazael Ardakani, Sajad Daei, Farzan Haddadi
Weighted nuclear norm minimization has been recently recognized as a technique for reconstruction of a low-rank matrix from compressively sampled measurements when some prior infor…
A Greedy Algorithm for Matrix Recovery with Subspace Prior Information
Hamideh. S Fazael Ardakani, Sajad Daei, Farzan Haddadi
Matrix recovery is the problem of recovering a low-rank matrix from a few linear measurements. Recently, this problem has gained a lot of attention as it is employed in many applic…