3,028 research outputs found
Efficient Relation-aware Neighborhood Aggregation in Graph Neural Networks via Tensor Decomposition
Many Graph Neural Networks (GNNs) are proposed for Knowledge Graph Embedding
(KGE). However, lots of these methods neglect the importance of the information
of relations and combine it with the information of entities inefficiently,
leading to low expressiveness. To address this issue, we introduce a general
knowledge graph encoder incorporating tensor decomposition in the aggregation
function of Relational Graph Convolutional Network (R-GCN). In our model,
neighbor entities are transformed using projection matrices of a low-rank
tensor which are defined by relation types to benefit from multi-task learning
and produce expressive relation-aware representations. Besides, we propose a
low-rank estimation of the core tensor using CP decomposition to compress and
regularize our model. We use a training method inspired by contrastive
learning, which relieves the training limitation of the 1-N method on huge
graphs. We achieve favorably competitive results on FB15k-237 and WN18RR with
embeddings in comparably lower dimensions.Comment: 13 pages, 5 Tables, 2 Figure
Image collection pop-up: 3D reconstruction and clustering of rigid and non-rigid categories
© 20xx IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.This paper introduces an approach to simultaneously estimate 3D shape, camera pose, and object and type of deformation clustering, from partial 2D annotations in a multi-instance collection of images. Furthermore, we can indistinctly process rigid and non-rigid categories. This advances existing work, which only addresses the problem for one single object or, if multiple objects are considered, they are assumed to be clustered a priori. To handle this broader version of the problem, we model object deformation using a formulation based on multiple unions of subspaces, able to span from small rigid motion to complex deformations. The parameters of this model are learned via Augmented Lagrange Multipliers, in a completely unsupervised manner that does not require any training data at all. Extensive validation is provided in a wide variety of synthetic and real scenarios, including rigid and non-rigid categories with small and large deformations. In all cases our approach outperforms state-of-the-art in terms of 3D reconstruction accuracy, while also providing clustering results that allow segmenting the images into object instances and their associated type of deformation (or action the object is performing).Postprint (author's final draft
Relational Collaborative Filtering:Modeling Multiple Item Relations for Recommendation
Existing item-based collaborative filtering (ICF) methods leverage only the
relation of collaborative similarity. Nevertheless, there exist multiple
relations between items in real-world scenarios. Distinct from the
collaborative similarity that implies co-interact patterns from the user
perspective, these relations reveal fine-grained knowledge on items from
different perspectives of meta-data, functionality, etc. However, how to
incorporate multiple item relations is less explored in recommendation
research. In this work, we propose Relational Collaborative Filtering (RCF), a
general framework to exploit multiple relations between items in recommender
system. We find that both the relation type and the relation value are crucial
in inferring user preference. To this end, we develop a two-level hierarchical
attention mechanism to model user preference. The first-level attention
discriminates which types of relations are more important, and the second-level
attention considers the specific relation values to estimate the contribution
of a historical item in recommending the target item. To make the item
embeddings be reflective of the relational structure between items, we further
formulate a task to preserve the item relations, and jointly train it with the
recommendation task of preference modeling. Empirical results on two real
datasets demonstrate the strong performance of RCF. Furthermore, we also
conduct qualitative analyses to show the benefits of explanations brought by
the modeling of multiple item relations
- …