Geo#rey I. Webb. Techniques for e#cient empirical induction. In C. J. Barter and M. J. Brooks (editors), AI'88 -- Proceedings of the Third Australian Joint Conference on Artificial Intelligence, pages 225--239, Adelaide, 1990. Springer-Verlag. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Inclusive pruning: A new class of pruning rule for unordered.. - Webb (1996) (2 citations) Self-citation (Webb) (Correct)
No context found.
Geo#rey I. Webb. Techniques for e#cient empirical induction. In C. J. Barter and M. J. Brooks (editors), AI'88 -- Proceedings of the Third Australian Joint Conference on Artificial Intelligence, pages 225--239, Adelaide, 1990. Springer-Verlag.
OPUS: An Efficient Admissible Algorithm for Unordered Search - Webb (1995) (30 citations) Self-citation (Webb) (Correct)
....in the search tree descending from n without excluding a sole goal node from that search tree. The OPUS algorithms di#er from most previous admissible search algorithms employed in machine learning (Clearwater Provost, 1990; Murphy Pazzani, 1994; Rymon, 1992; Segal Etzioni, 1994; Webb, 1990) in that when such operators are identified, they are removed from consideration in all branches of the search tree that descend from the current node. In contrast, the other algorithms only remove a single branch at a time without altering the operators considered below sibling branches, thereby ....
....(so long as it is not possible to reach a single node by application of di#erent sets of operators) 3. Fixed order Search A number of recent machine learning algorithms have performed restricted admissible search (Clearwater Provost, 1990; Rymon, 1993; Schlimmer, 1993; Segal Etzioni, 1994; Webb, 1990). All of these algorithms are based on an organization of the search tree, that, when considering the search problem illustrated in Figures 1 to 3, traverse the search space in the manner depicted in Figure 4. Such an organization is achieved by arranging the operators in a predefined order, and ....
[Article contains additional citation context not shown here]
Webb, G. I. (1990). Techniques for e#cient empirical induction. In Barter, C. J., & Brooks, M. J. (Eds.), AI'88 -- Proceedings of the Third Australian Joint Conference on Artificial Intelligence, pp. 225--239 Adelaide. Springer-Verlag.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC