Rule induction
Rule induction is an area of machine learning in which formal rules are extracted from a set of observations. The rules extracted may represent a full scientific model of the data, or merely represent local patterns in the data.
Paradigms
Some major rule induction paradigms are:
- Association rule learning algorithms (e.g., Agrawal)
- Decision rule algorithms (e.g., Quinlan 1987)
- Hypothesis testing algorithms (e.g., RULEX)
- Horn clause induction
- Version spaces
- Rough set rules
- Inductive Logic Programming
- Boolean decomposition (Feldman)
Algorithms
Some rule induction algorithms are:
References
- ↑ Sahami, Mehran. "Learning classification rules using lattices." Machine learning: ECML-95 (1995): 343-346.
- Quinlan, J. R. (1987). "Generating production rules from decision trees" (PDF). In McDermott, John. Proceedings of the Tenth International Joint Conference on Artificial Intelligence (IJCAI-87). Milan, Italy. pp. 304–307.
This article is issued from
Wikipedia.
The text is licensed under Creative Commons - Attribution - Sharealike.
Additional terms may apply for the media files.