In this paper two machine learning algorithms, decision trees (DT) and Hamming clustering (HC), are compared in building approximate reliability expression (RE). The main idea is to employ a classification technique, trained on a restricted subset of data, to produce an estimate of the RE, which provides reasonably accurate values of the reliability. The experiments show that although both methods yield excellent predictions, the HC procedure achieves better results with respect to the DT algorithm.
Empirical models based on machine learning techniques for determining approximated reliability expressions
M Muselli
2004
Abstract
In this paper two machine learning algorithms, decision trees (DT) and Hamming clustering (HC), are compared in building approximate reliability expression (RE). The main idea is to employ a classification technique, trained on a restricted subset of data, to produce an estimate of the RE, which provides reasonably accurate values of the reliability. The experiments show that although both methods yield excellent predictions, the HC procedure achieves better results with respect to the DT algorithm.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


