395 search results - page 65 / 79 » Learning to rank with partially-labeled data |
ISPW
2008
IEEE
15 years 6 months ago
2008
IEEE
Most process models calibrate their internal settings using historical data. Collecting this data is expensive, tedious, and often an incomplete process. Is it possible to make acc...
ICML
2009
IEEE
15 years 6 months ago
2009
IEEE
We consider the problem of selecting a subset of m most informative features where m is the number of required features. This feature selection problem is essentially a combinator...
109
click to vote
KDD
2004
ACM
16 years 3 days ago
2004
ACM
We propose a new unsupervised learning technique for extracting information from large text collections. We model documents as if they were generated by a two-stage stochastic pro...
145
click to vote
WWW
2010
ACM
15 years 6 months ago
2010
ACM
Recommender systems are an important component of many websites. Two of the most popular approaches are based on matrix factorization (MF) and Markov chains (MC). MF methods learn...
189
click to vote
VLDB
2008
ACM
15 years 12 months ago
2008
ACM
The evolution of computing technology suggests that it has become more feasible to offer access to Web information in a ubiquitous way, through various kinds of interaction device...