Rule induction

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
File:Decision Tree.jpg
Example of a decision tree

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.

Data mining in general and rule induction in detail are trying to create algorithms without human programming but with analyzing existing data structures.[1]: 415-  In the easiest case, a rule is expressed with “if-then statements” and was created with the ID3 algorithm for decision tree learning.[2]: 7 [1]: 348  Rule learning algorithm are taking training data as input and creating rules by partitioning the table with cluster analysis.[2]: 7  A possible alternative over the ID3 algorithm is genetic programming which evolves a program until it fits to the data.[3]: 2 

Creating different algorithm and testing them with input data can be realized in the WEKA software.[3]: 125  Additional tools are machine learning libraries for Python, like scikit-learn.

Paradigms

[edit | edit source]

Some major rule induction paradigms are:

Algorithms

[edit | edit source]

Some rule induction algorithms are:

References

[edit | edit source]
  1. ^ a b Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  2. ^ a b Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  3. ^ a b Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  4. ^ Sahami, Mehran. "Learning classification rules using lattices." Machine learning: ECML-95 (1995): 343-346.
  • Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).