LARS-research / AutoSF

Y. Zhang, Q. Yao, J. Kwok. Bilinear Scoring Function Search for Knowledge Graph Learning. TPAMI 2022
68 stars 12 forks source link
automl graph-embedding knowledge-graph

AutoSF

The code for our paper conference paper "AutoSF: Searching Scoring Functions for Knowledge Graph Embedding" in ICDE 2020 and the journal extension AutoSF+: "Bilinear Scoring Function Search for Knowledge Graph Learning" in TPAMI 2022.

News:

(2022.3) AutoSF+ has been accepted as a research paper in TPAMI!

(2021.4) AutoSF-OGB for Open Graph Benchmark is released.

Readers are welcomed to fork this repository to reproduce the experiments and follow our work. Please kindly cite our paper

@article{zhang2022bilinear,
      title={Bilinear Scoring Function Search for Knowledge Graph Learning},
      author={Zhang, Yongqi and Yao, Quanming and Kwok, James T},
      journal={IEEE Transactions on Pattern Analysis and Machine Intelligence},
      year={2022},
      publisher={IEEE}
}

Instructions

For the sake of ease, a quick instruction is given for readers to reproduce the whole process. Note that the programs are tested on Linux(Ubuntu release 16.04), Python 3.7 from Anaconda 4.5.11.

Install PyTorch (>0.4.0)

conda install pytorch -c pytorch

Get this repo

git clone https://github.com/yzhangee/AutoSF
cd AutoSF
tar -zvxf KG_Data.tar.gz 

Reproducing the searching/fine-tuning/evaluation procedure, please refer to the bash file "run.sh"

bash run.sh

Explaination of the searched SFs in the file "searched_SFs.txt":

You can also rely on the "evaluate.py" file to evaluate the searched SFs by manually setting the struct variable.

Related AutoML papers (ML Research group in 4Paradigm)