Heterogeneous Embedding via Aggregating Multiple Sources

Abstract

Aggregating multiple correlated data sources may help improve the learning performance of a given task. For example, in recommendation problems, one can aggregate (1) user profile database (e.g., genders, age, etc.), (2) users’ log data (e.g., clickthrough data, purchasing records, etc), and (3) users’ social network (useful in social targeting) to build a recommendation model. All these data sources provide informative but heterogeneous features. For instance, user profile database usually has nominal features reflecting users’ background, log data provides term-based features about users’ historical behaviors, and social network database has graph relational features. Given multiple heterogeneous data sources, one important challenge is to find a unified embedding feature subspace that captures the knowledge from all sources. To this aim, we propose a principle of collective component analysis (CoCA), in order to find the optimal embedding across a mixture of vector-based features and graph relational features. The CoCA principle is to find a feature subspace with maximal variance under two constraints. First, there should be consensus among the projections from different feature spaces. Second, the similarity between connected data (in any of the network databases) should be maximized. The optimal solution is obtained by solving an eigenvalue problem. Moreover, we discuss how to use prior knowledge to distinguish informative data sources, and optimally weight them in CoCA. Since there is no previous model that can be directly applied to solve the problem, we devised a straightforward comparison method by performing dimensionality reduction on the concatenation of the data sources. Three sets of experiments show that CoCA substantially outperforms the comparison method.