Generative Models for Item Adoptions Using Social Correlation
نویسندگان
چکیده
منابع مشابه
Predicting Item Adoption Using Social Correlation
Users face a dazzling array of choices on the Web when it comes to choosing which product to buy, which video to watch, etc. The trend of social information processing means users increasingly rely not only on their own preferences, but also on friends when making various adoption decisions. In this paper, we investigate the effects of social correlation on users’ adoption of items. Given a use...
متن کاملOn Modeling Brand Preferences in Item Adoptions
In marketing and advertising, developing and managing brands value represent the core activities performed by companies. Successful brands attract buyers and adopters, which in turn increase the companies’ value. Given a set of user-item adoption data, can we infer brand effects from users adopting items? To answer this question, we develop the Brand Item Topic Model (BITM) that incorporates us...
متن کاملUsing Generative Models for Handwritten Digit Recognition
We describe a method of recognizing handwritten digits by tting generative models that are built from deformable B-splines with Gaussian \ink generators" spaced along the length of the spline. The splines are adjusted using a novel elastic matching procedure based on the Expectation Maximization (EM) algorithm that maximizes the likelihood of the model generating the data. This approach has man...
متن کاملCompressed Sensing using Generative Models
The goal of compressed sensing is to estimate a vector from an underdetermined system of noisy linear measurements, by making use of prior knowledge on the structure of vectors in the relevant domain. For almost all results in this literature, the structure is represented by sparsity in a well-chosen basis. We show how to achieve guarantees similar to standard compressed sensing but without emp...
متن کاملCompressed Sensing using Generative Models
1/m. If m = ⌦ ✓ k log Lr ◆ , then for any x 2 S, if x0 = b x2G(M) kx b xk, we have kA(x x0)k = O( ) with probability 1 e ⌦(m). Note that for any given point x0 in S, if we try to find its nearest neighbor of that point in an -net on S, then the difference between the two is at most the . In words, this lemma says that even if we consider measurements made on these points, i.e. a linear projecti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2013
ISSN: 1041-4347
DOI: 10.1109/tkde.2012.137