For each word in a given term, we obtain a vector of fixed size K (we choose K = 100).
we can then assume that we can minimize the error by finding the point where we derive this using identities proven in the Matrix Cookbook (Petersen et al., 2008), readers are recommended to refer to this text to better understand the derivation here: : we can easily find a matrix V + that satisfies 5 V In particular this can be achieved by using the singular value decomposition of V in order to find Such that Σ is a diagonal matrix and the following hold It is clear that a solution to find A is: To obtain the A matrix, we used all but one of the taxonomies as training data and evaluated on the rest of the taxonomies.