Jay98的博客

Multi-Partition Embedding Interaction with Block Term Format for Knowledge Graph Completion

NePTuNe:Neural Powered Tucker Network for Knowledge Graph Completion

TuckER: Tensor Factorization for Knowledge Graph Completion

Modeling Relation Paths for Representation Learning of Knowledge Bases

A Three-Way Model for Collective Learning on Multi-Relational Data

EMBEDDING ENTITIES AND RELATIONS FOR LEARNING AND INFERENCE IN KNOWLEDGE BASES

Learning to Represent Knowledge Graphs with Gaussian Embedding

TransA: An Adaptive Approach for Knowledge Graph Embedding

Knowledge Graph Embedding via Dynamic Mapping Matrix

Learning Entity and Relation Embeddings for Knowledge Graph Completion

Knowledge Graph Embedding by Translating on Hyperplanes

Translating Embeddings for Modeling Multi-relational Data

#include <iostream>#include <cstring>#include <algorithm>using namespace std;#define MANV 30005int parent[MANV];int find(int x){ if(parent[x]==x) return x; else{ parent[x]=find(parent[x]); return par

AC代码：#include <iostream>#include <cstring>#include <algorithm>#include <map>using namespace std;int main(){ int n; cin>>n; cin.get(); string c; map<string,int> TIME; for(int i=0;i<n;i++

方法一：#include <iostream>#include <cstring>#include <algorithm>using namespace std;char pre[51],in[51];int n;int fun(int t,int low,int high){ if(low>=high) return 1; else { int mid=0; for(int i=low

#include <iostream>#include <cstring>#include <algorithm>#include <stack>using namespace std;int main(){ int n1,n2,t; cin>>n1>>n2; if(n1>n2) swap(n1,n2); n1--; n2--; int s1[100],t

#include <iostream>#include <cstring>#include <algorithm>#include <stack>using namespace std;int main(){ char a[31]; cin.getline(a,31); stack<double> num; stack<char> sym; int len=strlen(a);

代码：#include <iostream>#include <cstring>#include <algorithm>#include <stack>using namespace std;int level(char c){ if(c=='+'||c=='-') return 1; else return 2;}int main(){ char a[21]; cin>

#include <iostream>#include <cstring>#include <algorithm>using namespace std;void fun(int n,char a,char b,char c){ if(n==1){ printf("%c -> %c
",a,c); } else{ fun(n-1,a,c,b); printf("%c -> %c