See this document in CiteSeerX!

OPUS: An Efficient Admissible Algorithm for Unordered Search (1995)  (Make Corrections)  (31 citations)
Geoffrey I. Webb
Journal of Artificial Intelligence Research



  Home/Search   Context   Related

Links:   DBLP

 
View or download:
deakin.edu.au/~webb/Papers...OPUS4.ps.Z
cmu.edu/afs/cs/project/j...webb95a.ps.Z
deakin.edu.au/webb/Papers/OPUS4.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  deakin.edu.au/~web...Publications (more)
From:  washington.edu/...withabstracts
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: OPUS is a branch and bound search algorithm that enables efficient admissible search through spaces for which the order of search operator application is not significant. The algorithm's search efficiency is demonstrated with respect to very large machine learning search spaces. The use of admissible search is of potential value to the machine learning community as it means that the exact learning biases to be employed for complex learning tasks can be precisely specified and manipulated. OPUS... (Update)

Context of citations to this paper:   More

...and selects the beam width dynamically. DALI mainly differs from LFC on two steps: 1. A systematic search to avoid redundant combinations [22, 27], Lines 3 4, Fig. 5. Each monomial F i conjoins several boolean features (or their complements) e.g. F i = x 1 x 3 x 5 . Because...

.... Systematic search expands the children of search nodes in a manner that ensures that no node can ever be generated more than once [9 12, 14]. Because non redundant expansion is achieved without access to large, rapidly changing data structures, such as lists of open and closed...

Cited by:   More
An Analysis of Rule Learning Heuristics - Johannes Urnkranz Austrian   (Correct)
Association Rule Mining on Remotely Sensed Imagery Using P-Trees - Ding (2002)   (Correct)
An Investigation Into the Relative Abilities of Three Alternative .. - Butler   (Correct)

Similar documents (at the sentence level):
5.6%:   OPUS: A systematic search algorithm and its application to.. - Webb (1993)   (Correct)

Active bibliography (related documents):   More   All
0.6:   Inclusive pruning: A new class of pruning rule for unordered.. - Webb (1996)   (Correct)
0.4:   Rule-space Search for Knowledge-based Discovery - Provost, al. (1999)   (Correct)
0.3:   Discovering Associations With Numeric Variables - Webb (2001)   (Correct)

Similar documents based on text:   More   All
0.6:   Reinforcing a Generic Computer Model for Novice Programmers - Philip Smith Geoffrey   (Correct)
0.4:   Systematic Search for Categorical Attribute-Value . . . - Webb (1993)   (Correct)
0.4:   OPUS-97: A Generalized Operational Pipeline System - Rose (1998)   (Correct)

Related documents from co-citation:   More   All
16:   Detecting complex dependencies in categorical data - Oates, Gregory et al. - 1994
14:   Search through systematic set enumeration (context) - Rymon - 1992
11:   Efficiently inducing determinations: A complete and systematic search algorithm .. - Schlimmer - 1993

BibTeX entry:   (Update)

Geoffrey I. Webb. OPUS: An efficient admissible algorithm for unordered search. Journal of Artificial Intelligence Research, 3:45--83, 1996. http://citeseer.ist.psu.edu/article/webb95opus.html   More

@article{ webb95opus,
    author = "Geoffrey I. Webb",
    title = "{OPUS}: An Efficient Admissible Algorithm for Unordered Search",
    journal = "Journal of Artificial Intelligence Research",
    volume = "3",
    pages = "431-465",
    year = "1995",
    url = "citeseer.ist.psu.edu/article/webb95opus.html" }
Citations (may not include all citations):
667   UCI repository of machine learning databases (context) - Murphy, Aha - 1993
458   A theory of diagnosis from first principles (context) - Reiter - 1987  ACM   DBLP
392   A theory and methodology of inductive learning (context) - Michalski - 1984  ACM   DBLP
266   Heuristics: Intelligent Search Strategies for Computer Probl.. (context) - Pearl - 1984
180   The CN2 induction algorithm (context) - Clark, Niblett - 1989  ACM   DBLP
151   Problem-solving Methods in Artificial Intelligence (context) - Nilsson - 1971
100   Branch and bound methods: A survey (context) - Lawler, Wood - 1966
74   A branch and bound algorithm for feature subset selection (context) - Narendra, Fukunaga - 1977  DBLP
68   Rule induction with CN2: Some recent improvements (context) - Clark, Boswell - 1991  DBLP
66   Search through systematic set enumeration (context) - Rymon - 1992  DBLP
49   Version spaces: A candidate elimination approach to rule lea.. (context) - Mitchell - 1977  DBLP
42   An information theoretic approach to rule induction from dat.. (context) - Smyth, Goodman - 1992  ACM   DBLP
38   Exploring the decision forest: An empirical investigation of.. - Murphy, Pazzani - 1994  DBLP
36   Oversearching and layered search in empirical learning - Quinlan, Cameron-Jones - 1995  DBLP
31   An SE-tree based characterization of the induction problem - Rymon - 1993  DBLP
20   RL4: A tool for knowledge-based induction (context) - Clearwater, Provost - 1990
18   Generalizing version spaces (context) - Hirsh - 1994  ACM   DBLP
15   Systematic search for categorical attribute-value data-drive.. - Webb - 1993
8   Implementing Valiant's learnability theory using random sets (context) - Oblow - 1992  ACM   DBLP
6   On minimizing a set of tests (context) - Moret, Shapiro - 1985
3   A heuristic programming study of theory formation in science (context) - Buchanan, Feigenbaum et al. - 1971  ACM   DBLP
3   Recent progress in learning decision lists by prepending inf.. - Webb
3   Generality is more significant than complexity: Toward alter.. - Webb
2   cient empirical induction (context) - Webb, Techniques - 1990
1   A formal basis for the heuristic determination of minimum co.. (context) - pp, Boston et al. - 1968
1   Learning decision lists using homogeneous rules (context) - Admissible, Unordered et al. - 1994  ACM   DBLP
1   An assumption-based TMS (context) - Society, de Kleer - 1986  ACM   DBLP



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www3.cm.deakin.edu.au/~webb/Publications.html):   More
Evaluation of data aging: A technique for discounting old data .. - Webb, Kuzmycz (1998)   (Correct)
Control, capabilities and communication: Three key issues for.. - Geoffrey Webb   (Correct)
Cost-Sensitive Specialization - Webb (1996)   (Correct)

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