Sciweavers

2020 search results - page 5 / 404
» KDD Process Planning
Sort
View
DEXA
2003
Springer
193views Database» more  DEXA 2003»
14 years 17 days ago
Supporting KDD Applications by the k-Nearest Neighbor Join
Abstract. 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 t...
Christian Böhm, Florian Krebs
KDD
1994
ACM
113views Data Mining» more  KDD 1994»
13 years 11 months ago
Exploration of Simulation Experiments by Discovery
: Weexemplify in this paper, howa discovery system is applied to the analysis of simulation experimentsin practical political planning, andshowwhatkind of newknowledgecan be discov...
Willi Klösgen
WACC
1999
ACM
13 years 11 months ago
Coordinating agent activities in knowledge discovery processes
Knowledge discovery in databases (KDD) is an increasingly widespread activity. KDD processes may entail the use of a large number of data manipulation and analysis techniques, and...
David Jensen, Yulin Dong, Barbara Staudt Lerner, E...
KDD
1998
ACM
105views Data Mining» more  KDD 1998»
13 years 11 months ago
PlanMine: Sequence Mining for Plan Failures
This paper presents the PLANMINE sequence mining algorithm to extract patterns of events that predict failures in databases of plan executions. New techniques were needed because ...
Mohammed Javeed Zaki, Neal Lesh, Mitsunori Ogihara
AIPS
2011
12 years 11 months ago
Sample-Based Planning for Continuous Action Markov Decision Processes
In this paper, we present a new algorithm that integrates recent advances in solving continuous bandit problems with sample-based rollout methods for planning in Markov Decision P...
Christopher R. Mansley, Ari Weinstein, Michael L. ...