Name
Abstract | ||
|---|---|---|
The authors regard the rule induction problem as a search in the lattice of possible rules. Two kinds of search directions (top=generalization and down=specialization) and therefore two different kinds of algorithms exist. They propose the algorithms RELAX and its heuristical modification H-RELAX, which both use generalization as the search direction and therefore can be used for rule induction and rule pruning. They produce a minimal set of rules or a set of rules which allow object recognition with minimal costs. Both algorithms also allow an incremental and knowledge-based search process and can be combined with other algorithms |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1109/TAI.1991.167051 | San Jose, CA |
Keywords | Field | DocType |
knowledge engineering,h-relax,relax,generalization,incremental search,knowledge-based search,object recognition,rule induction,rule pruning,search directions,specialization,circuits,lattices,boolean functions,knowledge base,machine learning,production | Lattice (order),Pattern recognition,Computer science,Artificial intelligence,Rule induction,Knowledge engineering,Machine learning,Pruning,Cognitive neuroscience of visual object recognition | Conference |
Citations | PageRank | References |
1 | 0.39 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dieter Fensel | 1 | 1 | 0.39 |
| Jörg Klein | 2 | 1 | 0.39 |