• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Iterative splits of quadratic bounds for scalable binary tensor factorization (2014)

by B Ermis, G Bouchard
Venue:In UAI
Add To MetaCart

Tools

Sorted by:
Results 1 - 1 of 1

Zero-Truncated Poisson Tensor Factorization for Massive Binary Tensors

by Changwei Hu, Piyush Rai, Lawrence Carin
"... We present a scalable Bayesian model for low-rank factorization of massive tensors with binary observations. The proposed model has the fol-lowing key properties: (1) in contrast to the mod-els based on the logistic or probit likelihood, us-ing a zero-truncated Poisson likelihood for bi-nary data al ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
We present a scalable Bayesian model for low-rank factorization of massive tensors with binary observations. The proposed model has the fol-lowing key properties: (1) in contrast to the mod-els based on the logistic or probit likelihood, us-ing a zero-truncated Poisson likelihood for bi-nary data allows our model to scale up in the number of ones in the tensor, which is espe-cially appealing for massive but sparse binary tensors; (2) side-information in form of binary pairwise relationships (e.g., an adjacency net-work) between objects in any tensor mode can also be leveraged, which can be especially use-ful in “cold-start ” settings; and (3) the model ad-mits simple Bayesian inference via batch, as well as online MCMC; the latter allows scaling up even for dense binary data (i.e., when the num-ber of ones in the tensor/network is also mas-sive). In addition, non-negative factor matrices in our model provide easy interpretability, and the tensor rank can be inferred from the data. We evaluate our model on several large-scale real-world binary tensors, achieving excellent compu-tational scalability, and also demonstrate its use-fulness in leveraging side-information provided in form of mode-network(s).
(Show Context)

Citation Context

... Tikk, 2012; Nickel et al., 2012) as the model-fit criterion, which facilitates linear scalability in the number of ones in the tensor. However, such an approach can often lead to suboptimal results (=-=Ermis and Bouchard, 2014-=-) in practice. It is therefore desirable to have methods that can perform efficient tensor decomposition for such data, ideally with a computational-complexity that depends only on the number of nonze...

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University