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

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 2,909
Next 10 →

Latent dirichlet allocation

by David M. Blei, Andrew Y. Ng, Michael I. Jordan, John Lafferty - Journal of Machine Learning Research , 2003
"... We describe latent Dirichlet allocation (LDA), a generative probabilistic model for collections of discrete data such as text corpora. LDA is a three-level hierarchical Bayesian model, in which each item of a collection is modeled as a finite mixture over an underlying set of topics. Each topic is, ..."
Abstract - Cited by 4365 (92 self) - Add to MetaCart
for empirical Bayes parameter estimation. We report results in document modeling, text classification, and collaborative filtering, comparing to a mixture of unigrams model and the probabilistic LSI model. 1.

Difficulties in Simulating the Internet

by Sally Floyd, Vern Paxson - IEEE/ACM Transactions on Networking , 2001
"... Simulating how the global Internet behaves is an immensely challenging undertaking because of the network's great heterogeneity and rapid change. The heterogeneity ranges from the individual links that carry the network's traffic, to the protocols that interoperate over the links, to the & ..."
Abstract - Cited by 341 (8 self) - Add to MetaCart
, to the "mix" of different applications used at a site, to the levels of congestion seen on different links. We discuss two key strategies for developing meaningful simulations in the face of these difficulties: searching for invariants, and judiciously exploring the simulation parameter space. We

Clustering Methods for Collaborative Filtering

by Lyle Ungar, Dean Foster, Ellen Andre, Star Wars, Fred Star Wars, Dean Star Wars, Jason Hiver Whispers , 1998
"... Grouping people into clusters based on the items they have purchased allows accurate recommendations of new items for purchase: if you and I have liked many of the same movies, then I will probably enjoy other movies that you like. Recommending items based on similarity of interest (a.k.a. collabora ..."
Abstract - Cited by 210 (6 self) - Add to MetaCart
.k.a. collaborative filtering) is attractive for many domains: books, CDs, movies, etc., but does not always work well. Because data are always sparse -- any given person has seen only a small fraction of all movies -- much more accurate predictions can be made by grouping people into clusters with similar movies

Probabilistic Matrix Factorization

by Ruslan Salakhutdinov, Andriy Mnih
"... Many existing approaches to collaborative filtering can neither handle very large datasets nor easily deal with users who have very few ratings. In this paper we present the Probabilistic Matrix Factorization (PMF) model which scales linearly with the number of observations and, more importantly, pe ..."
Abstract - Cited by 287 (5 self) - Add to MetaCart
Many existing approaches to collaborative filtering can neither handle very large datasets nor easily deal with users who have very few ratings. In this paper we present the Probabilistic Matrix Factorization (PMF) model which scales linearly with the number of observations and, more importantly

Why We Don't Know How to Simulate the Internet

by Vern Paxson, Sally Floyd , 1997
"... Simulating how the global Internet data network behaves is an immensely challenging undertaking because of the network's great heterogeneity and rapid change. The heterogeneity ranges from the individual links that carry the network's traffic, to the protocols that interoperate over the li ..."
Abstract - Cited by 232 (4 self) - Add to MetaCart
parameter space. We finish with a look at a collaborative effort to build a common simulation environment for conducting Internet studies.

Probabilistic models for unified collaborative and content-based recommendation in sparsedata environments

by Rin Popescul, Lyle H. Ungar - In UAI ’01, 437–444 , 2001
"... Recommender systems leverage product and community information to target products to consumers. Researchers have developed collaborative recommenders, content-based recommenders, and a few hybrid systems. We propose a unified probabilistic framework for merging collaborative and content-based recomm ..."
Abstract - Cited by 171 (9 self) - Add to MetaCart
-based recommendations. We extend Hofmann’s (1999) aspect model to incorporate three-way co-occurrence data among users, items, and item content. The relative influence of collaboration data versus content data is not imposed as an exogenous parameter, but rather emerges naturally from the given data sources. However

Scalable Collaborative Filtering with Jointly Derived Neighborhood Interpolation Weights

by Robert M. Bell, Yehuda Koren - IEEE International Conference on Data Mining (ICDM , 2007
"... Recommender systems based on collaborative filtering predict user preferences for products or services by learning past user-item relationships. A predominant approach to collaborative filtering is neighborhood based (“k-nearest neighbors”), where a user-item preference rating is interpolated from r ..."
Abstract - Cited by 153 (11 self) - Add to MetaCart
Recommender systems based on collaborative filtering predict user preferences for products or services by learning past user-item relationships. A predominant approach to collaborative filtering is neighborhood based (“k-nearest neighbors”), where a user-item preference rating is interpolated from

Collaboration

by Michele Della Morteb, Nicolas Garronc, Rainer Sommere, Orsay Cedex
"... We determine non-perturbatively the parameters of the lattice HQET Lagrangian and those of the time component of the heavy-light axial-vector current in the quenched approximation. The HQET expansion includes terms of order 1/mb. Our results allow to compute, for example, the heavy-light spectrum an ..."
Abstract - Add to MetaCart
We determine non-perturbatively the parameters of the lattice HQET Lagrangian and those of the time component of the heavy-light axial-vector current in the quenched approximation. The HQET expansion includes terms of order 1/mb. Our results allow to compute, for example, the heavy-light spectrum

Bayesian probabilistic matrix factorization using markov chain monte carlo

by Ruslan Salakhutdinov, Andriy Mnih - In ICML ’08: Proceedings of the 25th International Conference on Machine Learning , 2008
"... Low-rank matrix approximation methods provide one of the simplest and most effective approaches to collaborative filtering. Such models are usually fitted to data by finding a MAP estimate of the model parameters, a procedure that can be performed efficiently even on very large datasets. However, un ..."
Abstract - Cited by 189 (4 self) - Add to MetaCart
Low-rank matrix approximation methods provide one of the simplest and most effective approaches to collaborative filtering. Such models are usually fitted to data by finding a MAP estimate of the model parameters, a procedure that can be performed efficiently even on very large datasets. However

Collaboration

by unknown authors , 1985
"... A measurement of Do lifetime using the impact parameter method is presented. The Do sample is obtained from identified D* * decays in e+e- annihilations into hadrons at a center of mass energy of 29 GeV. The maximum likelihood method used includes the effects of various backgrounds, giving the Do li ..."
Abstract - Add to MetaCart
A measurement of Do lifetime using the impact parameter method is presented. The Do sample is obtained from identified D* * decays in e+e- annihilations into hadrons at a center of mass energy of 29 GeV. The maximum likelihood method used includes the effects of various backgrounds, giving the Do
Next 10 →
Results 1 - 10 of 2,909
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