Sciweavers

2020 search results - page 229 / 404
» KDD Process Planning
Sort
View
WWW
2009
ACM
16 years 7 months ago
Unsupervised query categorization using automatically-built concept graphs
Automatic categorization of user queries is an important component of general purpose (Web) search engines, particularly for triggering rich, query-specific content and sponsored ...
Eustache Diemert, Gilles Vandelle
ICDM
2002
IEEE
163views Data Mining» more  ICDM 2002»
15 years 11 months ago
High Performance Data Mining Using the Nearest Neighbor Join
The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such that the r...
Christian Böhm, Florian Krebs
PKDD
1998
Springer
123views Data Mining» more  PKDD 1998»
15 years 10 months ago
Querying Inductive Databases: A Case Study on the MINE RULE Operator
Knowledge discovery in databases (KDD) is a process that can include steps like forming the data set, data transformations, discovery of patterns, searching for exceptions to a pat...
Jean-François Boulicaut, Mika Klemettinen, ...
AAAI
2012
13 years 9 months ago
Tree-Based Solution Methods for Multiagent POMDPs with Delayed Communication
Planning under uncertainty is an important and challenging problem in multiagent systems. Multiagent Partially Observable Markov Decision Processes (MPOMDPs) provide a powerful fr...
Frans Adriaan Oliehoek, Matthijs T. J. Spaan
IROS
2008
IEEE
123views Robotics» more  IROS 2008»
16 years 28 days ago
Learning predictive terrain models for legged robot locomotion
— Legged robots require accurate models of their environment in order to plan and execute paths. We present a probabilistic technique based on Gaussian processes that allows terr...
Christian Plagemann, Sebastian Mischke, Sam Prenti...