Gradient boosting factorization machines

@inproceedings{Cheng2014GradientBF,
  title={Gradient boosting factorization machines},
  author={Chen-Kuang Cheng and Fen Xia and T. Zhang and Irwin King and Michael R. Lyu},
  booktitle={ACM Conference on Recommender Systems},
  year={2014}
}
Recommendation techniques have been well developed in the past decades. [] Key Method Then we propose a novel Gradient Boosting Factorization Machine (GBFM) model to incorporate feature selection algorithm with Factorization Machines into a unified framework. The experimental results on both synthetic and real datasets demonstrate the efficiency and effectiveness of our algorithm compared to other state-of-the-art methods.

Figures and Tables from this paper

BoostFM: Boosted Factorization Machines for Top-N Feature-based Recommendation

BoostFM is an adaptive boosting framework that linearly combines multiple homogeneous component recommenders which are repeatedly constructed on the basis of the individual FM model by a re-weighting scheme, which outperforms a number of state-of-the-art approaches for top-N recommendation.

Feature Selection for FM-Based Context-Aware Recommendation Systems

This paper proposes a framework to automatically select features on FM-based recommender systems to improve the prediction quality and considers the density of the important features in the binary space to rank and select the relevant features inThe original data.

Influence of Auxiliary Features in Factorization-based Collaborative Filtering

The results show that the optimization of hyper-parameters, factorization dimensionality and feature weights is a very crucial part of using FMs for recommendations and there is no clear answer to which auxiliary features are useful, as it depends heavily on the dataset.

A Boosting Framework of Factorization Machine

This work proposes an Adaptive Boosting framework of Factorization Machines (AdaFM), which can adaptively search for proper ranks for different datasets without re-training, and will adaptively gradually increases its rank according to its performance until the performance does not grow, using boosting strategy.

Synergies that Matter: Efficient Interaction Selection via Sparse Factorization Machine

An efficient Sparse Factorization Machine (SFM) is proposed, that simultaneously identifies relevant user and item content features, models interactions between these relevant features, and learns a bilinear model using only these synergistic interactions.

Enhancing Factorization Machines With Generalized Metric Learning

A Mahalanobis distance and a deep neural network methods, which can effectively model the linear and non-linear correlations between features, respectively, are presented and an efficient approach for simplifying the model functions is designed.

L G ] 1 7 A pr 2 01 8 A Boosting Framework of Factorization Machine

This work proposes an Adaptive Boosting framework of Factorization Machines (AdaFM), which can adaptively search for proper ranks for different datasets without re-training, and will adaptively gradually increases its rank according to its performance until the performance does not grow, using boosting strategy.
...

References

SHOWING 1-10 OF 38 REFERENCES

Fast context-aware recommendations with factorization machines

This work proposes to apply Factorization Machines (FMs) to model contextual information and to provide context-aware rating predictions and shows empirically that this approach outperforms Multiverse Recommendation in prediction quality and runtime.

Pairwise interaction tensor factorization for personalized tag recommendation

The factorization model PITF (Pairwise Interaction Tensor Factorization) is presented which is a special case of the TD model with linear runtime both for learning and prediction and shows that this model outperforms TD largely in runtime and even can achieve better prediction quality.

Multiverse recommendation: n-dimensional tensor factorization for context-aware collaborative filtering

This work introduces a Collaborative Filtering method based on Tensor Factorization, a generalization of Matrix Factorization that allows for a flexible and generic integration of contextual information by modeling the data as a User-Item-Context N-dimensional tensor instead of the traditional 2D User- Item matrix.

Combining Factorization Model and Additive Forest for Collaborative Followee Recommendation

The modeling approach is able to utilize various side information provided by the challenge dataset, and thus alleviates the cold-start problem, and the new temporal dynamics model the authors have proposed using an additive forest can automatically adjust the splitting time points to model popularity evolution more accurately.

Factorization Machines

  • Steffen Rendle
  • Computer Science
    2010 IEEE International Conference on Data Mining
  • 2010
Factorization Machines (FM) are introduced which are a new model class that combines the advantages of Support Vector Machines (SVM) with factorization models and can mimic these models just by specifying the input data (i.e. the feature vectors).

General Functional Matrix Factorization Using Gradient Boosting

This paper studies the problem of utilizing auxiliary information as features of factorization and proposes formalizing the problem as general functional matrix factorization, whose model includes conventional matrixfactorization models as its special cases.

Contextual Collaborative Filtering via Hierarchical Matrix Factorization

The proposed “contextual collaborative filtering” approach splits the rating matrix hierarchically by grouping similar users and items together, and factorizes each sub-matrix locally under different contexts by building an ensemble model, which avoids over-fitting with less parameter tuning.

SoCo: a social network aided context-aware recommender system

This paper proposes SoCo, a novel context-aware recommender system incorporating elaborately processed social network information and introduces an additional social regularization term to the matrix factorization objective function to infer a user's preference for an item by learning opinions from his/her friends who are expected to share similar tastes.

Matrix factorization techniques for context aware recommendation

A novel context-aware recommendation algorithm that extends Matrix Factorization is presented that has the advantage of smaller computational cost and provides the possibility to represent at different granularities the interaction between context and items.

Factorization meets the neighborhood: a multifaceted collaborative filtering model

The factor and neighborhood models can now be smoothly merged, thereby building a more accurate combined model and a new evaluation metric is suggested, which highlights the differences among methods, based on their performance at a top-K recommendation task.