7581 search results - page 1103 / 1517 » Incompleteness in Data Mining |
191
click to vote
PKDD
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. In preference learning, the algorithm observes pairwise relative judgments (preference) between items as training data for learning an ordering of all items. This is an i...
176
click to vote
PKDD
2010
Springer
15 years 5 months ago
2010
Springer
In this paper, we introduce a simple but efficient greedy algorithm, called SINCO, for the Sparse INverse COvariance selection problem, which is equivalent to learning a sparse Ga...
194
Voted
PKDD
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Bayesian reinforcement learning (RL) is aimed at making more efficient use of data samples, but typically uses significantly more computation. For discrete Markov Decis...
169
Voted
PKDD
2010
Springer
15 years 5 months ago
2010
Springer
In this paper, we consider the link prediction problem, where we are given a partial snapshot of a network at some time and the goal is to predict the additional links formed at a ...
184
Voted
SDM
2010
SIAM
15 years 5 months ago
2010
SIAM
A popular approach for dimensionality reduction and data analysis is principal component analysis (PCA). A limiting factor with PCA is that it does not inform us on which of the o...