Results 1  10
of
11,906
MATRIX FACTORIZATION TECHNIQUES FOR RECOMMENDER SYSTEMS
 IEEE COMPUTER
, 2009
"... As the Netflix Prize competition has demonstrated, matrix factorization models are superior to classic nearestneighbor techniques for producing product recommendations, allowing the incorporation of additional information such as implicit feedback, temporal effects, and confidence levels. Modern co ..."
Abstract

Cited by 593 (4 self)
 Add to MetaCart
As the Netflix Prize competition has demonstrated, matrix factorization models are superior to classic nearestneighbor techniques for producing product recommendations, allowing the incorporation of additional information such as implicit feedback, temporal effects, and confidence levels. Modern
Factoring wavelet transforms into lifting steps
 J. FOURIER ANAL. APPL
, 1998
"... This paper is essentially tutorial in nature. We show how any discrete wavelet transform or two band subband filtering with finite filters can be decomposed into a finite sequence of simple filtering steps, which we call lifting steps but that are also known as ladder structures. This decompositio ..."
Abstract

Cited by 584 (8 self)
 Add to MetaCart
. This decomposition corresponds to a factorization of the polyphase matrix of the wavelet or subband filters into elementary matrices. That such a factorization is possible is wellknown to algebraists (and expressed by the formula); it is also used in linear systems theory in the electrical engineering community. We
Cilk: An Efficient Multithreaded Runtime System
, 1995
"... Cilk (pronounced “silk”) is a Cbased runtime system for multithreaded parallel programming. In this paper, we document the efficiency of the Cilk workstealing scheduler, both empirically and analytically. We show that on real and synthetic applications, the “work” and “critical path ” of a Cilk co ..."
Abstract

Cited by 763 (33 self)
 Add to MetaCart
, the Cilk scheduler achieves space, time, and communication bounds all within a constant factor of optimal. The Cilk rmrtime system currently runs on the Connection Machine CM5 MPP, the Intel Paragon MPP, the Silicon Graphics Power Challenge SMP, and the MIT Phish network of workstations. Applications
For Most Large Underdetermined Systems of Linear Equations the Minimal ℓ1norm Solution is also the Sparsest Solution
 Comm. Pure Appl. Math
, 2004
"... We consider linear equations y = Φα where y is a given vector in R n, Φ is a given n by m matrix with n < m ≤ An, and we wish to solve for α ∈ R m. We suppose that the columns of Φ are normalized to unit ℓ 2 norm 1 and we place uniform measure on such Φ. We prove the existence of ρ = ρ(A) so that ..."
Abstract

Cited by 568 (10 self)
 Add to MetaCart
. In contrast, heuristic attempts to sparsely solve such systems – greedy algorithms and thresholding – perform poorly in this challenging setting. The techniques include the use of random proportional embeddings and almostspherical sections in Banach space theory, and deviation bounds for the eigenvalues
Stochastic Perturbation Theory
, 1988
"... . In this paper classical matrix perturbation theory is approached from a probabilistic point of view. The perturbed quantity is approximated by a firstorder perturbation expansion, in which the perturbation is assumed to be random. This permits the computation of statistics estimating the variatio ..."
Abstract

Cited by 907 (36 self)
 Add to MetaCart
the variation in the perturbed quantity. Up to the higherorder terms that are ignored in the expansion, these statistics tend to be more realistic than perturbation bounds obtained in terms of norms. The technique is applied to a number of problems in matrix perturbation theory, including least squares
Smooth Stabilization Implies Coprime Factorization
, 1989
"... This paper shows that coprime right factorizations exist for the input to state mapping of a continuous time nonlinear system provided that the smooth feedback stabilization problem be solvable for this system. In particular, it follows that feedback linearizable systems admit such factorizations. I ..."
Abstract

Cited by 472 (62 self)
 Add to MetaCart
This paper shows that coprime right factorizations exist for the input to state mapping of a continuous time nonlinear system provided that the smooth feedback stabilization problem be solvable for this system. In particular, it follows that feedback linearizable systems admit such factorizations
Factorization meets the neighborhood: a multifaceted collaborative filtering model
 In Proc. of the 14th ACM SIGKDD conference
, 2008
"... Recommender systems provide users with personalized suggestions for products or services. These systems often rely on Collaborating Filtering (CF), where past transactions are analyzed in order to establish connections between users and products. The two more successful approaches to CF are latent f ..."
Abstract

Cited by 424 (12 self)
 Add to MetaCart
Recommender systems provide users with personalized suggestions for products or services. These systems often rely on Collaborating Filtering (CF), where past transactions are analyzed in order to establish connections between users and products. The two more successful approaches to CF are latent
Variational algorithms for approximate Bayesian inference
, 2003
"... The Bayesian framework for machine learning allows for the incorporation of prior knowledge in a coherent way, avoids overfitting problems, and provides a principled basis for selecting between alternative models. Unfortunately the computations required are usually intractable. This thesis presents ..."
Abstract

Cited by 440 (9 self)
 Add to MetaCart
a unified variational Bayesian (VB) framework which approximates these computations in models with latent variables using a lower bound on the marginal likelihood. Chapter 1 presents background material on Bayesian inference, graphical models, and propagation algorithms. Chapter 2 forms
A rapid hierarchical radiosity algorithm
 Computer Graphics
, 1991
"... This paper presents a rapid hierarchical radiosity algorithm for illuminating scenes containing lar e polygonal patches. The afgorithm constructs a hierarchic“J representation of the form factor matrix by adaptively subdividing patches into su bpatches according to a usersupplied error bound. The a ..."
Abstract

Cited by 409 (11 self)
 Add to MetaCart
This paper presents a rapid hierarchical radiosity algorithm for illuminating scenes containing lar e polygonal patches. The afgorithm constructs a hierarchic“J representation of the form factor matrix by adaptively subdividing patches into su bpatches according to a usersupplied error bound
A model for types and levels of human interaction with automation
 IEEE Transactions on Systems Man and Cybernetics – Part A: Systems and Humans
"... Abstract—Technical developments in computer hardware and software now make it possible to introduce automation into virtually all aspects of humanmachine systems. Given these technical capabilities, which system functions should be automated and to what extent? We outline a model for types and leve ..."
Abstract

Cited by 401 (26 self)
 Add to MetaCart
and the costs of decision/action consequences, among others. Examples of recommended types and levels of automation are provided to illustrate the application of the model to automation design. Index Terms—Automation, cognitive engineering, function allocation, humancomputer interaction, human factors, human
Results 1  10
of
11,906