Sciweavers

7150 search results - page 1084 / 1430
» Graph-Based Data Mining
Sort
View
PKDD
2009
Springer
137views Data Mining» more  PKDD 2009»
15 years 9 months ago
On Subgroup Discovery in Numerical Domains
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...
Henrik Grosskreutz, Stefan Rüping
PKDD
2009
Springer
102views Data Mining» more  PKDD 2009»
15 years 9 months ago
Relevance Grounding for Planning in Relational Domains
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...
Tobias Lang, Marc Toussaint
PKDD
2009
Springer
147views Data Mining» more  PKDD 2009»
15 years 9 months ago
Kernel Polytope Faces Pursuit
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...
Tom Diethe, Zakria Hussain
PKDD
2009
Springer
196views Data Mining» more  PKDD 2009»
15 years 9 months ago
Causality Discovery with Additive Disturbances: An Information-Theoretical Perspective
We consider causally sufficient acyclic causal models in which the relationship among the variables is nonlinear while disturbances have linear effects, and show that three princi...
Kun Zhang, Aapo Hyvärinen
PKDD
2009
Springer
94views Data Mining» more  PKDD 2009»
15 years 9 months ago
OTTHO: On the Tip of My THOught
In this paper we propose a system to solve a language game, called Guillotine, which requires a player with a strong cultural and linguistic background knowledge. The player obser...
Pierpaolo Basile, Marco Degemmis, Pasquale Lops, G...
« Prev « First page 1084 / 1430 Last » Next »