7581 search results - page 1146 / 1517 » Incompleteness in Data Mining |
198
click to vote
PKDD
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We address the problem of joint feature selection in multiple related classification or regression tasks. When doing feature selection with multiple tasks, usually one c...
172
click to vote
PKDD
2009
Springer
16 years 1 months ago
2009
Springer
The Support Vector Machine error bound is a function of the margin and radius. Standard SVM algorithms maximize the margin within a given feature space, therefore the radius is fi...
172
click to vote
PKDD
2009
Springer
16 years 1 months ago
2009
Springer
Subgroup discovery is a Knowledge Discovery task that aims at finding subgroups of a population with high generality and distributional unusualness. While several subgroup discove...
201
click to vote
PKDD
2009
Springer
16 years 1 months ago
2009
Springer
Probabilistic relational models are an efficient way to learn and represent the dynamics in realistic environments consisting of many objects. Autonomous intelligent agents that gr...
180
click to vote
PKDD
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...