1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
{-|
Module : Gargantext.Graph.Similarities
Description : Similarity management tools
Copyright : (c) CNRS, 2017-Present
License : AGPL + CECILL v3
Maintainer : team@gargantext.org
Stability : experimental
Portability : POSIX
-}
{-# LANGUAGE Strict #-}
module Gargantext.Core.Methods.Similarities
where
import Data.Aeson
import Data.Array.Accelerate (Matrix)
import Data.Swagger
import Data.Text (Text)
import GHC.Generics (Generic)
import Gargantext.Core.Methods.Similarities.Accelerate.Conditional (measureConditional')
import Gargantext.Core.Methods.Similarities.Accelerate.Distributional (logDistributional2)
-- import Gargantext.Core.Text.Metrics.Count (coocOn)
-- import Gargantext.Core.Viz.Graph.Index
import Gargantext.Prelude (Ord, Eq, Int, Double, Show, map)
import Prelude (Enum, Bounded, minBound, maxBound)
import Test.QuickCheck (elements)
import Test.QuickCheck.Arbitrary
-- import qualified Data.Map as Map
import qualified Data.Text as Text
------------------------------------------------------------------------
data Similarity = Conditional | Distributional
deriving (Show, Eq)
measure :: Similarity -> Matrix Int -> Matrix Double
measure Conditional x = measureConditional' x
measure Distributional x = logDistributional2 x
------------------------------------------------------------------------
withMetric :: GraphMetric -> Similarity
withMetric Order1 = Conditional
withMetric _ = Distributional
------------------------------------------------------------------------
-- Order2 type is for keeping Database json compatibility
-- it is supposed to be removed in the future
data GraphMetric = Order1 | Order2 | Order2_A | Order2_B
deriving (Generic, Eq, Ord, Enum, Bounded, Show)
instance FromJSON GraphMetric
instance ToJSON GraphMetric
instance ToSchema GraphMetric
instance Arbitrary GraphMetric where
arbitrary = elements [ minBound .. maxBound ]
------------------------------------------------------------------------
-- Let's take 2 different forms to produce another one:
hello_words :: [[Text]]
hello_words = map (Text.splitOn "-") wrds
where
wrds = [ "bio-logie"
, "socio-logie"
-- , "ana-logie"
-- , "micro-scope"
-- , "micro-phone"
-- , "micro-cosme"
-- -- , "micro-biote"
-- , "tele-scope"
-- , "tele-phone"
-- , "tele-surveillance"
-- , "macro-scope"
-- , "macro-cosme"
-- , "macro-biote"
]
{-
hello_matrix ms' = measureConditional
$ map2mat Square 0 (Map.size ti)
$ toIndex ti ms
where
ms = coocOn identity ms'
(ti, it) = createIndices ms
-}