The code for our paper ["Searching to Sparsify Tensor Decomposition for N-ary Relational Data"], which has been accepted by Webconf 2021.
Readers are welcomed to fork this repository to reproduce the experiments and follow our work. Please kindly cite our paper
@article{di2021searching,
title={Searching to Sparsify Tensor Decomposition for N-ary Relational Data},
author={Di, Shimin and Yao, Quanming and Chen, Lei},
journal={arXiv preprint arXiv:2104.10625},
year={2021}
}
Related AutoML papers (ML Research group in 4Paradigm)
- Efficient Relation-aware Scoring Function Search for Knowledge Graph Embedding paper, code
- Interstellar: Searching Recurrent Architecture for Knowledge Graph Embedding. NeurIPS 2020 paper, code
- AutoSF: Searching Scoring Functions for Knowledge Graph Embedding. ICDE 2020 paper, code
- Simple and Automated Negative Sampling for Knowledge Graph Embedding. ICDE 2019 paper, code