The Community for Technology Leaders
2015 IEEE International Conference on Data Mining (ICDM) (2015)
Atlantic City, NJ, USA
Nov. 14, 2015 to Nov. 17, 2015
ISSN: 1550-4786
ISBN: 978-1-4673-9503-8
pp: 967-972
ABSTRACT
Factorization Machine (FM) provides a generic framework that combines the prediction quality of factorization models with the flexibility of feature engineering that discriminative models like SVM offer. The Bayesian Factorization Machine [11], with its impressive predictive performance and the convenience of automatic tuning of parameters, has been one of the most successful and efficient approaches within this framework. However, this model has two major drawbacks. Firstly, it assumes that the data is generated from Gaussian distributions that may not be the best assumption for count data such as integer-valued ratings. Secondly, to get the best performance, one needs to cross-validate over the number of latent factors used for modeling the pairwise interaction in FM, a process that is computationally intensive. This paper introduces the Nonparametric Poisson Factorization Machine (NPFM), which models count data using the Poisson distribution, which provides both modeling and computational advantages for sparse data. The ideal number of latent factors is estimated from the data itself, thereby addressing a key limitation of existing approaches to FM. Additionally, NPFM has linear time complexity with respect to the number of non-zero observations.
INDEX TERMS
Frequency modulation, Data models, Sparse matrices, Predictive models, Recommender systems, Bayes methods, Standards
CITATION

A. Saha, A. Acharya, B. Ravindran and J. Ghosh, "Nonparametric Poisson Factorization Machine," 2015 IEEE International Conference on Data Mining (ICDM), Atlantic City, NJ, USA, 2015, pp. 967-972.
doi:10.1109/ICDM.2015.142
87 ms
(Ver 3.3 (11022016))