Sciweavers

2020 search results - page 10 / 404
» KDD Process Planning
Sort
View
IAT
2003
IEEE
14 years 1 months ago
A Resource Based Framework for Planning and Replanning
We discuss a rigorous unifying framework for both planning and replanning, extending an existing logic-based approach to resource-based planning. The primitive concepts in this Ac...
Roman van der Krogt, Mathijs de Weerdt, Cees Witte...
XIMEP
2004
ACM
88views Database» more  XIMEP 2004»
14 years 1 months ago
XQuery Processing in Natix with an Emphasis on Join Ordering
We give an overview on how XQuery processing works in our native XML database system Natix. After a brief description of the query compiler we focus on the aspect of join ordering...
Norman May, Sven Helmer, Carl-Christian Kanne, Gui...
ICCBR
1997
Springer
14 years 17 days ago
Merge Strategies for Multiple Case Plan Replay
Planning by analogical reasoning is a learning method that consists of the storage, retrieval, and replay of planning episodes. Planning performance improves with the accumulationa...
Manuela M. Veloso
KDD
1997
ACM
131views Data Mining» more  KDD 1997»
14 years 17 days ago
Discovery of Actionable Patterns in Databases: The Action Hierarchy Approach
An approach to defining actionability as a measure of interestingness of patterns is proposed. This approach is based on the concept of an action hierarchy which is defined as a t...
Gediminas Adomavicius, Alexander Tuzhilin
JISE
2006
76views more  JISE 2006»
13 years 8 months ago
Process and Planning Support for Iterative Porting
in an abstract Cartesian space of program versions characterized by dialect variables. An optimal solution to the problem is derived based on its translation to a restricted Intege...
Pradeep Varma