Examples of eu.planets_project.pp.plato.sensitivity.OrderChangeCountTest$OrderChangeCountResult

eu.planets_project.pp.plato.sensitivity.OrderChangeCountTest

This senstitivity analysis test is similar to the OrderChangeTest. At start (with the normal importance weights) the order of the alternatives is evaluated - which alternative is currently the best, which is second best etc. This is the "normal order". After each iteration the alternatives are evaluated again. Then the order of the alternatives is compared to the "normal order". Afterwards the ratio between the number of all iterations and the number of iterations where the order has changed is computet (e.g. a node was processed 50 times and in 15 of these iterations the order of the alternatives has chaged - compared to the "normal order"). If the ratio is higher than a certain threshold then the node is considered sensitive. @author Jan Zarnikov

        // FIXME HK reintroduce SENSITIVITY analysis for large trees - Plato 3.1
        if (selectedPlan.getTree().getRoot().getAllLeaves().size() < 40) {
            log.debug("Starting sensitivity analysis ... " );
            sumNode.analyseSensitivity(
                    new SimpleIterativeWeightModifier(),
                    new OrderChangeCountTest(selectedPlan.getTree()
                            .getRoot(), sumAggregator, acceptableAlternatives));
            log.debug("Sensitivity analysis took: " + (System.currentTimeMillis() - start) + "ms.");
        } else {
            log.debug("Sensitivity analysis NOT CONDUCTED: Too many leaves.");
        }

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.

Examples of eu.planets_project.pp.plato.sensitivity.OrderChangeCountTest$OrderChangeCountResult

Related Classes of eu.planets_project.pp.plato.sensitivity.OrderChangeCountTest$OrderChangeCountResult