Collaborative Metric Learning

  title={Collaborative Metric Learning},
  author={Cheng-Kang Hsieh and Longqi Yang and Yin Cui and Tsung-Yi Lin and Serge J. Belongie and Deborah Estrin},
  journal={Proceedings of the 26th International Conference on World Wide Web},
  • C. HsiehLongqi Yang D. Estrin
  • Published 3 April 2017
  • Computer Science
  • Proceedings of the 26th International Conference on World Wide Web
Metric learning algorithms produce distance metrics that capture the important relationships among data. In this work, we study the connection between metric learning and collaborative filtering. We propose Collaborative Metric Learning (CML) which learns a joint metric space to encode not only users' preferences but also the user-user and item-item similarity. The proposed algorithm outperforms state-of-the-art collaborative filtering algorithms on a wide range of recommendation tasks and… 

Figures and Tables from this paper

Social Regularized Collaborative Metric Learning

  • Zhengxin ZhangQimin ZhouHuan ZhaoHao Wu
  • Computer Science
    2019 IEEE 21st International Conference on High Performance Computing and Communications; IEEE 17th International Conference on Smart City; IEEE 5th International Conference on Data Science and Systems (HPCC/SmartCity/DSS)
  • 2019
A Social Regularized Collaborative Metric Learning model for item recommendation that first defines a similarity function which integrates social preferences and rating preferences to measure user similarity, and then constructs a regularization component to reconstruct the loss function of collaborative metric learning, so that users with similar hobbies are closer to each other in the metric space.

Decoupled Metric Learning Model combining Tag Information for Recommendation

  • YanJun WangYan TangQiang Chen
  • Computer Science
    2020 2nd International Conference on Machine Learning, Big Data and Business Intelligence (MLBDBI)
  • 2020
DMLT model does well in decoupling the preference of users from rating data with tags information and is more accurate than the matrix factorization algorithm and other latest metric learning recommendation algorithms.

Collaborative Probability Metric Learning

This work proposes a novel collaborative filtering method based on metric learning, which can simultaneously capture the similarities of item-item pairs and user-user pairs besides the users’ preferences on items.

Make Users and Preferred Items Closer: Recommendation via Distance Metric Learning

This paper aims to make users be spatially close to items they like and be far away from items they dislike, by connecting matrix factorization and distance metric learning.

Curvilinear Collaborative Metric Learning with Macro-micro Attentions

Although matrix factorization and its variants have proved their effectiveness in learning user preferences, they violate the triangle inequality and may fail to capture the inner grained preference

Collaborative Similarity Embedding for Recommender Systems

A unified framework that exploits comprehensive collaborative relations available in a user-item bipartite graph for representation learning and recommendation and proposes a sampling technique that is specifically designed to capture the two types of proximity relations.

Collaborative Filtering Based on Factorization and Distance Metric Learning

  • Yuanle DengMing YeLong Xiong
  • Computer Science
    2019 IEEE 2nd International Conference on Electronics and Communication Engineering (ICECE)
  • 2019
This paper combines metric learning and distance factorization to obtain the position of users and items in low-dimensional Euclidean space and improves the accuracy of recommendations.

A Social Recommendation Based on Metric Learning and Users' Co-Occurrence Pattern

A metric learning-based social recommendation model called SRMC that exploits users’ co-occurrence patterns to discover their potentially similar or dissimilar users with symmetric relationships and change their relative positions to achieve better recommendations.

Noise–Robust Sampling for Collaborative Metric Learning

This study proposes a comprehensive and effective method to deal with noise in CML and the experimental results show that the proposed method significantly improves the performance of the two requirements compared with existing methods.



Collaborative Deep Learning for Recommender Systems

A hierarchical Bayesian model called collaborative deep learning (CDL), which jointly performs deep representation learning for the content information and collaborative filtering for the ratings (feedback) matrix is proposed, which can significantly advance the state of the art.

Collaborative filtering via euclidean embedding

A novel Euclidean embedding method is proposed as an alternative latent factor model to implement collaborative filtering that is comparable to matrix factorization in terms of both scalability and accuracy while providing several advantages.

Distance Metric Learning with Application to Clustering with Side-Information

This paper presents an algorithm that, given examples of similar (and, if desired, dissimilar) pairs of points in �”n, learns a distance metric over ℝn that respects these relationships.

Speeding up the Xbox recommender system using a euclidean transformation for inner-product spaces

This work proposes a novel order preserving transformation, mapping the maximum inner product search problem to Euclidean space nearest neighbor search problem, and studies the efficiency of several (approximate) nearest neighbor data structures.

Improving recommendation lists through topic diversification

This work presents topic diversification, a novel method designed to balance and diversify personalized recommendation lists in order to reflect the user's complete spectrum of interests, and introduces the intra-list similarity metric to assess the topical diversity of recommendation lists.

Metric Learning: A Survey

  • B. Kulis
  • Computer Science
    Found. Trends Mach. Learn.
  • 2013
Metric Learning: A Review presents an overview of existing research in this topic, including recent progress on scaling to high-dimensional feature spaces and to data sets with an extremely large number of data points.

VBPR: Visual Bayesian Personalized Ranking from Implicit Feedback

This paper proposes a scalable factorization model to incorporate visual signals into predictors of people's opinions, which is applied to a selection of large, real-world datasets and makes use of visual features extracted from product images using (pre-trained) deep networks.

Collaborative Filtering for Implicit Feedback Datasets

This work identifies unique properties of implicit feedback datasets and proposes treating the data as indication of positive and negative preference associated with vastly varying confidence levels, which leads to a factor model which is especially tailored for implicit feedback recommenders.

BPR: Bayesian Personalized Ranking from Implicit Feedback

This paper presents a generic optimization criterion BPR-Opt for personalized ranking that is the maximum posterior estimator derived from a Bayesian analysis of the problem and provides a generic learning algorithm for optimizing models with respect to B PR-Opt.

Metric Learning with Multiple Kernels

Experimental evidence suggests that the general approach presented can be instantiated with different metric learning algorithms provided that they satisfy some constraints and outperforms metric learning with an unweighted kernel combination and metriclearning with cross-validation based kernel selection.