Current Slide
Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.
Specialization
- Specialization algorithms start from very general descriptions and specializes those until they are correct.
-
This is done by adding additional premises to the antecedent of a rule, or by restricting the range of an attribute which is used in an antecedent.
- Algorithms relying on specialization generally have the problem of overspecialization: previous specialization steps could become unnecessary due to subsequent specialization steps.
-
This brings along the risk for ending up with results that are not maximal-general.
-
Some examples of (heuristic) specialization algorithms are the following: ID3, AQ, C4, CN2, CABRO, FOIL, or PRISM; references at the end of the lecture.
Speaker notes:
Content Tools
Tools
Sources (0)
Tags (0)
Comments (0)
History
Usage
Questions (0)
Playlists (0)
Quality
Sources
There are currently no sources for this slide.