An Efficient Admissible Algorithm for Unordered Search Segal, R., & Etzioni, O. (1994). Learning decision lists using homogeneous rules. In AAAI94.  Home/Search   Document Not in Database   Summary   Related Articles

....search operators that can be excluded from consideration 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 ....

An Efficient Admissible Algorithm for Unordered Search Segal, R., & Etzioni, O. (1994). Learning decision lists using homogeneous rules. In AAAI94.

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