{-# OPTIONS_HADDOCK prune #-}
{-# LANGUAGE BangPatterns #-}
module Numeric.Eproc.Merge (
log_mean
, log_product
, ebh
) where
import qualified Data.List as L
import Data.Ord (Down(..), comparing)
import Numeric.Eproc.Common (log_sum_exps)
log_mean :: [Double] -> Double
log_mean :: [Double] -> Double
log_mean [Double]
les = case [Double]
les of
[] -> Double
0
[Double]
_ -> [Double] -> Double
log_sum_exps [Double]
les Double -> Double -> Double
forall a. Num a => a -> a -> a
- Double -> Double
forall a. Floating a => a -> a
log (Int -> Double
forall a b. (Integral a, Num b) => a -> b
fromIntegral ([Double] -> Int
forall a. [a] -> Int
forall (t :: * -> *) a. Foldable t => t a -> Int
length [Double]
les))
{-# INLINE log_mean #-}
log_product :: [Double] -> Double
log_product :: [Double] -> Double
log_product = (Double -> Double -> Double) -> Double -> [Double] -> Double
forall b a. (b -> a -> b) -> b -> [a] -> b
forall (t :: * -> *) b a.
Foldable t =>
(b -> a -> b) -> b -> t a -> b
L.foldl' Double -> Double -> Double
forall a. Num a => a -> a -> a
(+) Double
0
{-# INLINE log_product #-}
ebh :: Double -> [Double] -> [Int]
ebh :: Double -> [Double] -> [Int]
ebh !Double
alpha [Double]
les = Int -> [Int] -> [Int]
forall a. Int -> [a] -> [a]
take Int
k [Int]
ranked
where
!n :: Double
n = Int -> Double
forall a b. (Integral a, Num b) => a -> b
fromIntegral ([Double] -> Int
forall a. [a] -> Int
forall (t :: * -> *) a. Foldable t => t a -> Int
length [Double]
les) :: Double
ranked :: [Int]
ranked = ((Int, Double) -> Int) -> [(Int, Double)] -> [Int]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (Int, Double) -> Int
forall a b. (a, b) -> a
fst (((Int, Double) -> (Int, Double) -> Ordering)
-> [(Int, Double)] -> [(Int, Double)]
forall a. (a -> a -> Ordering) -> [a] -> [a]
L.sortBy (((Int, Double) -> Down Double)
-> (Int, Double) -> (Int, Double) -> Ordering
forall a b. Ord a => (b -> a) -> b -> b -> Ordering
comparing (Double -> Down Double
forall a. a -> Down a
Down (Double -> Down Double)
-> ((Int, Double) -> Double) -> (Int, Double) -> Down Double
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (Int, Double) -> Double
forall a b. (a, b) -> b
snd)) ([Int] -> [Double] -> [(Int, Double)]
forall a b. [a] -> [b] -> [(a, b)]
zip [Int
0 ..] [Double]
les))
sorted :: [Double]
sorted = (Double -> Double -> Ordering) -> [Double] -> [Double]
forall a. (a -> a -> Ordering) -> [a] -> [a]
L.sortBy ((Double -> Down Double) -> Double -> Double -> Ordering
forall a b. Ord a => (b -> a) -> b -> b -> Ordering
comparing Double -> Down Double
forall a. a -> Down a
Down) [Double]
les
!k :: Int
k = (Int -> Int -> Int) -> Int -> [Int] -> Int
forall b a. (b -> a -> b) -> b -> [a] -> b
forall (t :: * -> *) b a.
Foldable t =>
(b -> a -> b) -> b -> t a -> b
L.foldl' Int -> Int -> Int
forall a. Ord a => a -> a -> a
max Int
0
[ Int
j
| (Int
j, Double
e) <- [Int] -> [Double] -> [(Int, Double)]
forall a b. [a] -> [b] -> [(a, b)]
zip [ Int
1 .. ] [Double]
sorted
, Double
e Double -> Double -> Bool
forall a. Ord a => a -> a -> Bool
>= Double -> Double
forall a. Floating a => a -> a
log (Double
n Double -> Double -> Double
forall a. Fractional a => a -> a -> a
/ (Double
alpha Double -> Double -> Double
forall a. Num a => a -> a -> a
* Int -> Double
forall a b. (Integral a, Num b) => a -> b
fromIntegral Int
j)) ]