Sciweavers

154 search results - page 19 / 31
» Algorithms for Batch Matrix Factorization with Application t...
Sort
View
KDD
2012
ACM
212views Data Mining» more  KDD 2012»
11 years 10 months ago
Fast bregman divergence NMF using taylor expansion and coordinate descent
Non-negative matrix factorization (NMF) provides a lower rank approximation of a matrix. Due to nonnegativity imposed on the factors, it gives a latent structure that is often mor...
Liangda Li, Guy Lebanon, Haesun Park
KDD
2002
ACM
109views Data Mining» more  KDD 2002»
14 years 8 months ago
Topics in 0--1 data
Large 0-1 datasets arise in various applications, such as market basket analysis and information retrieval. We concentrate on the study of topic models, aiming at results which in...
Ella Bingham, Heikki Mannila, Jouni K. Seppän...
WSDM
2012
ACM
259views Data Mining» more  WSDM 2012»
12 years 3 months ago
Learning recommender systems with adaptive regularization
Many factorization models like matrix or tensor factorization have been proposed for the important application of recommender systems. The success of such factorization models dep...
Steffen Rendle
IJCAI
2007
13 years 9 months ago
Fast Incremental Square Root Information Smoothing
We propose a novel approach to the problem of simultaneous localization and mapping (SLAM) based on incremental smoothing, that is suitable for real-time applications in large-sca...
Michael Kaess, Ananth Ranganathan, Frank Dellaert
USENIX
2008
13 years 10 months ago
Context-Aware Prefetching at the Storage Server
In many of today's applications, access to storage constitutes the major cost of processing a user request. Data prefetching has been used to alleviate the storage access lat...
Gokul Soundararajan, Madalin Mihailescu, Cristiana...