Integration of complexity metrics with the use of decision trees

Authors:
Peter Kokol;Janez Brest;Milan Zorman;Vili Podgorelec
Affiliations:
University of Maribor, FERI, Smetanova 17, 2000 Maribor, Slovenia;University of Maribor, FERI, Smetanova 17, 2000 Maribor, Slovenia;University of Maribor, FERI, Smetanova 17, 2000 Maribor, Slovenia;University of Maribor, FERI, Smetanova 17, 2000 Maribor, Slovenia
Venue:
ACM SIGSOFT Software Engineering Notes
Year:
1998

Citing 6
Cited 2

Software engineering metrics and models

Software engineering metrics and models
Learning from Examples: Generation and Evaluation of Decision Trees for Software Resource Analysis

IEEE Transactions on Software Engineering - Special Issue on Artificial Intelligence in Software Applications
Software complexity—an alternative view

ACM SIGPLAN Notices
The mathematical validity of software metrics

ACM SIGSOFT Software Engineering Notes
Fractal structure of random programs

ACM SIGPLAN Notices
Applying Software Metrics

Applying Software Metrics

Measuring formal specification with &agr;-metric

ACM SIGSOFT Software Engineering Notes
A dynamic software metric and debugging tool

ACM SIGSOFT Software Engineering Notes

Quantified Score

Hi-index	0.00

Visualization

Abstract

We would like to present the use of the decision tree approach in the integration of various complexity metrics on the example of distinguishing between random and ordinary programs. Following our proposition that randomness indicates meaningless we can state that with the approach we are able to measure the "meaning" of computer programs. The main contributions stated in the paper is that the new way of metrics integration enabling one to combine metrics with various measurement units.