Sciweavers

Share
KDD
2012
ACM
212views Data Mining» more  KDD 2012»
7 years 26 days 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
JMLR
2012
7 years 26 days ago
Lifted coordinate descent for learning with trace-norm regularization
We consider the minimization of a smooth loss with trace-norm regularization, which is a natural objective in multi-class and multitask learning. Even though the problem is convex...
Miroslav Dudík, Zaïd Harchaoui, J&eacu...
AAAI
2011
7 years 10 months ago
An Online Spectral Learning Algorithm for Partially Observable Nonlinear Dynamical Systems
Recently, a number of researchers have proposed spectral algorithms for learning models of dynamical systems—for example, Hidden Markov Models (HMMs), Partially Observable Marko...
Byron Boots, Geoffrey J. Gordon
SIGIR
2011
ACM
8 years 1 months ago
Utilizing marginal net utility for recommendation in e-commerce
Traditional recommendation algorithms often select products with the highest predicted ratings to recommend. However, earlier research in economics and marketing indicates that a ...
Jian Wang, Yi Zhang
SIAMMAX
2011
141views more  SIAMMAX 2011»
8 years 1 months ago
Best Low Multilinear Rank Approximation of Higher-Order Tensors, Based on the Riemannian Trust-Region Scheme
Higher-order tensors are used in many application fields, such as statistics, signal processing, and scientific computing. Efficient and reliable algorithms for manipulating thes...
Mariya Ishteva, Pierre-Antoine Absil, Sabine Van H...
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
8 years 1 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
SDM
2011
SIAM
218views Data Mining» more  SDM 2011»
8 years 1 months ago
Segmented nestedness in binary data
A binary matrix is fully nested if its columns form a chain of subsets; that is, any two columns are ordered by the subset relation, where we view each column as a subset of the r...
Esa Junttila, Petteri Kaski
JCPHY
2011
109views more  JCPHY 2011»
8 years 1 months ago
Fast construction of hierarchical matrix representation from matrix-vector multiplication
We develop a hierarchical matrix construction algorithm using matrixvector multiplications, based on the randomized singular value decomposition of low-rank matrices. The algorith...
Lin Lin, Jianfeng Lu, Lexing Ying
CORR
2011
Springer
247views Education» more  CORR 2011»
8 years 2 months ago
The Extraordinary SVD
: We review the singular value decomposition (SVD) and discuss some lesser-known applications of it that we find particularly interesting. We also discuss generalizations of the S...
Carla D. Martin, Mason A. Porter
WINET
2010
178views more  WINET 2010»
8 years 5 months ago
Zero-configuration indoor localization over IEEE 802.11 wireless infrastructure
With the technical advances in ubiquitous computing and wireless networking, there has been an increasing need to capture the context information (such as the location) and to figu...
Hyuk Lim, Lu-Chuan Kung, Jennifer C. Hou, Haiyun L...
books