AutoAlign: Fully Automatic and Effective Knowledge Graph Alignment enabled by Large Language Models

The task of entity alignment between knowledge graphs (KGs) aims to identify every pair of entities from two different KGs that represent the same entity. Many machine learning-based methods have been proposed for this task. However, to our best knowledge, existing methods all require manually crafted seed alignments, which are expensive to obtain. In this paper, we propose the first fully automatic alignment method named AutoAlign, which does not require any manually crafted seed alignments. Specifically, for predicate embeddings, AutoAlign constructs a predicate-proximity-graph with the help of large language models to automatically capture the similarity between predicates across two KGs. For entity embeddings, AutoAlign first computes the entity embeddings of each KG independently using TransE, and then shifts the two KGs' entity embeddings into the same vector space by computing the similarity between entities based on their attributes. Thus, both predicate alignment and entity alignment can be done without manually crafted seed alignments. AutoAlign is not only fully automatic, but also highly effective. Experiments using real-world KGs show that AutoAlign improves the performance of entity alignment significantly compared to state-of-the-art methods.

Detecting Arbitrary Order Beneficial Feature Interactions for Recommender Systems

Detecting beneficial feature interactions is essential in recommender systems, and existing approaches achieve this by examining all the possible feature interactions. However, the cost of examining all the possible higher-order feature interactions is prohibitive (exponentially growing with the order increasing). Hence existing approaches only detect limited order (e.g., combinations of up to four features) beneficial feature interactions, which may miss beneficial feature interactions with orders higher than the limitation. In this paper, we propose a hypergraph neural network based model named HIRS. HIRS is the first work that directly generates beneficial feature interactions of arbitrary orders and makes recommendation predictions accordingly. The number of generated feature interactions can be specified to be much smaller than the number of all the possible interactions and hence, our model admits a much lower running time. To achieve an effective algorithm, we exploit three properties of beneficial feature interactions, and propose deep-infomax-based methods to guide the interaction generation. Our experimental results show that HIRS outperforms state-of-the-art algorithms by up to 5% in terms of recommendation accuracy.

Neural Graph Matching based Collaborative Filtering

User and item attributes are essential side-information; their interactions (i.e., their co-occurrence in the sample data) can significantly enhance prediction accuracy in various recommender systems. We identify two different types of attribute interactions, inner interactions and cross interactions: inner interactions are those between only user attributes or those between only item attributes; cross interactions are those between user attributes and item attributes. Existing models do not distinguish these two types of attribute interactions, which may not be the most effective way to exploit the information carried by the interactions. To address this drawback, we propose a neural Graph Matching based Collaborative Filtering model (GMCF), which effectively captures the two types of attribute interactions through modeling and aggregating attribute interactions in a graph matching structure for recommendation. In our model, the two essential recommendation procedures, characteristic learning and preference matching, are explicitly conducted through graph learning (based on inner interactions) and node matching (based on cross interactions), respectively. Experimental results show that our model outperforms state-of-the-art models. Further studies verify the effectiveness of GMCF in improving the accuracy of recommendation.

Detecting Relevant Feature Interactions for Recommender Systems via Graph Neural Networks

Feature interactions are essential for achieving high accuracy in recommender systems (RS), so they have been taken into consideration in many existing RS, where all feature interactions are modeled. Nevertheless, not all feature interactions have positive effects for RS: modeling the irrelevant feature interactions may introduce noises and degrade the accuracy. To overcome this problem, in this work, we propose a graph neural network-based model, L0-SIGN, to detect the relevance of feature interactions and utilize only the relevant ones for RS, with features as nodes and feature interactions as edges. Generally, our model consists of two components: an L0 regularization based edge prediction model to explicitly detect relevant feature interactions; and a graph classification model, SIGN, to effectively model and aggregate the detected ones for recommendations. These two components positively influence each other to ensure that the most relevant feature interactions will be detected and modeled. In addition, we further prove that the effectiveness of our model is theoretically sound. We first show that our model is a variational approximation of information bottleneck principle, i.e., the detected feature interactions are guaranteed to be most relevant. We then show that our model follows the definition of statistical interactions, proving that the modeling of detected feature interactions in L0-SIGN is effective. Experimental results show that (i) L0-SIGN outperforms existing baselines in terms of accuracy, and (ii) the detected feature interactions are beneficial for performance gain and interpretability.