203 search results - page 28 / 41 » Decision Tree Pruning as a Search in the State Space |
AIPS
2008
13 years 9 months ago
2008
The heuristics used for planning and search often take the pattern databases generated from abstracted versions of the given state space. Pattern databases are typically stored p ...
FIMI
2003
13 years 8 months ago
2003
Existing association rule mining algorithms suffer from many problems when mining massive transactional datasets. Some of these major problems are: (1) the repetitive I/O disk sca...
VLDB
2007
ACM
14 years 7 months ago
2007
ACM
In this article, we propose a new approach for querying and indexing a database of trees with specific applications to XML datasets. Our approach relies on representing both the q...
WEA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In this paper we present a novel approach to the graph isomorphism problem. We combine a direct approach, that tries to find a mapping between the two input graphs using...
AUSDM
2007
Springer
14 years 1 months ago
2007
Springer
Mining High Utility Itemsets from a transaction database is to find itemsests that have utility above a user-specified threshold. This problem is an extension of Frequent Itemset ...