From adadf14888b2f3b2a79ef782bc6eaa29c4702673 Mon Sep 17 00:00:00 2001 From: Filip Gralinski Date: Tue, 19 Mar 2019 07:46:10 +0100 Subject: [PATCH] Fix simple mistake when plotting a Loess graph --- src/GEval/Core.hs | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/GEval/Core.hs b/src/GEval/Core.hs index 378c46f..5008778 100644 --- a/src/GEval/Core.hs +++ b/src/GEval/Core.hs @@ -755,7 +755,7 @@ gevalCore' (ProbabilisticSoftFMeasure beta) _ = gevalCoreWithoutInput parseAnnot probabilisticSoftAgg = CC.foldl probabilisticSoftFolder ([], [], fromInteger 0, 0) probabilisticSoftFolder (r1, p1, g1, e1) (r2, p2, g2, e2) = (r1 ++ r2, p1 ++ p2, g1 + g2, e1 + e2) loessGraph :: ([Double], [Double], Double, Int) -> Maybe GraphSeries - loessGraph (results, probs, _, _) = Just $ GraphSeries $ Prelude.map (\x -> (x, loess results' probs' x)) $ Prelude.filter (\p -> p >= lowest && p <= highest) $ Prelude.map (\d -> 0.01 * (fromIntegral d)) [1..99] + loessGraph (results, probs, _, _) = Just $ GraphSeries $ Prelude.map (\x -> (x, loess probs' results' x)) $ Prelude.filter (\p -> p >= lowest && p <= highest) $ Prelude.map (\d -> 0.01 * (fromIntegral d)) [1..99] where results' = DVU.fromList results probs' = DVU.fromList probs lowest = Data.List.minimum probs