@inbook {920,
	title = {Reducing the Rank in Relational Factorization Models by Including Observable Patterns},
	booktitle = {Advances in Neural Information Processing Systems 27},
	year = {2014},
	pages = {1179{\textendash}1187},
	publisher = {Curran Associates, Inc.},
	organization = {Curran Associates, Inc.},
	abstract = {<div>Tensor factorization has become a popular method for learning from multi-relational data. In this context, the rank of the factorization is an important parameter that determines runtime as well as generalization ability. To identify conditions under which factorization is an efficient approach for learning from relational data,we derive upper and lower bounds on the rank required to recover adjacency tensors.Based on our findings, we propose a novel additive tensor factorization modelto learn from latent and observable patterns on multi-relational data and present</div>

<div>a scalable algorithm for computing the factorization. We show experimentallyboth that the proposed additive model does improve the predictive performanceover pure latent variable methods and that it also reduces the required rank {\textemdash} andtherefore runtime and memory complexity {\textemdash} significantly.</div>
},
	url = {http://papers.nips.cc/paper/5448-reducing-the-rank-in-relational-factorization-models-by-including-observable-patterns.pdf},
	author = {Maximilian Nickel and Jiang, Xueyan and Volker Tresp}
}
