The algorithm ID3 (Quinlan) uses the method top-down induction of decision trees. Given a set of classified examples a decision tree is induced, biased by the information gain measure, which heuristically leads to small trees. The examples are given in attribute-value representation. The set of possible classes is finite. Only tests, that split the set of instances of the underlying example languages depending on the value of a single attribute are supported.
Data logger Power transision function switch among different power modes based on new Renesus microcontroller. This module has been tested on the renesus develop board with different LED to indicate different power modes.
It s an interface for using huffman trees (data structure application) that can be used for compression and a test program with CLI in a form of a menu to test those features.
